Skip to main content
Log in

Markov-modulated queueing systems

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Markov-modulated queueing systems are those in which the primary arrival and service mechanisms are influenced by changes of phase in a secondary Markov process. This influence may be external or internal, and may represent factors such as changes in environment or service interruptions. An important example of such a model arises in packet switching, where the calls generating packets are identified as customers being served at an infinite server system. In this paper we first survey a number of different models for Markov-modulated queueing systems. We then analyze a model in which the workload process and the secondary process together constitute a Markov compound Poisson process. We derive the properties of the waiting time, idle time and busy period, using techniques based on infinitesimal generators. This model was first investigated by G.J.K. Regterschot and J.H.A. de Smit using Wiener-Hopf techniques, their primary interest being the queue-length and waiting time.

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. D.Y. Burman and D.R. Smith, Asymptotic analysis of a queueing model with bursty traffic, The Bell Syst. Tech. J. 62 (1983) 1433–1453.

    Google Scholar 

  2. D.Y. Burman and D.R. Smith, An asymptotic analysis of a queueing system with Markov-modulated arrivals, Opns. Res. 34 (1986) 105–119.

    Google Scholar 

  3. M. Eisen and M. Tainiter, Stochastic variations in queueing processes, Opns. Res. 11 (1963) 922–927.

    Google Scholar 

  4. E. Hille and R.S. Phillips,Functional Analysis and Semigroups Amer. Math. Soc. Coll. Publ. 31 (American Mathematical Society, Providence, 1957).

    Google Scholar 

  5. C. Knessl, B.J. Matkowsky, Z. Schuss and C. Tier, A Markov-modulated M/G/1 queue I: Stationary distribution, Queueing Systems Theory Appl. 1 (1987) 355–374.

    Google Scholar 

  6. I.L. Mitrani and B. Avi-Itzhak, A many-server queue with service interruptions, Opns. Res. 16 (1968) 628–638.

    Google Scholar 

  7. M.F. Neuts, A queue subject to extraneous phase changes, Adv. Appl. Prob. 3 (1971) 78–119.

    Google Scholar 

  8. N.U. Prabhu,Stochastic Storage Processes (Springer-Verlag, New York, 1980).

    Google Scholar 

  9. N.U. Prabhu, Theory of semiregenerative phenomena, J. Appl. Prob. 25A (1988) 257–274.

    Google Scholar 

  10. P. Purdue, The M/M/1 queue in a Markovian environment, Opns. Res. 22 (1974) 562–569.

    Google Scholar 

  11. V. Ramaswami, The N/G/1 queue and its detailed analysis, Adv. Appl. Prob. 12 (1980) 222–261.

    Google Scholar 

  12. G.J.K. Regterschot and J.H.A. de Smit; The queue M/G/1 with Markov-modulated arrivals and service, Math. Opns. Res. 11 (1986) 465–483.

    Google Scholar 

  13. H. White and L.S. Christie, Queueing with preemptive priorities or with breakdowns, Opns. Res. 6 (1958) 79–95.

    Google Scholar 

  14. U. Yechiali, A queueing-type birth-and-death process defined on a continuous time Markov chain, Opns. Res. 21 (1973) 604–609.

    Google Scholar 

  15. U. Yechiali and P. Naor, Queueing problems with heterogeneous arrivals and service, Opns. Res. 19 (1971) 722–734.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prabhu, N.U., Zhu, Y. Markov-modulated queueing systems. Queueing Syst 5, 215–245 (1989). https://doi.org/10.1007/BF01149193

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation