Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow

We study local-control algorithms for maximum flow and multicommodity flow problems in distributed networks. We propose a second-order method for accelerating the convergence of the "first-order" distributed algorithms recently proposed by Awerbuch and Leighton. Our experimental study shows that second-order methods are significantly faster than the first-order methods for approximate single- and multicommodity flow problems. Furthermore, our experimental study gives valuable insights into the diffusive processes that underly these local-control algorithms; this leads us to identify many open technical problems for theoretical study.

[1]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[2]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[3]  Bart W. Stuck,et al.  A Computer and Communication Network Performance Analysis Primer (Prentice Hall, Englewood Cliffs, NJ, 1985; revised, 1987) , 1987, Int. CMG Conference.

[4]  Clifford Stein,et al.  Implementation of a Combinatorial Multicommodity Flow Algorithm , 1991, Network Flows And Matching.

[5]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

[6]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[7]  Baruch Awerbuch,et al.  Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.

[8]  Nir Shavit,et al.  Polynomial end-to-end communication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Bruce M. Maggs,et al.  Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.

[10]  Peter Winkler,et al.  Mixing of random walks and other diffusions on a graph , 1995 .

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

[12]  S. Muthukrishnan,et al.  First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract) , 1996, SPAA '96.

[13]  Baruch Awerbuch,et al.  A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[14]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[15]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[16]  David R. Karger,et al.  Using random sampling to find maximum flows in uncapacitated undirected graphs , 1997, STOC '97.

[17]  Rafail Ostrovsky,et al.  Adaptive packet routing for bursty adversarial traffic , 1998, STOC '98.

[18]  Fillia Makedon,et al.  Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..

[19]  Rajmohan Rajaraman,et al.  An adversarial model for distributed dynamic load balancing , 1998, SPAA '98.

[20]  S. Muthukrishnan,et al.  First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing , 1996, Theory of Computing Systems.

[21]  S. Muthukrishnan,et al.  Engineering Diffusive Load Balancing Algorithms Using Experiments , 1997, IRREGULAR.

[22]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

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