Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
References
H. Chernoff, A measure of asymptotic efficiency for tests based on the sum of observations, Ann. Math. Stat. 23 (1952) 493–509.
J.W. Cohen,The Single Server Queue, 2nd ed. (North-Holland, 1982).
S. Karlin and H.M. Taylor,A First Course in Stochastic Processes (Academic Press, 1975).
A.Y. Khinchin, Mathematical theory of stationary queues, Mat. Sbornik 39 (4) (1932) 73–84.
J.F.C. Kingman, On queues in which customers are served in random order, Proc. Cambridge Phil. Soc. 58 (1962) 79–91.
L. Kleinrock,Queueing Systems, vol. 1 (Wiley, 1975).
L. Takács,Introduction to the Theory of Queues (Oxford University Press, 1962).
H. Thorisson, On maximal and distributional coupling, Ann. Prob. 14 (1986) 873–876.
Author information
Authors and Affiliations
Additional information
This research was supported in part by a grant from the AT&T Foundation and NSF grant DCR-8351757.
Rights and permissions
About this article
Cite this article
Merchant, A. Settling time bounds forM/G/1 queues. Queueing Syst 8, 105–110 (1991). https://doi.org/10.1007/BF02412244
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02412244