Skip to main content
Log in

A new approach to the busy period of the M/M/1 queue

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In this paper, we provide a new approach to the computation of the Laplace transform of the length of the busy period of the M/M/1 queue with constrained workload (finite dam), without the use of complex analysis.

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. B.F. Baccelli and A.M. Makowski, Dynamic, transient and stationary behavior of the M/GI/1 queue via martingales, Ann. Probab. 17 (1989) 1691–1699.

    Google Scholar 

  2. J.W. Cohen, The Single Server Queue (North-Holland, Amsterdam/London, 1969).

  3. E.B. Dynkin, Markov Processes, Vol. 1 (Wiley, New York, 1966).

    Google Scholar 

  4. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 2 (Wiley, New York, 1971).

    Google Scholar 

  5. J. Gani, Problems in the probability theory of storage systems, J. Roy. Statist. Soc. B 19 (1957) 181–206.

    Google Scholar 

  6. D.P. Heyman, An approximation for the busy period of the M/G/1 queue using a diffusion model, J. Appl. Probab. 11 (1974) 159–169.

    Article  Google Scholar 

  7. S. Karlin and H.M. Taylor, A First Course in Stochastic Processes, 2nd ed. (Academic Press, New York, 1975).

    Google Scholar 

  8. T. Kurtz, Approximation of population processes, in: CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 36 (SIAM, Philadelphia, PA, 1981).

    Google Scholar 

  9. E.Y. Lee and K.K.J. Kinateder, The expected wet period of finite dam with exponential inputs, preprint (1997).

  10. P.A.P. Moran, The Theory of Storage (Methuen, London, 1959).

    Google Scholar 

  11. R.M. Phatarfod, Application of methods in sequential analysis to dam theory, Ann. Math. Statist. 34 (1963) 1558–1593.

    Google Scholar 

  12. R.M. Phatarfod, A note on the first emptiness problem of a finite dam with poisson type inputs, J. Appl. Probab. 6 (1969) 227–230.

    Article  Google Scholar 

  13. R.M. Phatarfod, On some applications of Wald's identity to dams, Stochastic Process. Appl. 13 (1982) 279–292.

    Article  Google Scholar 

  14. N.U. Prabhu, Time-dependent results in storage theory, J. Appl. Probab. 1 (1964) 1–46.

    Article  Google Scholar 

  15. N.U. Prabhu, Stochastic Storage Processes: Qeues, Insurance Risk, Dams, and Data Communication, 2nd ed. (Springer, New York, 1998).

    Google Scholar 

  16. W.A. Rosenkrantz, Some martingales associated with queueing and storage processes, Zeit. Wahr. 58 (1981) 205–222.

    Article  Google Scholar 

  17. W.A. Rosenkrantz, Calculation of the Laplace transform of the length of the busy period for the M/G/1 queue via martingales, Ann. Probab. 11 (1983) 817–818.

    Google Scholar 

  18. L. Takacs, Combinatorial Methods in the Theory of Stochastic Processes (Wiley, New York, 1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kinateder, K.K., Lee, E.Y. A new approach to the busy period of the M/M/1 queue. Queueing Systems 35, 105–115 (2000). https://doi.org/10.1023/A:1019185826015

Download citation

  • Issue Date:

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

Navigation