Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation

Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths (e.g., MPLS tunnels). This paper presents an algorithm for finding an optimal and global per-commodity max-min fair rate vector in a polynomial number of steps. In addition, we present a fast and novel distributed algorithm where each source router can find the routing and the fair rate allocation for its commodities while keeping the locally optimal max-min fair allocation criteria. The distributed algorithm is a fully polynomial epsilon-approximation (FPTAS) algorithm and is based on a primal-dual alternation technique. We implemented these algorithms to demonstrate its correctness, efficiency, and accuracy.

[1]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[2]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[3]  Yuval Rabani,et al.  Fairness in routing and load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[4]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[5]  Baruch Awerbuch,et al.  Converging to approximated max-min flow fairness in logarithmic time , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[6]  M. Allalouf,et al.  Centralized and distributed approximation algorithms for routing and weighted max-min fair bandwidth allocation , 2005, HPSR. 2005 Workshop on High Performance Switching and Routing, 2005..

[7]  Yishay Mansour,et al.  Phantom: a simple and effective flow control scheme , 1996, SIGCOMM '96.

[8]  Klara Nahrstedt,et al.  Maxmin Fair Routing in Connection-Oriented Networks , 1998 .

[9]  Hanif D. Sherali,et al.  Rate allocation in wireless sensor networks with network lifetime requirement , 2004, MobiHoc '04.

[10]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[11]  Joseph Naor,et al.  Fair online load balancing , 2006, SPAA '06.

[12]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[13]  David B. Shmoys,et al.  Cut problems and their application to divide-and-conquer , 1996 .

[14]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[15]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[16]  Lisa Zhang,et al.  Fast, Fair and Frugal Bandwidth Allocation in ATM Networks , 1999, SODA '99.

[17]  Yuval Shavitt,et al.  Maximum Flow Routing with Weighted Max-Min Fairness , 2004, QofIS.

[18]  Jochen Könemann,et al.  Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..

[19]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[20]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[21]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[22]  Ashish Goel,et al.  Combining fairness with throughput: online routing with multiple objectives , 2000, STOC '00.

[23]  Danny Raz,et al.  Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[24]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .