A Queueing Analysis of Max-Min Fairness, Proportional Fairness and Balanced Fairness

Abstract : We compare the performance of three usual allocations, namely max-min fairness, proportional fairness and balanced fairness, in a communication network whose resources are shared by a random number of data flows. The model consists of a network of processor-sharing queues. The vector of service rates, which is constrained by some compact, convex capacity set representing the network resources, is a function of the number of customers in each queue. This function determines the way network resources are allocated. We show that this model is representative of a rich class of wired and wireless networks. We give in this general framework the stability condition of max-min fairness, proportional fairness and balanced fairness and compare their performance on a number of toy networks.
Complete list of metadatas

Cited literature [42 references]  Display  Hide  Download

https://hal.inria.fr/hal-01244245
Contributor : Thomas Bonald <>
Submitted on : Tuesday, December 15, 2015 - 3:21:17 PM
Last modification on : Saturday, January 16, 2016 - 1:04:05 AM
Long-term archiving on : Saturday, April 29, 2017 - 3:11:31 PM

File

questa06.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Thomas Bonald, Laurent Massoulié, Alexandre Proutière, Jorma Virtamo. A Queueing Analysis of Max-Min Fairness, Proportional Fairness and Balanced Fairness. Queueing Systems, Springer Verlag, 2006, ⟨10.1007/s11134-006-7587-7⟩. ⟨hal-01244245⟩

Share

Metrics

Record views

302

Files downloads

526