Queueing Systems

, Volume 8, Issue 1, pp 105–110 | Cite as

Settling time bounds forM/G/1 queues

  • Arif Merchant
Short Communication


This paper addresses the question of how long it takes for anM/G/1 queue, starting empty, to approach steady state. A coupling technique is used to derive bounds on the variation distance between the distribution of number in the system at timet and its stationary distribution. The bounds are valid for allt.


Settling times M/G/1 queues coupling relaxation times 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H. Chernoff, A measure of asymptotic efficiency for tests based on the sum of observations, Ann. Math. Stat. 23 (1952) 493–509.Google Scholar
  2. [2]
    J.W. Cohen,The Single Server Queue, 2nd ed. (North-Holland, 1982).Google Scholar
  3. [3]
    S. Karlin and H.M. Taylor,A First Course in Stochastic Processes (Academic Press, 1975).Google Scholar
  4. [4]
    A.Y. Khinchin, Mathematical theory of stationary queues, Mat. Sbornik 39 (4) (1932) 73–84.Google Scholar
  5. [5]
    J.F.C. Kingman, On queues in which customers are served in random order, Proc. Cambridge Phil. Soc. 58 (1962) 79–91.CrossRefGoogle Scholar
  6. [6]
    L. Kleinrock,Queueing Systems, vol. 1 (Wiley, 1975).Google Scholar
  7. [7]
    L. Takács,Introduction to the Theory of Queues (Oxford University Press, 1962).Google Scholar
  8. [8]
    H. Thorisson, On maximal and distributional coupling, Ann. Prob. 14 (1986) 873–876.Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1991

Authors and Affiliations

  • Arif Merchant
    • 1
  1. 1.Department of Computer ScienceStanford UniversityStanfordUSA

Personalised recommendations