Skip to main content
Article thumbnail
Location of Repository

A queueing analysis of max-min fairness, proportional fairness and balanced fairness

By T. Bonald, L. Massoulié, A. Proutière and J. Virtamo

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 processorsharing 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

Topics: Resource allocation, flow-level modeling, stability, insensitivity
Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.5707
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.di.ens.fr/~baccelli... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.