Abstract
We consider a multi-class feedforward queueing network with first come first serve queueing discipline and deterministic services and routing. The large deviation asymptotics of tail probabilities of the distribution of the workload vector can be characterized by convex path space minimization problems with non-linear constraints. So far there exists no numerical algorithm which could solve such minimization problems in a general way. When the queueing network is heavily loaded it can be approximated by a reflected Brownian motion. The large deviation asymptotics of tail probabilities of the distribution of this heavy traffic limit can again be characterized by convex path space minimization problems with non-linear constraints. However, due to their less complicated structure there exist algorithms to solve such minimization problems. In this paper we show that, as the network tends to a heavy traffic limit, the solution of the large deviation minimization problems of the network approaches the solution of the corresponding minimization problems of a reflected Brownian motion. Stated otherwise, we show that large deviation and heavy traffic asymptotics can be interchanged. We prove this result in the case when the network is initially empty. Without proof we state the corresponding result in the stationary case. We present an illuminating example with two queues.
Similar content being viewed by others
References
D. Bertsimas, I.Ch. Paschalidis and J.N. Tsitsiklis, On the large deviations behaviour of acyclic networks of G/G/1 queues, Technical Report LIDS-P-2278, Massachusetts Institute of Technology (December 1994).
P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1968).
C.-S. Chang, Sample path large deviations and intree networks, Queueing Systems 20 (1995) 7-36.
A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications (Jones and Bartlett, London, 1993).
N.G. Duffield and N. O'Connell, Large deviations and overflow probabilities for the general single-server queue, with applications, Technical Report DIAS-APG-93-30, Dublin Institute for Advanced Studies (July 1994).
P. Dupuis and H. Ishii, On Lipschitz continuity of the solution mapping to the Skorokhod problem, with applications, Stochastics and Stochastic Reports 35 (1991) 31-62.
P.W. Glynn and W. Whitt, Logarithmic asymptotics of steady-state tail probabilities in a single-server queue, J. Appl. Probab. 31A (1994) 131-156.
J.M. Harrison, The diffusion approximation for tandem queues in heavy traffic, Adv. in Appl. Probab. 10 (1978) 886-905.
J.M. Harrison and V. Nguyen, Brownian models of multiclass queueing networks: Current status and open problems, Queueing Systems 13 (1993) 5-40.
K. Majewski, Large deviations of feedforward queueing networks, Ph.D. thesis, Ludwig-Maximilians-Universität München (May 1996).
K. Majewski, Large deviations of stationary reflected Brownian motions, in: Stochastic Networks: Theory and Applications, eds. F.P. Kelly, S. Zachary and I. Ziedins, Royal Statistical Society Lecture Note Series (Oxford Science Publications, 1996) pp. 105-118.
K. Majewski, Solving variational problems associated with large deviations of reflected Brownian motions, Working Paper (October 1996).
N. O'Connell, Large deviations in queueing networks, Technical Report DIAS-APG-9413, Dublin Institute for Advanced Studies (April 1995).
W.P. Peterson, A heavy traffic limit theorem for networks of queues with multiple customer types, Math. Oper. Res. 16(1) (1991) 90-118.
D. Pollard, Convergence of Stochastic Processes (Springer, New York, 1984).
K. Ramanan and P. Dupuis, Large deviation properties of data streams that share a buffer, Technical Report LCDS #95-8, Lefschetz Center for Dynamical Systems and Center for Control Sciences, Division of Applied Mathematics, Brown University, Providence, RI (August 1995).
R.J. Williams, Semimartingale reflecting Brownian motions in the orthant, in: Stochastic Networks, eds. F.P. Kelly and R.J. Williams (Springer, Berlin, 1995) pp. 125-137.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Majewski, K. Heavy traffic approximations of large deviations of feedforward queueing networks. Queueing Systems 28, 125–155 (1998). https://doi.org/10.1023/A:1019147006084
Issue Date:
DOI: https://doi.org/10.1023/A:1019147006084