Morphing M/M/m: A New View of an Old Queue

Morphing M/M/m: A New View of an Old Queue

In this centennial year of Erlang's 1917 paper that solved the M/M/m queue, we derive the residence time without resorting to the (by now) conventional machinery of probability theory and Markov chains. Addendum added June 27, 2018.

Ced140140e9ae226f0d9ef0fbb84a3a1?s=128

Dr. Neil Gunther

July 18, 2017
Tweet