= M/M/1 queue
{c}
{wiki}
An <M M 1 queue> has a <Poisson process> of arrivals of rate $\lambda>0$, one server, <independent> exponential <service time>[service times] of rate $\mu>0$, and unlimited waiting room. Arrivals are <independent> of <service time>[service times]. The two M symbols denote the <memoryless property>[memoryless] arrival and service assumptions; the final one denotes the number of servers. Under a work-conserving service discipline, the queue population $N_t$, including the customer in service, is a <birth-death process> with rates
$$
q_{n,n+1}=\lambda\quad(n\geq0),\qquad q_{n,n-1}=\mu\quad(n\geq1).
$$
The server has no departure clock when the queue is empty. The traffic intensity $\rho=\lambda/\mu$ is the <server utilization> in equilibrium when $\rho<1$. <Detailed balance> then gives the <Stationary distribution> $\pi_n=(1-\rho)\rho^n$, whose <mean> is $\rho/(1-\rho)$. For example, three arrivals per minute and four services per minute give $\rho=3/4$ and <mean> queue population three. Raising arrivals to $3.8$ per minute raises that <mean> to nineteen: operation near capacity amplifies congestion. These formulas count the customer being served as well as those waiting.https://ocw.mit.edu/courses/2-854-introduction-to-manufacturing-systems-fall-2016/927056a1af54772a587fd84ad4951e71_MIT2_854F16_Mm1Queue.pdf[MIT 2.854 M/M/1 Queue notes, pages 1-2, system population and waiting population]{ref}
Back to article page