Abstract
Maximal flows reach at least a 1/2 approximation of the maximum flow in client-server networks. By adding only 1 additional time round to any distributed maximal flow algorithm we show how this 1/2-approximation can be improved on bounded-degree networks. We call these modified maximal flows ‘locally fair’ since there is a measure of fairness prescribed to each client and server in the network. Let N = (U,V,E,b) represent a client-server network with clients U, servers V, network links E, and node capacities b, where we assume that each capacity is at least one unit. Let d(u) denote the b-weighted degree of any node u ∈ U ∪ V, Δ = max {d(u) | u ∈ U } and δ = min { d(v) | v ∈ V }. We show that a locally-fair maximal flow f achieves an approximation to the maximum flow of \(\min \{ 1, \frac{\Delta^2 - \delta} {2\Delta^2 - \delta\Delta - \Delta}\) }, and this result is sharp for any given integers δ and Δ. This results are of practical importance since local-fairness loosely models the steady-state behavior of TCP/IP and these types of degree-bounds often occur naturally (or are easy to enforce) in real client-server systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Annexstein, F., Berman, K.A., Strunjas, S., Yoshikawa, C.: Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. In: Workshop on Algorithm Engineering & Experiments, ALENEX (2007)
Awerbuch, B., Hajiaghayi, M.T., Kleinberg, R.D., Leighton, T.: Online Client-Server Load Balancing without Global Information. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 197–206. Society for Industrial and Applied Mathematics, Philadelphia (2005)
Cardinal, J., Labbé, M., Langerman, S., Levy, E., Mélot, H.: A tight analysis of the maximal matching heuristic. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 701–709. Springer, Heidelberg (2005)
Cherkassky, B.V., Goldberg, A.V., Martin, P., Setubal, J.C., Stolfi, J.: Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. J. Exp. Algorithmics 3, 8 (1998)
Czygrinow, A., Hańćkowiak, M., Szymańska, E.: Distributed algorithm for approximating the maximum matching. Discrete Appl. Math. 143(1-3), 62–71 (2004)
Hanckowiak, Karonski, Panconesi: On the distributed complexity of computing maximal matchings. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (1998)
Kurose, J.F., Ross, K.W.: Computer Networking: A Top-Down Approach Featuring the Internet Package. Addison-Wesley Longman Publishing Co., Inc., Boston (2000)
Qiu, D., Srikant, R.: Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks (2004)
Stevens, W.: TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. RFC 2001, Internet Engineering Task Force (January 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berman, K.A., Yoshikawa, C. (2009). Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. In: Ngo, H.Q. (eds) Computing and Combinatorics. COCOON 2009. Lecture Notes in Computer Science, vol 5609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02882-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-02882-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02881-6
Online ISBN: 978-3-642-02882-3
eBook Packages: Computer ScienceComputer Science (R0)