A Queueing Analysis of Max-Min Fairness, Proportional Fairness and Balanced Fairness - Archive ouverte HAL Access content directly
Journal Articles Queueing Systems Year : 2006

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

(1) , (2) , (1) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
questa06.pdf (264.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01244245 , version 1 (15-12-2015)

Identifiers

Cite

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

Collections

INRIA
157 View
829 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More