Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A parallel approximation algorithm for positive linear programming
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
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
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
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th 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
Stabilizing Communication Protocols
Stabilizing Communication Protocols
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Beating Simplex for Fractional Packing and Covering Linear Programs
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Fast load balancing via bounded best response
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Stateless distributed algorithms for near optimal maximum multicommodity flows
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We design completely local, stateless, and self-stabilizing flow control mechanism to be executed by "greedy" agents associated with individual flow paths. Our mechanism is very natural and can be described in a single line: If a path has many "congested" edges, decrease the flow on the path by a small multiplicative factor, otherwise increase its flow by a small multiplicative factor. The mechanism does not require any initialization or coordination between the agents. We show that starting from an arbitrary feasible flow, the mechanism always maintains feasibility and reaches, after poly-logarithmic number of rounds, a 1+Ɛ approximation of the maximum throughput multicommodity flow. Moreover, the total number of rounds in which the solution is not 1+Ɛ approximate is also poly-logarithmic. Previous distributed solutions in our model either required a state since they used a primal-dual approach or had very slow (polynomial) convergence.