Stateless distributed algorithms for near optimal maximum multicommodity flows

Authors:
Baruch Awerbuch;Rohit Khandekar
Affiliations:
Johns Hopkins University, Baltimore, MD, USA;IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 2
Cited 0

Stateless distributed gradient descent for positive linear programs

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Stateless near optimal flow control with poly-logarithmic convergence

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design a stateless and distributed solution to the problem of maximum multicommodity flows--route the maximum amount of flow between given source-sink pairs, possibly split along several paths, subject to edge-capacity constraints. Our main contribution is in extending the work of [1,2] to the case where the flow can be routed along possibly exponentially many different paths. Our algorithm, starting from an arbitrary feasible flow, always maintains a feasible flow, and reaches a 1 + ε approximation of maximum benefit value in Õ(n2) rounds.