Skip to main content
SpringerLink
Log in

The age of the arrival process in the G/M/1 and M/G/1 queues

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

Abstract

This paper shows that in the G/M/1 queueing model, conditioning on a busy server, the age of the inter-arrival time and the number of customers in the queue are independent. The same is the case when the age is replaced by the residual inter-arrival time or by its total value. Explicit expressions for the conditional density functions, as well as some stochastic orders, in all three cases are given. Moreover, we show that this independence property, which we prove by elementary arguments, also leads to an alternative proof for the fact that given a busy server, the number of customers in the queue follows a geometric distribution. We conclude with a derivation for the Laplace Stieltjes Transform (LST) of the age of the inter-arrival time in the M/G/1 queue.

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

  • Adan I, Haviv M (2009) Conditional ages and residual service times in the M/G/1 queue. Stoch Models 25: 110–128

    Article  MATH  MathSciNet  Google Scholar 

  • Adan I, Boxma O, Perry D (2005) The G/M/1 queue revisited. Math Methods Oper Res 62: 437–452

    Article  MATH  MathSciNet  Google Scholar 

  • Altman E, Jimenez T, Nunez-Queija R, Yechiali U (2004) Optimal routing among ·/M/1 queues with partial information. Stoch Models 20: 149–172

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  • Fakinos D (1990) Equilibrium queue size distributions for semi-reversible queues. Stoch Processes Appl 36: 331–337

    Article  MATH  MathSciNet  Google Scholar 

  • Haviv M, van der Heyden L (1984) Perturbation bounds for the stationary probabilities of a finite Markov chain. Adv Appl Probab 16: 804–818

    Article  MATH  Google Scholar 

  • Haviv M, van Houtum G-J (1998) The critical offered load in variants of the symmetric shortest and longest queue systems. Stoch Models 14: 1179–1195

    Article  MATH  Google Scholar 

  • Haviv M, Zlotnikov R (2009) Computational schemes for two exponential servers where the first has a finite buffer. Working paper. Currently available at http://pluto.huji.ac.il/~haviv/rita9.pdf

  • Kerner Y (2008) On the joint distribution of queue length and residual service time in the M n /G/1 queue. Stoch Models 24: 364–375

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, The Hebrew University of Jerusalem, 91905, Jerusalem, Israel

    Moshe Haviv

  2. Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer Sheva, Israel

    Yoav Kerner

Authors
  1. Moshe Haviv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoav Kerner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yoav Kerner.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haviv, M., Kerner, Y. The age of the arrival process in the G/M/1 and M/G/1 queues. Math Meth Oper Res 73, 139–152 (2011). https://doi.org/10.1007/s00186-010-0337-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-010-0337-y

Keywords

Search

Navigation