Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-10T09:54:46.786Z Has data issue: false hasContentIssue false
  • English
  • Français

The asymptotic variance of departures in critically loaded queues

Part of: Operations research and management science Stochastic processes

Published online by Cambridge University Press:  01 July 2016

A. Al Hanbali ,
M. Mandjes ,
Y. Nazarathy  and
W. Whitt
A. Al Hanbali*
Affiliation:
University of Twente
M. Mandjes*
Affiliation:
University of Amsterdam and CWI
Y. Nazarathy*
Affiliation:
EURANDOM and Eindoven University of Technology
W. Whitt*
Affiliation:
Columbia University
*
∗ Postal address: School of Management and Governance, University of Twente, Enschede, The Netherlands. Email address: a.m.alhanbali@utwente.nl
∗∗ Postal address: Korteweg-de Vries Institute for Mathematics, University of Amsterdam, The Netherlands. Email address: m.r.h.mandjes@uva.nl
∗∗∗ Postal address: Faculty of Engineering and Industrial Sciences, Swinburne University of Technology, John Street, Hawthorn, Victoria, 3122 Australia. Email address: ynazarathy@swin.edu.au
∗∗∗∗ Postal address: Department of Industrial Engineering and Operations Research, Columbia University, S. W. Mudd Building, 500 West 120th Street, New York, NY 10027, USA. Email address: ww2040@columbia.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider the asymptotic variance of the departure counting process D(t) of the GI/G/1 queue; D(t) denotes the number of departures up to time t. We focus on the case where the system load ϱ equals 1, and prove that the asymptotic variance rate satisfies limt→∞varD(t) / t = λ(1–2/π)(ca2 + cs2), where λ is the arrival rate, and ca2 and cs2 are squared coefficients of variation of the interarrival and service times, respectively. As a consequence, the departures variability has a remarkable singularity in the case in which ϱ equals 1, in line with the BRAVO (balancing reduces asymptotic variance of outputs) effect which was previously encountered in finite-capacity birth-death queues. Under certain technical conditions, our result generalizes to multiserver queues, as well as to queues with more general arrival and service patterns. For the M/M/1 queue, we present an explicit expression of the variance of D(t) for any t.

Keywords

GI/G/1 queuecritically loaded systemuniform integrabilitydeparture processrenewal theoryBrownian bridgemultiserver queue

MSC classification

Primary: 90B22: Queues and service
Secondary: 60G55: Point processes
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 43 , Issue 1 , March 2011 , pp. 243 - 263
Copyright
Copyright © Applied Probability Trust 2011 

References

Al Hanbali, A., de Haan, R., Boucherie, R. J. and van Ommeren, J.-K. (2008). A tandem queueing model for delay analysis in disconnected ad hoc networks. In Analytical and Stochastic Modeling Techniques and Applications (Lecture Notes Comput. Sci. 5055), Springer, Berlin, pp. 189–205.Google Scholar
Alsmeyer, G. (1992). On generalized renewal measures and certain first passage times. Ann. Prob. 20, 1229–1247.CrossRefGoogle Scholar
Asmussen, S. (2003). Applied Probability and Queues, 2nd edn. Springer, New York.Google Scholar
Billingsley, P. (1999). Convergence of Probability Measures, 2nd edn. John Wiley, New York.CrossRefGoogle Scholar
Burke, P. J. (1956). The output of a queuing system. Operat. Res. 4, 699–704.Google Scholar
Cohen, J. W. (1982). The Single Server Queue, 2nd edn. North-Holland, Amsterdam.Google Scholar
Daley, D. J. (1975). Further second-order properties of certain single-server queueing systems. Stoch. Process. Appl. 3, 185–191.Google Scholar
Daley, D. J. (1976). Queueing output processes. Adv. Appl. Prob. 8, 395–415.Google Scholar
Disney, R. L. and Kiessler, P. C. (1987). Traffic Processes in Queueing Networks. The Johns Hopkins University Press, Baltimore, MD.Google Scholar
Disney, R. L. and König, D. (1985). Queueing networks: a survey of their random processes. SIAM Rev. 27, 335–403.Google Scholar
Gut, A. (1988). Stopped Random Walks. Springer, New York.Google Scholar
Iglehart, D. L. and Whitt, W. (1970). Multiple channel queues in heavy traffic. I. Adv. Appl. Prob. 2, 150–177.Google Scholar
Iglehart, D. L. and Whitt, W. (1970). Multiple channel queues in heavy traffic. II. Sequences, networks, and batches. Adv. Appl. Prob. 2, 355–369.Google Scholar
Kamae, T., Krengel, U. and O'Brien, G. L. (1977). Stochastic inequalities on partially ordered spaces. Ann. Prob. 5, 899–912.CrossRefGoogle Scholar
Mandjes, M. (2007). Large Deviations for Gaussian Queues. John Wiley, Chichester.Google Scholar
Nazarathy, Y. (2009). The variance of departure processes: puzzling behavior and open problems. Tech. Rep. 2009-045, EURANDOM.Google Scholar
Nazarathy, Y. and Weiss, G. (2008). The asymptotic variance rate of the output process of finite capacity birth–death queues. Queueing Systems 59, 135–156.CrossRefGoogle Scholar
Prabhu, N. U. (1998). Stochastic Storage Processes, 2nd edn. Springer, New York.Google Scholar
Stoyan, D. and Daley, D. J. (1983). Comparison Methods for Queues and Other Stochastic Models. John Wiley, Chichester.Google Scholar
Tan, B. (2000). Asymptotic variance rate of the output in production lines with finite buffers. Ann. Operat. Res. 93, 385–403.CrossRefGoogle Scholar
Wald, A. (1944). On cumulative sums of random variables. Ann. Math. Statist. 15, 283–296.CrossRefGoogle Scholar
Whitt, W. (1972). Complements to heavy traffic limit theorems for the GI/G/1 queue. J. Appl. Prob. 9, 185–191.Google Scholar
Whitt, W. (1981). Comparing counting processes and queues. Adv. Appl. Prob. 13, 207–220.Google Scholar
Whitt, W. (1983). The queueing network analyzer. Bell Systems Tech. J. 62, 2779–2815.Google Scholar
Whitt, W. (2002). Stochastic-Process Limits. Springer, New York.CrossRefGoogle Scholar
Wolff, R. W. (1977). An upper bound for multi-channel queues. J. Appl. Prob. 14, 884–888.Google Scholar
Zwart, A. P. (2001). Tail asymptotics for the busy period in the GI/G/1 queue. Math. Operat. Res. 26, 485–493.CrossRefGoogle Scholar