dc.contributor.author | Zhong, Y. | |
dc.contributor.author | Shah, Devavrat | |
dc.contributor.author | Tsitsiklis, John N | |
dc.date.accessioned | 2014-03-17T20:16:04Z | |
dc.date.available | 2014-03-17T20:16:04Z | |
dc.date.issued | 2014-02 | |
dc.date.submitted | 2012-10 | |
dc.identifier.issn | 1050-5164 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/85689 | |
dc.description.abstract | 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 in a communication network.
We study the transient properties as well as the steady-state distribution of the model. In particular, for α ≥ 1, we obtain bounds on the maximum number of flows in the network over a given time horizon, by means of a maximal inequality derived from the standard Lyapunov drift condition. As a corollary, we establish the full state space collapse property for all α ≥ 1.
For the steady-state distribution, we obtain explicit exponential tail bounds on the number of flows, for any α > 0, by relying on a norm-like Lyapunov function. As a corollary, we establish the validity of the diffusion approximation developed by Kang et al. [Ann. Appl. Probab. 19 (2009) 1719–1780], in steady state, for the case where α = 1 and under a local traffic condition. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Project CCF-0728554) | en_US |
dc.language.iso | en_US | |
dc.publisher | Institute of Mathematical Statistics | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1214/12-AAP915 | en_US |
dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
dc.source | Institute of Mathematical Statistics | en_US |
dc.title | Qualitative properties of α-fair policies in bandwidth-sharing networks | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Shah, D., J. N. Tsitsiklis, and Y. Zhong. “Qualitative Properties of α-Fair Policies in Bandwidth-Sharing Networks.” The Annals of Applied Probability 24, no. 1 (February 2014): 76–113. © Institute of Mathematical Statistics, 2014 | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | en_US |
dc.contributor.mitauthor | Shah, Devavrat | en_US |
dc.contributor.mitauthor | Tsitsiklis, John N. | en_US |
dc.relation.journal | The Annals of Applied Probability | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Shah, D.; Tsitsiklis, J. N.; Zhong, Y. | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-0737-3259 | |
dc.identifier.orcid | https://orcid.org/0000-0003-2658-8239 | |
mit.license | PUBLISHER_POLICY | en_US |
mit.metadata.status | Complete | |