Insensitive, maximum stable allocations converge to proportional fairness
Probability
2010-07-20 v1 Optimization and Control
Abstract
We describe a queueing 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 queueing model become congested. We study how service is allocated under this limit. We demonstrates that the only possible limit allocation is one that maximizes a proportionally fair optimization problem.
Cite
@article{arxiv.1007.3115,
title = {Insensitive, maximum stable allocations converge to proportional fairness},
author = {N. S. Walton},
journal= {arXiv preprint arXiv:1007.3115},
year = {2010}
}
Comments
9 pages