Validity of heavy traffic steady-state approximations in generalized Jackson networks

We consider a single class open queueing network, also known as a generalized Jackson network (GJN). A classical result in heavy-traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a reflected Brownian motion (RBM) in the orthant, as the traffic intensity approaches unity. However, barring simple instances, it is still not known whether the stationary distribution of RBM provides a valid approximation for the steady-state of the original network. In this paper we resolve this open problem by proving that the re-scaled stationary distribution of the GJN converges to the stationary distribution of the RBM, thus validating a so-called “interchange-of-limits” for this class of networks. Our method of proof involves a combination of Lyapunov function techniques, strong approximations and tail probability bounds that yield tightness of the sequence of stationary distributions of the GJN.

[1]  John Frank Charles Kingman,et al.  The single server queue in heavy traffic , 1961, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  J. Kingman.  On Queues in Heavy Traffic , 1962 .

[3]  P. Billingsley,et al.  Convergence of Probability Measures , 1970, The Mathematical Gazette.

[4]  J. Harrison.  The heavy traffic approximation for single server queues in series , 1973, Journal of Applied Probability.

[5]  P. Major,et al.  An approximation of partial sums of independent RV's, and the sample DF. II , 1975 .

[6]  J. Harrison,et al.  Reflected Brownian Motion on an Orthant , 1981 .

[7]  Martin I. Reiman,et al.  Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..

[8]  Ruth J. Williams,et al.  Multidimensional Reflected Brownian Motions Having Exponential Stationary Distributions , 1987 .

[9]  Ruth J. Williams,et al.  Brownian Models of Open Queueing Networks with Homogeneous Customer Populations , 1987 .

[10]  Lajos Horváth,et al.  Invariance Principles for Renewal Processes , 1987 .

[11]  K. Sigman.  The stability of open queueing networks , 1990 .

[12]  Wladyslaw Szczotka,et al.  Exponential approximation of waiting time and queue size for queues in heavy traffic , 1990, Advances in Applied Probability.

[13]  Hong Chen,et al.  Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations , 1991, Math. Oper. Res..

[14]  Hong Chen,et al.  Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .

[15]  J. Harrison,et al.  Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State Analysis , 1992 .

[16]  A. Mandelbaum,et al.  Regenerative closed queueing networks , 1992 .

[17]  John N. Tsitsiklis,et al.  Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .

[18]  Lajos Horváth,et al.  Strong Approximations of Open Queueing Networks , 1992, Math. Oper. Res..

[19]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[20]  S. Sushanth Kumar,et al.  Performance bounds for queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[21]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[22]  Ruth J. Williams,et al.  Lyapunov Functions for Semimartingale Reflecting Brownian Motions , 1994 .

[23]  Ruth J. Williams.  Semimartingale reflecting Brownian motions in the orthant , 1995 .

[24]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[25]  Sean P. Meyn,et al.  Stability and convergence of moments for multiclass queueing networks via fluid limit models , 1995, IEEE Trans. Autom. Control..

[26]  P. Kumar,et al.  The throughput of irreducible closed Markovian queueing networks: functional bounds, asymptotic loss, efficiency, and the Harrison-Wein conjectures , 1997 .

[27]  Sean P. Meyn,et al.  Piecewise linear test functions for stability and instability of queueing networks , 1997, Queueing Syst. Theory Appl..

[28]  Kurt Majewski.  Heavy traffic approximations of large deviations of feedforward queueing networks , 1998, Queueing Syst. Theory Appl..

[29]  Ann Appl,et al.  On the Positive Harris Recurrence for Multiclass Queueing Networks: a Uniied Approach via Uid Limit Models , 1999 .

[30]  Dimitris Bertsimas,et al.  Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, the Single-Station Case , 1999 .

[31]  J. Tsitsiklis,et al.  Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions , 2001 .

[32]  Hong Chen,et al.  The Finite Element Method for Computing the Stationary Distribution of an SRBM in a Hypercube with Applications to Finite Buffer Queueing Networks , 2002, Queueing Syst. Theory Appl..

[33]  F. Baccelli,et al.  Moments and tails in monotone-separable stochastic networks , 2004, math/0405281.

[34]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[35]  A. Stolyar.  On the Stability of Multiclass Queueing Networks: A Relaxed SuÆcient Condition via Limiting Fluid Processes , .