Localized Client-Server Load Balancing without Global Information

DOI10.1137/S009753970444661XMaRDI QIDQ3519396zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Tom Leighton, Mohammad T. Hajiaghayi, Robert D. Kleinberg

Publication date 14 August 2008

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s009753970444661x

zbMATH Keywords

distributed algorithmsmaximum matchingmulticommodity flowoblivious routing

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

Recommendations

• Online client-server load balancing without global information
• Tight Bounds for Selfish and Greedy Load Balancing
• Tight bounds for selfish and greedy load balancing
• scientific article; zbMATH DE number 1256657
• On-line load balancing

Cited in

(8)

• Optimizing data throughput in client/server systems by keeping queue sizes balanced
• Parallel load balancing on constrained client-server topologies
• Scalable Load-Distance Balancing
• Load balancing via random local search in closed and open systems
• Improved bounds for distributed load balancing
• Online client-server load balancing without global information
• Why locally-fair maximal flows in client-server networks perform well
• Maximizing throughput in minimum rounds in an application-level relay service

This page was built for publication: Localized Client-Server Load Balancing without Global Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519396)