 M-G-1 queue

An $M/G/1$ queue has Poisson arrivals, independent identically distributed service times, and one server. If service has mean $m$ and $\lambda m<1$, its mean busy period isThis follows by decomposing the busy period into the first service and the busy-period descendants of arrivals during that service.