Abstract
We consider an open queueing network consisting of an arbitrary number of queues in series. We assume that the arrival process into the first queue and the service processes at the individual queues are jointly stationary and ergodic, and that the mean inter-arrival time exceeds the mean service time at each of the queues. Starting from Lindley's recursion for the waiting time, we obtain a simple expression for the total delay (sojourn time) in the system. Under some mild additional assumptions, which are satisfied by many commonly used models, we show that the delay distribution has an exponentially decaying tail and compute the exact decay rate. We also find the most likely path leading to the build-up of large delays. Such a result is of relevance to communication networks, where it is often necessary to guarantee bounds on the probability of large delays. Such bounds are part of the specification of the quality of service desired by the network user.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. Anantharam, How large delays build up in a GI/G/1 queue, Queueing Systems 5(1989)345-367.
D. Bertsimas, I. Paschalidis and J. Tsitsiklis, On the large deviations behaviour of acyclic networks of G/G/1 queues, to appear in Annals of Applied Probability.
C.S. Chang, Sample path large deviations and intree networks, Queueing Systems 20(1995)7 - 36.
G. de Veciana and J. Walrand, Effective bandwidths: Call admission, traffic policing and filtering for ATM networks, Queueing Systems 20(1995)37 - 59.
A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications, Jones and Bartlett, 1993.
A. Ganesh and V. Anantharam, Stationary tail probabilities in exponential server tandems with renewal arrivals, Queueing Systems 22(1996)203 - 247.
F.P. Kelly, Reversibility and Stochastic Networks, Wiley, 1979.
G. Kesidis, J. Walrand and C.S. Chang, Effective bandwidths for multiclass Markov fluids and other ATM sources, IEEE/ACM Trans. on Networking 1(1993)424 - 428.
R.M. Loynes, The stability of queues with non-independent inter-arrival and service times, Proceedings of the Cambridge Philosophical Society 58(1962)497 - 520.
M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models, Johns Hopkins, 1981.
R.T. Rockafellar, Conjugate Duality and Optimization, Society of Industrial and Applied Mathematics, 1974.
J. Walrand, An Introduction to Queueing Networks, Prentice-Hall, 1988.
Rights and permissions
About this article
Cite this article
Ganesh, A. Large deviations of the sojourn time for queues in series. Annals of Operations Research 79, 3–26 (1998). https://doi.org/10.1023/A:1018930907280
Issue Date:
DOI: https://doi.org/10.1023/A:1018930907280