A Note on the M/Aff/1 Queue with λ = µ.

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. [ABSTRACT FROM AUTHOR]

Copyright of Operations Research is the property of INFORMS: Institute for Operations Research and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)