Fluid model for a network operating under a fair bandwidth-sharing policy
Open Access
- 1 August 2004
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 14 (3) , 1055-1083
- https://doi.org/10.1214/105051604000000224
Abstract
We consider a model of Internet congestion control that represents the randomly varying number of flows present in a network where bandwidth is shared fairly between document transfers. We study critical fluid models obtained as formal limits under law of large numbers scalings when the average load on at least one resource is equal to its capacity. We establish convergence to equilibria for fluid models and identify the invariant manifold. The form of the invariant manifold gives insight into the phenomenon of entrainment whereby congestion at some resources may prevent other resources from working at their full capacity.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- A broader view of Brownian networksThe Annals of Applied Probability, 2003
- Heavy Traffic Limits for Some Queueing NetworksThe Annals of Applied Probability, 2001
- Fair end-to-end window-based congestion controlIEEE/ACM Transactions on Networking, 2000
- An approach to service level agreements for IP networks with differentiated servicesPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2000
- Modeling TCP Reno performance: a simple model and its empirical validationIEEE/ACM Transactions on Networking, 2000
- Brownian models of open processing networks: canonical representation of workloadThe Annals of Applied Probability, 2000
- Promoting the use of end-to-end congestion control in the InternetIEEE/ACM Transactions on Networking, 1999
- The macroscopic behavior of the TCP congestion avoidance algorithmACM SIGCOMM Computer Communication Review, 1997
- Convergence to equilibria for fluid models of FIFO queueing networksQueueing Systems, 1996
- Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networksQueueing Systems, 1996