English

State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy

Probability 2012-02-27 v2

Abstract

We consider a connection-level model of Internet congestion control, introduced by Massouli\'{e} and Roberts [Telecommunication Systems 15 (2000) 185--201], that represents the randomly varying number of flows present in a network. Here, bandwidth is shared fairly among elastic document transfers according to a weighted α\alpha-fair bandwidth sharing policy introduced by Mo and Walrand [IEEE/ACM Transactions on Networking 8 (2000) 556--567] [α(0,)\alpha\in (0,\infty)]. Assuming Poisson arrivals and exponentially distributed document sizes, we focus on the heavy traffic regime in which the average load placed on each resource is approximately equal to its capacity. A fluid model (or functional law of large numbers approximation) for this stochastic model was derived and analyzed in a prior work [Ann. Appl. Probab. 14 (2004) 1055--1083] by two of the authors. Here, we use the long-time behavior of the solutions of the fluid model established in that paper to derive a property called multiplicative state space collapse, which, loosely speaking, shows that in diffusion scale, the flow count process for the stochastic model can be approximately recovered as a continuous lifting of the workload process.

Keywords

Cite

@article{arxiv.0910.3821,
  title  = {State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy},
  author = {W. N. Kang and F. P. Kelly and N. H. Lee and R. J. Williams},
  journal= {arXiv preprint arXiv:0910.3821},
  year   = {2012}
}

Comments

Published in at http://dx.doi.org/10.1214/08-AAP591 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

R2 v1 2026-06-21T14:00:48.761Z