Open Access
February 2006 Validity of heavy traffic steady-state approximations in generalized Jackson networks
David Gamarnik, Assaf Zeevi
Ann. Appl. Probab. 16(1): 56-90 (February 2006). DOI: 10.1214/105051605000000638

Abstract

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.

Citation

Download Citation

David Gamarnik. Assaf Zeevi. "Validity of heavy traffic steady-state approximations in generalized Jackson networks." Ann. Appl. Probab. 16 (1) 56 - 90, February 2006. https://doi.org/10.1214/105051605000000638

Information

Published: February 2006
First available in Project Euclid: 6 March 2006

zbMATH: 1094.60052
MathSciNet: MR2209336
Digital Object Identifier: 10.1214/105051605000000638

Subjects:
Primary: 60J25 , 60J65 , 60K25

Keywords: diffusion approximations , Lyapunov functions , Markov processes , reflected Brownian motion , stationary distribution , weak convergence

Rights: Copyright © 2006 Institute of Mathematical Statistics

Vol.16 • No. 1 • February 2006
Back to Top