Greedy distributed optimization of multi-commodity flows

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 274-283

  Awerbuch, Baruch ^a   Khandekar, Rohit ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Distributed algorithms; Multi commodity flows; Self stabilization; Statelessness

Indexed keywords

MULTI COMMODITY FLOWS; SELF STABILIZATION; STATELESSNESS;

BANDWIDTH; COMBINATORIAL OPTIMIZATION; NETWORK ARCHITECTURE; PARALLEL ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 36849078139     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281140     Document Type: Conference Paper

References (35)

1. B. Awerbuch and Y. Azar. Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation. FOCS, 1994.
2. B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. STOC, 2005.
3. B. Awerbuch, Y. Azar, Y. Richter, and D. Tsur. Tradeoffs in worst-case equilibria. WAOA, 2004.
4. B. Awerbuch and R. Khandekar. Distributed network monitoring and multicommodity flows: a primal-dual approach. PODC, 2007.
5. B. Awerbuch, R. Khandekar, and S. Rao. Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA, 2007.
6. B. Awerbuch and T. Leighton. A simple local-control approximation algorithm for multicommodity flow. FOCS, 1993.
7. B. Awerbuch and T. Leighton. Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks. STOC, 1994.
8. B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local checking and correction. FOCS, 1991.
9. B. Awerbuch and G. Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols. FOCS, 1991.
10. Y. Bartal, J. W. Byers, and D. Raz. Global optimization using local information with applications to flow control. FOCS, 1997.
11. S. Chien and A. Sinclair. Convergence to approximate nash equilibria in congestion games. SODA, 2007.
12. E. Dijkstra. Self stabilizing systems in spite of distributed control. CACM, 17:643-644, Nov 1974.
13. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. PODC, 1990.
14. E. Even-Dar and Y. Mansour. Fast convergence of selfish rerouting. SODA, 2005.
15. S. Fischer, H. Racke, and B. Vocking. Fast convergence to wardrop equilibria by adaptive sampling methods. STOC, 2006.
16. S. Fischer and B. Vocking. Adaptive routing with stale information. PODC, 2005.
17. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. FOCS, 1998.
18. N. Garg and N. E. Young. On-line end-to-end congestion control. FOCS, 2002.
19. M. G. Gouda and N. J. Multari. Stabilizing communication protocols. Technical Report TR-90-20, Dept. of Computer Science, University of Texas at Austin, June 1990.
20. R. M. Karp, E. Koutsoupias, C. H. Papadimitriou, and S. Shenker. Optimization problems in congestion control. FOCS, 2000.
21. A. Khanna and J. A. Zinky. The revised arpanet routing metric. SIGCOMM, 1998.
22. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. STOC, 1990.
23. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 1993.
24. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. Lecture Notes in Computer Science, 1563:404-413, 1999.
25. J. F. Kurose and K. W. Ross. Computer Networking, a top down approach featuring the Internet, 3rd ed. Addison-Wesley Longman, 2004.
26. C. Labovitz, A. Ahuja, and F. Jahanian. Experimental study of internet stability and wide-area backbone failures. Technical Report CSE-TR-382-98, University of Michigan, 1998.
27. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problem. STOC, 1991.
28. M. Luby and N. Nissan. A parallel approximation algorithm for positive linear programming. STOC, 1993.
29. J. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the arpanet. IEEE Trans. on Commun., 28(5):711-719, May 1980.
30. J. M. McQuillan, G. Falk, and I. Richer. A review of the development and performance of the arpanet routing algorithm. IEEE Trans. on Commun., 26(12):1802-1811, Dec. 1978.
31. V. Mirrokni, M. Goemans, and A. Vetta. Sink equilibria and convergence. FOCS, 2005.
32. S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math of Oper. Research, pages 257-301, 1994.
33. J. Rexford. Handbook of Optimization in Telecommunications, Chapter on Route optimization in IP networks. Kluwer Academic Publishers, 2005.
34. T. Roughgarden. Selfish Routing. PhD thesis, Cornell University, Department of Computer Science, 2002.
35. N. E. Young. Sequential and parallel algorithms for mixed packing and covering. FOCS, 2001.