Settling time bounds forM/G /1 queues Authors Arif Merchant Department of Computer Science Stanford University Short Communication
Received: 30 October 1989 Revised: 03 August 1990 DOI :
10.1007/BF02412244
Cite this article as: Merchant, A. Queueing Syst (1991) 8: 105. doi:10.1007/BF02412244
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 .
Keywords Settling times M/G /1 queuescoupling relaxation times This research was supported in part by a grant from the AT&T Foundation and NSF grant DCR-8351757.
References [1]
H. Chernoff, A measure of asymptotic efficiency for tests based on the sum of observations, Ann. Math. Stat. 23 (1952) 493–509.
[2]
J.W. Cohen,The Single Server Queue , 2nd ed. (North-Holland, 1982).
[3]
S. Karlin and H.M. Taylor,A First Course in Stochastic Processes (Academic Press, 1975).
[4]
A.Y. Khinchin, Mathematical theory of stationary queues, Mat. Sbornik 39 (4) (1932) 73–84.
[5]
J.F.C. Kingman, On queues in which customers are served in random order, Proc. Cambridge Phil. Soc. 58 (1962) 79–91.
CrossRef [6]
L. Kleinrock,Queueing Systems , vol. 1 (Wiley, 1975).
[7]
L. Takács,Introduction to the Theory of Queues (Oxford University Press, 1962).
[8]
H. Thorisson, On maximal and distributional coupling, Ann. Prob. 14 (1986) 873–876.
© J.C. Baltzer A.G. Scientific Publishing Company 1991