Decentralized Proportional Load Balancing

DOI10.1137/140969361zbMath1336.68007OpenAlexW2281091583MaRDI QIDQ2790412

N. S. Walton, Jonatha Anselmi

Publication date: 4 March 2016

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11824/131

zbMATH Keywords

utility optimizationmultipath routingproportional fairnessdecentralized load balancer

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Simple efficient load-balancing algorithms for peer-to-peer systems
• Proportional fairness and its relationship with multi-class queueing networks
• The mathematics of internet congestion control
• Fluid model for a network operating under a fair bandwidth-sharing policy.
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Understanding TCP Vegas
• Control of Multipath TCP and Optimization of Multipath Routing in the Internet
• A Proof for the Queuing Formula: L = λW
• Resource pooling in queueing networks with dynamic routing
• Opportunistic beamforming using dumb antennas
• Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
• Utility Maximization for Communication Networks With Multipath Routing
• Time-shared Systems
• On Information and Sufficiency

This page was built for publication: Decentralized Proportional Load Balancing