Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s11134-006-7587-7 | Queueing Syst. |
Keywords | Field | DocType |
Resource allocation,Flow-level modeling,Stability,Insensitivity | Wireless network,Max-min fairness,Mathematical optimization,Computer science,Queue,Computer network,Real-time computing,Queueing theory,Resource allocation,Maximum throughput scheduling,Fairness measure,Fair queuing | Journal |
Volume | Issue | ISSN |
53 | 1-2 | 0257-0130 |
Citations | PageRank | References |
110 | 4.75 | 30 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Bonald | 1 | 714 | 65.56 |
| Laurent Massoulié | 2 | 3512 | 244.42 |
| A. Proutiére | 3 | 673 | 51.18 |
| Jorma T. Virtamo | 4 | 261 | 23.64 |