Skip to main content

A semi-Markov queue with exponential service times

  • Chapter
Semi-Markov Models

Abstract

In de Smit (1985) a general model for the single server semi-Markov queue was studied. Its solution was reduced to the Wiener-Hopf factorization of a matrix function. For the general case a formal factorization can be given in which the factors have probabilistic interpretations but cannot be calculated explicitly (see Arjas (1972)). Explicit factorizations can only be given in special cases. The present paper deals with the case in which customers arrive according to a Markov renewal process, while an arriving customer requires an exponential service time whose mean depends on the state of the Markov renewal process at his arrival. For this special case we shall obtain an explicit factorization. The model is formally described as follows.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Arjas, E. (1972). On the use of a fundamental identity in the theory of semi-Markov queues. Adv.Appl.Prob. 4, 271–284.

    Article  MathSciNet  MATH  Google Scholar 

  • Çinlar, E. (1967). Queues with semi-Markov arrivals. J.Appl.Prob. 4, 365–379.

    Article  MATH  Google Scholar 

  • de Smit, J.H.A. (1983). The queue GI |M|s with customers of different types or the queue GI|Hm|s. Adv.Appl.Prob. 15, 392–419.

    Article  MATH  Google Scholar 

  • de Smit, J.H.A. (1985). The single server semi-Markov queue. To appear in Stochastic Process.Appl.

    Google Scholar 

  • Latouche, G. (1983). An exponential semi-Markov process with applications to queueing theory. Report Laboratoire d’Informatique Théorique, Université Libre de Bruxelles.

    Google Scholar 

  • Regterschot, G.J.K. and J.H.A. de Smit (1985). The queue M|G|1 with Markov modulated arrivals and services. To appear in Math.Oper.Res.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer Science+Business Media New York

About this chapter

Cite this chapter

de Smit, J.H.A., Regterschot, G.J.K. (1986). A semi-Markov queue with exponential service times. In: Janssen, J. (eds) Semi-Markov Models. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0574-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-0574-1_20

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4899-0576-5

  • Online ISBN: 978-1-4899-0574-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics