Skip to main content
Log in

The Moments of the M/M/s Queue Length Process

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

A representation for the moments of the number of customers in a M/M/s queueing system is deduced from the Karlin and McGregor representation for the transition probabilities. This representation allows us to study the limit behavior of the moments as time tends to infinity. We study some consequences of the representation for the mean.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Abate and W. Whitt, Transient behavior of the M / M / 1 queue via the Laplace transform, Appl. Probab. 20 (1988) 145–178.

    Google Scholar 

  2. J. Abate and W. Whitt, Simple spectral representations for the M / M / 1 queue, Queueing Systems 3 (1988) 321–346.

    Google Scholar 

  3. J. Abate and W. Whitt, Calculating time-dependent performance measures for the M / M / 1 queue, IEEE Trans. Commun. 37 (1989) 1102–1104.

    Google Scholar 

  4. T.S. Chihara, An Introduction to Orthogonal Polynomials (Gordon and Breach, New York, 1978).

    Google Scholar 

  5. J.W. Cohen, The Single Server Queue (North-Holland, Amsterdam, 1982).

    Google Scholar 

  6. B. Conolly, Lecture Notes on Queueing Systems (Wiley, New York, 1975).

    Google Scholar 

  7. P. Coolen-Schrijner and E.A. van Doorn, On the convergence to stationarity of birth–death processes, J. Appl. Probab. 38 (2001) 696–706.

    Google Scholar 

  8. A. Erdélyi, Higher Transcendental Functions, Vol. II (McGraw-Hill, New York, 1953).

    Google Scholar 

  9. S. Karlin and J.L. McGregor, The differential equations of birth and death process and the Stieltjes moment problem, Trans. Amer. Math. Soc. 85 (1957) 489–546.

    Google Scholar 

  10. S. Karlin and J.L. McGregor, The classification of birth and death processes, Trans. Amer. Math. Soc. 86 (1957) 366–400.

    Google Scholar 

  11. S. Karlin and J.L. McGregor, Many server queueing processes with Poisson input and exponential service times, Pacific J. Math. 8 (1958) 87–118.

    Google Scholar 

  12. J. Medhi, Stochastic Models in Queueing Theory (Academic Press, New York, 1991).

    Google Scholar 

  13. T.L. Saaty, Elements of Queueing Theory with Applications (Dover, New York, 1961).

    Google Scholar 

  14. W. Stadje and P.R. Parthasarathy, On the convergence to stationarity of the many-server Poisson queue, J. Appl. Probab. 36 (1999) 546–557.

    Google Scholar 

  15. L. Takács, Introduction to the Theory of Queues (Oxford Univ. Press, Oxford, 1962).

    Google Scholar 

  16. M.C.T. van de Coevering, Computing transient performance measures for the M / M / 1 queue, Or Spektrum 17 (1995) 19–22.

    Google Scholar 

  17. E.A. van Doorn, Stochastic Monotonicity and Queueing Applications of Birth–Death Processes, Lecture Notes in Statistics, Vol. 4 (Springer, New York, 1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marcellán, F., Pérez, G. The Moments of the M/M/s Queue Length Process. Queueing Systems 44, 281–304 (2003). https://doi.org/10.1023/A:1024718709227

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024718709227

Navigation