Distributed algorithms for multicommodity flow problems via approximate steepest descent framework

Authors:
Baruch Awerbuch;Rohit Khandekar;Satish Rao
Affiliations:
Johns Hopkins University, Baltimore, MD;IBM T. J. Watson Research Center, Jersey, NJ;University of California, Berkeley, CA
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2012

Citing 17
Cited 0

The competitiveness of on-line assignments

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A parallel approximation algorithm for positive linear programming

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line load balancing with applications to machine scheduling and virtual circuit routing

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems

Mathematics of Operations Research
Approximate minimum-cost multicommodity flows in O˜(&egr;-2KNM) time

Mathematical Programming: Series A and B
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

SIAM Journal on Discrete Mathematics
Faster approximation schemes for fractional multicommodity flow problems

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-Line End-to-End Congestion Control

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Global Optimization Using Local Information with Applications to Flow Control

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Sequential and Parallel Algorithms for Mixed Packing and Covering

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Fast convergence of selfish rerouting

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations

SIAM Journal on Computing
Fast convergence to Wardrop equilibria by adaptive sampling methods

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

SIAM Journal on Computing
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms

Proceedings of the forty-second ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider solutions for distributed multicommodity flow problems, which are solved by multiple agents operating in a cooperative but uncoordinated manner. We show first distributed solutions that allow (1 + ε) approximation and whose convergence time is essentially linear in the maximal path length, and is independent of the number of commodities and the size of the graph. Our algorithms use a very natural approximate steepest descent framework, combined with a blocking flow technique to speed up the convergence in distributed and parallel environment. Previously known solutions that achieved comparable convergence time and approximation ratio required exponential computational and space overhead per agent.