Technical Note—A Note on the M/M/1 Queue with λ = μ
Abstract
The simplest Markovian queue where the arrival rate equals the service rate (λ = μ) has been successfully treated using a diffusion approximation that assumes a continuous state space in continuous time. Here it is shown that an intuitively appealing approach using a simple restricted random walk with a discrete state space in discrete time yields the same results.

