- Insensitive, maximum stable allocations converge to proportional fairness
- Queueing Systems
- Pages (from-to)
- Issue number
- Document type
- Faculty of Science (FNWI)
- Korteweg-de Vries Institute for Mathematics (KdVI)
- 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.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.