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

preprint2012arXivOpen access

Abstract

We consider a connection-level model of Internet congestion control, introduced by Massoulié 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 αα-fair bandwidth sharing policy introduced by Mo and Walrand [IEEE/ACM Transactions on Networking 8 (2000) 556--567] [α∈(0,∞)α\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.