Structural properties of proportional fairness: stability and insensitivity

From MaRDI portal
Publication:2456045

DOI10.1214/105051606000000907zbMATH Open1125.60104arXiv0707.4542OpenAlexW2001821940MaRDI QIDQ2456045FDOQ2456045


Authors: Laurent Massoulié Edit this on Wikidata


Publication date: 17 October 2007

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: In this article we provide a novel characterization of the proportionally fair bandwidth allocation of network capacities, in terms of the Fenchel--Legendre transform of the network capacity region. We use this characterization to prove stability (i.e., ergodicity) of network dynamics under proportionally fair sharing, by exhibiting a suitable Lyapunov function. Our stability result extends previously known results to a more general model including Markovian users routing. In particular, it implies that the stability condition previously known under exponential service time distributions remains valid under so-called phase-type service time distributions. We then exhibit a modification of proportional fairness, which coincides with it in some asymptotic sense, is reversible (and thus insensitive), and has explicit stationary distribution. Finally we show that the stationary distributions under modified proportional fairness and balanced fairness, a sharing criterion proposed because of its insensitivity properties, admit the same large deviations characteristics. These results show that proportional fairness is an attractive bandwidth allocation criterion, combining the desirable properties of ease of implementation with performance and insensitivity.


Full work available at URL: https://arxiv.org/abs/0707.4542




Recommendations




Cites Work


Cited In (34)





This page was built for publication: Structural properties of proportional fairness: stability and insensitivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456045)