Why locally-fair maximal flows in client-server networks perform well

DOI10.1007/S10878-010-9321-YMaRDI QIDQ652641zbMATH OpenOpenAlexFDO

Authors Kenneth A. Berman, Chad Yoshikawa

Publication date 15 December 2011

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-010-9321-y

zbMATH Keywords

oblivious routingmaximal flowdistributed flow algorithmsnetwork algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Recommendations

• Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well
• Fairness in routing and load balancing
• Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms
• Localized Client-Server Load Balancing without Global Information
• Fast, Fair, and Efficient Flows in Networks

Cites work

• Computing and Combinatorics
• Distributed algorithm for approximating the maximum matching
• Online client-server load balancing without global information
• Power balance and apportionment algorithms for the United States Congress

Cited in

(1)

• Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well

This page was built for publication: Why locally-fair maximal flows in client-server networks perform well

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