Insensitive, maximum stable allocations converge to proportional fairness

DOI10.1007/s11134-011-9223-4zbMath1214.90030arXiv1007.3115OpenAlexW2165723486MaRDI QIDQ543560

N. S. Walton

Publication date: 17 June 2011

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.3115

zbMATH Keywords

insensitivitymaximum stabilityproportional fairness

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Traffic problems in operations research (90B20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (4)

Congestion in large balanced multirate networks ⋮ Inequity averse optimization in operational research ⋮ On the rate of convergence for infinite server Erlang-Sevastyanov's problem ⋮ Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies

Cites Work

• Towards an Erlang formula for multiclass networks
• Proportional fairness and its relationship with multi-class queueing networks
• Bandwidth sharing and admission control for elastic traffic
• On stochastic bounds for monotonic processor sharing networks
• Resource pooling in congested networks: Proportional fairness and product form
• Structural properties of proportional fairness: stability and insensitivity
• Insensitivity in processor-sharing networks
• Partial balance and insensitivity

This page was built for publication: Insensitive, maximum stable allocations converge to proportional fairness