D/M/1 queue
In queueing theory, a discipline within the mathematical theory of probability, a D/M/1 queue represents the queue length in a system having a single server, where arrivals occur at fixed regular intervals and job service requirements are random with an exponential distribution. The model name is written in Kendall's notation. Agner Krarup Erlang first published a solution to the stationary distribution of a D/M/1 and D/M/k queue, the model with k servers, in 1917 and 1920.
primaryTopic
D/M/1 queue
In queueing theory, a discipline within the mathematical theory of probability, a D/M/1 queue represents the queue length in a system having a single server, where arrivals occur at fixed regular intervals and job service requirements are random with an exponential distribution. The model name is written in Kendall's notation. Agner Krarup Erlang first published a solution to the stationary distribution of a D/M/1 and D/M/k queue, the model with k servers, in 1917 and 1920.
has abstract
In queueing theory, a discipli ...... h k servers, in 1917 and 1920.
@en
Wikipage page ID
38,480,284
Wikipage revision ID
727,475,761
comment
In queueing theory, a discipli ...... h k servers, in 1917 and 1920.
@en
label
D/M/1 queue
@en