Mean busy period of an M-M-1 queue (source code)

= Mean busy period of an M-M-1 queue

The <busy period> of an <M M 1 queue> starts with an arrival into an empty queue and ends the next time the queue becomes empty. Assume <independent> Poisson arrivals of rate $\lambda>0$ and <service time>[exponential service times] of rate $\mu>0$. If $\lambda<\mu$, its <mean> is
$$
\mathbb E B=\frac1{\mu-\lambda}.
$$
One derivation follows the family of customers generated during services. The initial customer's <mean> service time is $1/\mu$; during that service, the expected number of arrivals is $\lambda/\mu$. Each new arrival generates further arrivals during its own service. The expected total service time is therefore the nonnegative <geometric series> $\mu^{-1}\sum_{k\geq0}(\lambda/\mu)^k$, which gives the formula. This argument can first be applied to finitely many generations and then justified by monotone convergence.

When $\lambda=\mu$, the <busy period> is finite <almost surely> but has infinite <mean>. When $\lambda>\mu$, it has <probability> $1-\mu/\lambda$ of never ending; its extended <mean> is also infinite. Thus the divergence at critical load reflects a change in return behavior, not an infinite <mean> individual service time.