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

DOI10.1007/978-3-642-02882-3_37zbMATH Open1248.68058OpenAlexW2170344843MaRDI QIDQ5323085FDOQ5323085

Authors: Kenneth A. Berman, Chad Yoshikawa 

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_37

Recommendations

• Why locally-fair maximal flows in client-server networks perform well
• Fast, Fair, and Efficient Flows in Networks
• Efficient, fair, and strategy-proof (re)allocation under network constraints
• Linear max-min fairness in multi-commodity flow networks
• scientific article; zbMATH DE number 1898349
• Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
• An approximation to max min fairness in multi commodity networks
• scientific article; zbMATH DE number 1304095

zbMATH Keywords

oblivious routingmaximal flowdistributed flow algorithmsnetwork algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cites Work

• Power balance and apportionment algorithms for the United States Congress
• On the distributed complexity of computing maximal matchings
• Distributed algorithm for approximating the maximum matching
• Online client-server load balancing without global information
• Computing and Combinatorics

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 Q5323085)