Insensitive, maximum stable allocations converge to proportional fairness
| Authors |
|
|---|---|
| Publication date | 2011 |
| Journal | Queueing Systems |
| Volume | Issue number | 68 | 1 |
| Pages (from-to) | 51-60 |
| Organisations |
|
| Abstract |
We describe a queuing model where service is allocated as a function of queue sizes. We consider allocations policies that are insensitive to service requirements and have a maximal stability region. We take a limit where the queuing model becomes congested. We study how service is allocated under this limit. We demonstrate that the only possible limit allocation is one that maximizes a proportionally fair optimization problem. |
| Document type | Article |
| Published at |
https://doi.org/10.1007/s11134-011-9223-4
(Final published version)
|
| Downloads |
360717.pdf
(Final published version)
|
| Permalink to this page | |