Insensitivity in processor-sharing networks
Performance Evaluation
On performance bounds for balanced fairness
Performance Evaluation - Internet performance symposium (IPS 2002)
Resource pooling in congested networks: proportional fairness and product form
Queueing Systems: Theory and Applications
Towards an Erlang formula for multiclass networks
Queueing Systems: Theory and Applications
Processor sharing and pricing implications
Proceedings of the 24th International Teletraffic Congress
Congestion in large balanced multirate networks
Queueing Systems: Theory and Applications
On the rate of convergence for infinite server Erlang---Sevastyanov's problem
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.