Abstract
We propose approximations for the time-dependent queue size distribution Pn(t) and the mean queue size E[X(t)] 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 Pn(t) and E[X(t)]. 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 Pn(t) and E[X(t)] 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
