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

Authors:
S. Muthukrishnan;Torsten Suel
Affiliations:
-;-
Venue:
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Year:
1998

Citing 18
Cited 1

Data networks

Data networks
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
The maximum concurrent flow problem

Journal of the ACM (JACM)
Fast approximation algorithms for multicommodity flow problems

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximate load balancing on dynamic and asynchronous networks

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Iterative solution methods

Iterative solution methods
First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Using random sampling to find maximum flows in uncapacitated undirected graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An adversarial model for distributed dynamic load balancing

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Engineering Diffusive Load Balancing Algorithms Using Experiments

IRREGULAR '97 Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel
Beyond the flow decomposition barrier

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Speeding-up linear programming using fast matrix multiplication

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Polynomial end-to-end communication

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A simple local-control approximation algorithm for multicommodity flow

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.