We propose approximations for the time-dependent queue size distribution Pnt and the mean queue size E[Xt] of an M/M/1 queue. With a Laplace transform-generating function technique, the exact analysis involves the complex root u* inside the unit circle of a certain quadratic. The exact value of u* leads to transforms that, when inverted, yield rather complicated expressions for Pnt and E[Xt]. We discuss three iterative procedures that give successive rational approximations for u*. These approximations yield, for the queue size distribution and the mean queue size, approximate transforms that are rational and easier to invert. We obtain sharp bounds for Pnt and E[Xt] for a wide range of parameter values by performing the second iteration and combining the approximate results given by the iterative procedures.
The methods can be applied to approximate the behavior of more complicated queues. Applications to the M/M/2 queue and the M/Ep/1 queue are discussed briefly.
[1]
Norman T. J. Bailey.
The Elements of Stochastic Processes with Applications to the Natural Sciences
,
1964
.
[2]
Marcel F. Neuts,et al.
The single server queue in discrete time‐numerical analysis III
,
1973
.
[3]
Vincent Hodgson,et al.
The Single Server Queue.
,
1972
.
[4]
D. P. Gaver,et al.
Observing Stochastic Processes, and Approximate Transform Inversion
,
1966,
Oper. Res..
[5]
Gordon F. Newell,et al.
Applications of queueing theory
,
1971
.
[6]
S. C. Moore,et al.
Approximating the Behavior of Nonstationary Single-Server Queues
,
1975,
Oper. Res..