Qualitative properties of α-fair policies in bandwidth-sharing networks
We consider a flow-level model of a network operating under an α-fair bandwidth sharing policy (with α > 0) proposed by Roberts and Massoulié [Telecomunication Systems 15 (2000) 185–201]. This is a probabilistic model that captures the long-term aspects of bandwidth sharing between users or flows...
Main Authors: | Zhong, Y., Shah, Devavrat, Tsitsiklis, John N |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Mathematical Statistics
2014
|
Online Access: | http://hdl.handle.net/1721.1/85689 https://orcid.org/0000-0003-0737-3259 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
Qualitative properties of α-weighted scheduling policies
by: Shah, Devavrat, et al.
Published: (2011) -
Fair Scheduling in Networks Through Packet Election
by: Jagabathula, Srikanth, et al.
Published: (2012) -
Fair Scheduling in Networks Through Packet Election
by: Jagabathula, Srikanth, et al.
Published: (2020) -
Optimal scaling of average queue sizes in an input-queued switch: an open problem
by: Shah, Devavrat, et al.
Published: (2012) -
Hardness of Low Delay Network Scheduling
by: Shah, Devavrat, et al.
Published: (2012)