Scholion.ai

Technical Note—A Note on theM/M/1 Queue with λ = μ

Diego R. Roque

Operations Research · 1981 · Volume 29 · Issue 6

DOI: 10.1287/opre.29.6.1231

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.

Keywords

705 Markovian queue (M/M/1) in heavy traffic, 568 random walk as model structure, 706 in harmony with diffusion model

Enable JavaScript for citation tools and additional paper interactions.