Abstract
Recently, several methods have been proposed to approximate performance measures of queueing systems based on their light traffic derivatives, e.g., the MacLaurin expansion, the Padé approximation, and interpolation with heavy traffic limits. The key condition required in all these approximations is that the performance measures be analytic when the arrival rates equal to zero. In this paper, we study theGI/G/1 queue. We show that if the c.d.f. of the interarrival time can be expressed as a MacLaurin series over [0, ∞), then the mean steady-state system time of a job is indeed analytic when the arrival rate to the queue equals to zero. This condition is satisfied by phase-type distributions but not c.d.f.'s without support [0, ∞), such as uniform and shifted exponential distributions. In fact, we show through two examples that the analyticity does not hold for most commonly used distribution functions which do not satisfy this condition.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen, Light traffic equivalence in single server queues, to appear in Ann. Appl. Prob.
V. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic (Academic Press, New York, 1965).
D.Y. Burman and D.R. Smith, A light-traffic theorem for multi-server queues, Math. Oper. Res. 8 (1983) 15–25.
D.Y. Burman and D.R. Smith, An asymptotic analysis of a queueing systems with Markov-modulated arrivals, Oper. Res. 34 (1986) 105–119.
D.J. Daley and T. Rolski, Light traffic approximation in queues, Math. Oper. Res. 16 (1991) 57–71.
W. Fendick and W. Whitt, Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue, Proc. IEEE 77 (1989) 171–194.
W.B. Gong and J.Q. Hu, The MacLaurin series for the GI/G/1 queue, J. Appl. Prob. 29 (1992) 176–184.
W.B. Gong, S. Nananukul and A. Yan, Padé approximation for stochastic discrete event systems, to appear in IEEE Trans. Autom. Control.
J.Q. Hu, The departure process of the GI/G/1 queue, to appear in Oper. Res.
L.V. Kantorovich and V.I. Krylov,Approximate Methods of Higher Analysis, translat. by C.D. Benster (Wiley, New York, 1964).
M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models (The Johns Hopkins University Press, Baltimore and London).
M. Reiman and B. Simon, An interpolation approximation for queueing systems with Poisson input, Oper. Res. 37 (1988) 454–469.
M. Reiman and B. Simon, Open queueing systems in light traffic, Math. Oper. Res. 14 (1989) 26–59.
K. Siegman, Light traffic for workload in queues, Queueing Systems 11 (1992) 429–442.
L. Takacs,Introduction to the Theory of Queues (Oxford University Press, New York, 1962).
H. Thorisson, The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergence, Stoch. Processes and Their Appl. 19 (1985) 85–99.
R.R. Weber, A note on waiting times in single server queues, Oper. Res. 31 (1983) 950–951.
R.W. Wolff, Conditions for finite ladder height and delay moments, Oper. Res. 32 (1984) 909–916.
M. Zazanis, Analyticity of Poisson driven stochastic systems. Adv. Appl. Prob. 24 (1992) 532–541.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hu, JQ. Analyticity of single-server queues in light traffic. Queueing Syst 19, 63–80 (1995). https://doi.org/10.1007/BF01148940
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01148940