Fluid limits for networks with bandwidth sharing and general document size distributions
H. Christian Gromoll, Ruth J. Williams

TL;DR
This paper develops a fluid model for Internet congestion control that accommodates general document sizes and bandwidth sharing policies, extending previous models with exponential assumptions.
Contribution
It introduces a measure-valued fluid model for networks with general document sizes and broad bandwidth sharing policies, including weighted alpha-fair policies.
Findings
Proves tightness of rescaled measure-valued processes.
Shows convergence to fluid model solutions under mild conditions.
Characterizes invariant states for weighted alpha-fair policies.
Abstract
We consider a stochastic 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 in a network where bandwidth is shared among document transfers. In contrast to an earlier work by Kelly and Williams [Ann. Appl. Probab. 14 (2004) 1055--1083], the present paper allows interarrival times and document sizes to be generally distributed, rather than exponentially distributed. Furthermore, we allow a fairly general class of bandwidth sharing policies that includes the weighted -fair policies of Mo and Walrand [IEEE/ACM Transactions on Networking 8 (2000) 556--567], as well as certain other utility based scheduling policies. To describe the evolution of the system, measure valued processes are used to keep track of the residual document sizes of all flows through…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Traffic and Congestion Control · Peer-to-Peer Network Technologies · Advanced Wireless Network Optimization
