Online client-server load balancing without global information

MaRDI QIDQ2921671zbMATH OpenFDO

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

Publication date 13 October 2014

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph algorithms (graph-theoretic aspects) (05C85) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Localized Client-Server Load Balancing without Global Information
• scientific article; zbMATH DE number 1256657
• On-line load balancing
• scientific article; zbMATH DE number 2038778
• On-line load balancing made simple: greedy strikes back

Cited in

(5)

• Maximizing throughput in minimum rounds in an application-level relay service
• Localized Client-Server Load Balancing without Global Information
• Parallel load balancing on constrained client-server topologies
• Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well
• Why locally-fair maximal flows in client-server networks perform well

This page was built for publication: Online 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 Q2921671)