Distributed algorithms for multicommodity flow problems via approximate steepest descent framework

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 949-957

  Awerbuch, Baruch ^a   Khandekar, Rohit ^b   Rao, Satish ^c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTI AGENT SYSTEMS;

APPROXIMATION RATIOS; BLOCKING FLOW; CONVERGENCE TIME; DISTRIBUTED SOLUTIONS; MULTICOMMODITY FLOW PROBLEMS; MULTIPLE AGENTS; PARALLEL ENVIRONMENT; SPACE OVERHEAD;

ALGORITHMS;

EID: 70349420773     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. [AA94] B. Awerbuch and Y. Azar. Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation. In Proc. 35th IEEE Symp. on Found. of Comp. Science, pages 240-249, 1994.
2. [ANR92] Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignment. In Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, pages 203-210, 1992.
3. [BBR97] Y. Bartal, J. W. Byers, and D. Raz. Global optimization using local information with applications to flow control. In Proc. 38th IEEE Symp. on Found. of Comp. Science, pages 303-312, 1997.
4. [EDM05] E. Even-Dar and Y. Mansour. Fast convergence of selfish rerouting. In Proc. 16th ACM-SIAM Symp. on Discrete Algorithms, pages 772-781, 2005.
5. [Fle00] L. K. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal on Discrete Mathematics, 13:505-520, 2000.
6. [FRV06] S. Fischer, H. Räcke, and B. Vöcking. Fast convergence to Wardrop equilibria by adaptive sampling methods. In Proc. 38th ACM Symp. on Theory of Computing, pages 653-662, 2006.
7. [GK98] N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proc. 39th IEEE Symp. on Found. of Comp. Science, pages 300-309, 1998.
8. [GY02] N. Garg and N. E. Young. On-line end-to-end congestion control. In Proc. 43rd IEEE Symp. on Found. of Comp. Science, pages 538-546, 2002.
9. [LN93] M. Luby and N. Nissan. A parallel approximation algorithm for positive linear programming. In Proc. 25th ACM Symp. on Theory of Computing, pages 448-457, 1993.
10. [PST95] S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math of Oper. Research, 20:257-301, 1995.
11. [You01] N. E. Young. Sequential and parallel algorithms for mixed packing and covering. In Proc. 42nd IEEE Symp. on Found. of Comp. Science, pages 538-546, 2001.