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
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
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
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Load balancing without regret in the bulletin board model
Proceedings of the 28th ACM symposium on Principles of distributed computing
Stateless near optimal flow control with poly-logarithmic convergence
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
MIMO-aware routing in wireless mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Throughput-competitive advance reservation with bounded path dispersion
IEEE/ACM Transactions on Networking (TON)
Jetway: minimizing costs on inter-datacenter video traffic
Proceedings of the 20th ACM international conference on Multimedia
Approximating wardrop equilibria with finitely many agents
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
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.