Skip to main content
SpringerLink
Log in

The G/M/1 queue revisited

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

The G/M/1 queue is one of the classical models of queueing theory. The goal of this paper is two-fold: (a) To introduce new derivations of some well-known results, and (b) to present some new results for the G/M/1 queue and its variants. In particular, we pay attention to the G/M/1 queue with a set-up time at the start of each busy period, and the G/M/1 queue with exceptional first service.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Asmussen S (2003) Applied probability and queues. 2nd edn. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  • Cohen JW (1982) The single server queue. North-Holland, Amsterdam

    MATH  Google Scholar 

  • Doshi BT (1985) A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times. J Appl Probab 22:419–428

    Article  MATH  MathSciNet  Google Scholar 

  • Kella O, Whitt W (1992) Useful martingales for stochastic storage processes with Lévy input. J Appl Probab 29:396–403

    Article  MATH  MathSciNet  Google Scholar 

  • Núñez Queija R (2001) Note on the GI/GI/1 queue with LCFS-PR observed at arbitrary times. Prob Eng Inf Sci 15:179–187

    Article  MATH  Google Scholar 

  • Perry D, Stadje W, Zacks S (1999) Contributions to the theory of first-exit times of some compound processes in queueing theory. Queueing Syst 33:369–379

    Article  MATH  MathSciNet  Google Scholar 

  • Perry D, Stadje W (2003) Duality of dams via mountain processes. Oper Res Lett 31:451–458

    Article  MATH  MathSciNet  Google Scholar 

  • Perry D, Stadje W, Zacks S (2000) Busy period analysis for M/G/1 and G/M/1-type queues with restricted accessibility. Oper Res Lett 27:163–174

    Article  MATH  MathSciNet  Google Scholar 

  • Prabhu NU (1965) Queues and inventories. Wiley, New York

    MATH  Google Scholar 

  • Prabhu NU (1988) Stochastic storage processes. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Takács L (1962) Introduction to the theory of queues. Oxford University Press, New York

    Google Scholar 

  • Titchmarsh EC (1968) The theory of functions. 2nd edn. Oxford University Press, London

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EURANDOM and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600, MB, Eindhoven, The Netherlands

    Ivo Adan & Onno Boxma

  2. Department of Statistics, University of Haifa, Haifa, 31905, Israel

    David Perry

Authors
  1. Ivo Adan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Onno Boxma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Perry
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Onno Boxma.

Additional information

Dedicated to Arie Hordijk on his 65th birthday, in friendship and admiration.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adan, I., Boxma, O. & Perry, D. The G/M/1 queue revisited. Math Meth Oper Res 62, 437–452 (2005). https://doi.org/10.1007/s00186-005-0032-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-005-0032-6

Keywords

Search

Navigation