Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T07:54:03.853Z Has data issue: false hasContentIssue false

The asymptotic variance of departures in critically loaded queues

Published online by Cambridge University Press:  01 July 2016

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/π)(c a 2 + c s 2), where λ is the arrival rate, and c a 2 and c s 2 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.

MSC classification

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2011