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

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/105051605000000638 in the Annals of Applied Probability (http://www.imstat.org/aap/) by

Scientific paper

10.1214/105051605000000638

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Validity of heavy traffic steady-state approximations in generalized Jackson Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Validity of heavy traffic steady-state approximations in generalized Jackson Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Validity of heavy traffic steady-state approximations in generalized Jackson Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-103100

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.