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.
Type de document :
Article dans une revue
Queueing Systems, Springer Verlag, 2006, 〈10.1007/s11134-006-7587-7〉
Liste complète des métadonnées

Littérature citée [42 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01244245
Contributeur : Thomas Bonald <>
Soumis le : mardi 15 décembre 2015 - 15:21:17
Dernière modification le : samedi 16 janvier 2016 - 01:04:05
Document(s) archivé(s) le : samedi 29 avril 2017 - 15:11:31

Fichier

questa06.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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〉

Partager

Métriques

Consultations de
la notice

194

Téléchargements du document

214