Structural properties of proportional fairness: stability and insensitivity
Laurent Massouli\'e

TL;DR
This paper characterizes proportional fairness in network bandwidth allocation, proves its stability under general conditions, introduces a reversible variant with explicit stationary distribution, and compares its insensitivity properties to balanced fairness.
Contribution
It provides a novel Fenchel--Legendre transform characterization of proportional fairness, extends stability results to more general models, and introduces a reversible, insensitive modification.
Findings
Proportional fairness is stable under Markovian routing.
A reversible, insensitive variant of proportional fairness is proposed.
Stationary distributions of the modified and balanced fairness share large deviations properties.
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…
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.
