Skip to main content
Log in

Decompositions of theM/M/1 transition function

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Two decompositions are established for the probability transition function of the queue length process in the M/M/1 queue by a simple probabilistic argument. The transition function is expressed in terms of a zero-avoiding probability and a transition probability to zero in two different ways. As a consequence, the M/M/1 transition function can be represented as a positive linear combination of convolutions of the busy-period density. These relations provide insight into the transient behavior and facilitate establishing related results, such as inequalities and asymptotic behavior.

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: starting at the origin, Queueing Systems 2 (1987) 41–65.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  5. J. Abate and W. Whitt, In search of the camel: the shape of the M/M/1 transition function, in preparation.

  6. M. Abramowitz and I.A. Stegun (eds.),Handbook of Mathematical Functions (Dover, New York, 1972).

    Google Scholar 

  7. F. Baccelli and W.A. Massey, A sample path analysis of the M/M/1 queue, J. Appl. Prob. 26 (1989) 418–422.

    Google Scholar 

  8. N.T.J. Bailey, A continuous time treatment of a simple queue using generating functions, J. Roy. Statist. Soc. B16 (1954) 288–291.

    Google Scholar 

  9. J.W. Cohen,The Single Server Queue, 2nd ed. (North-Holland, Amsterdam, 1982).

    Google Scholar 

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

    Google Scholar 

  11. G. Doetsch,Introduction to the Theory and Application of Laplace Transformation (Springer, New York, 1974).

    Google Scholar 

  12. S. Karlin,Total Positivity (Stanford University Press, Stanford, CA, 1968).

    Google Scholar 

  13. S. Karlin and J.L. McGregor, A characterization of birth and death processes, Proc. Nat. Acad. Sci. USA 45 (1959) 375–379.

    Google Scholar 

  14. W. Magnus, F. Oberhettinger and R.P. Soni,Formulas and Theorems for the Special Functions of Mathematical Physics, 3rd ed. (Springer, New York, 1966).

    Google Scholar 

  15. W.A. Massey, TheM/M/1 queue relaxation parameter depends on its initial distribution, AT&T Bell Laboratories, Murray Hill, NJ (1989).

    Google Scholar 

  16. N.U. Prabhu,Queues and Inventories (Wiley, New York, 1965).

    Google Scholar 

  17. N.U. Prabhu,Stochastic Storage Processes (Springer, New York, 1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abate, J., Kijima, M. & Whitt, W. Decompositions of theM/M/1 transition function. Queueing Syst 9, 323–336 (1991). https://doi.org/10.1007/BF01158470

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158470

Keywords

Navigation