Improved approximation algorithms the multi-commodity flow problem and local competitive routing in dynamic networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 487-496

  Awerbuch, Baruch ^a   Leighton, Tom ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; NETWORK ROUTING; ROUTING ALGORITHMS; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; DATA PROCESSING; TELECOMMUNICATION CONTROL;

DISTRIBUTED NETWORKS; DYNAMIC NETWORK; EDGE CAPACITY; END-TO-END COMMUNICATION; FIXED NETWORKS; IN NETWORKS; MULTI-COMMODITY FLOW; RUNNING TIME;

APPROXIMATION ALGORITHMS; ALGORITHMS;

CONCURRENT FLOW PROBLEM; DYNAMIC NETWORKS; EDGE BALANCING APPROACH; LOCAL COMPETITIVE ROUTING; LOCAL CONTROL ALGORITHMS; MULTICOMMODITY FLOW PROBLEM;

EID: 0028123963     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195238     Document Type: Conference Paper

References (16)

1. [AAMR93] William Aiello, Baruch Awerbuch, Bruce Maggs, and Satish Rao. Approximate load balancing on dynamic and synchronous networks. In Proc. 25th ACM Symp. on Theory of Computing, pages 632-641, May 1993.
2. [AE83] Baruch Awerbuch and Shimon Even. A formal approach to a communication-network protocol; broadcast as a case study. Technical Report TR-459, Electrical Engineering Department, Technion-I.I.T., Haifa, December 1983.
3. [AG88] Yehuda Afek and Eli Gafni. End-To-end communication in unreliable networks. In Proc. 7th ACM Symp. on Principles of Distrib. Computing, pages 131-148. ACM SIGACT and SIGOPS, ACM, 1988.
4. [AG91] Yehuda Afek and Eli Gafni. Bootstrap network resynchronization. In Proc. 10th ACM Symp. on Principles of Distrib. Computing, pages 295-307, 1991.
5. [AGR92] Yehuda Afek, Eli Gafni, and Adi Rosen. Slide -A technique for communication in unreliable networks. In Proc. 11th ACM Symp. on Principles of Distrib. Computing, pages 3546, August 1992.
6. [AL93] Baruch Awerbuch and Tom Leighton. A simple local-control approximation algorithm for multicommodity flow. In Proc. 34rd IEEE Symp. on Found, of Comp. Science, pages 459-46. IEEE, November 1993.
7. [AMS89] Baruch Awerbuch, Yishay Mansour, and Nir Shavit. End-To-end communication with polynomial overhead. In Proc. 30th IEEE Symp. on Found, of Comp. Science, pages 358-363, 1989.
8. [GT90] A.V. Goldberg and R. E. Tarjan. Solving minimum-cost flow problems by successive approximation. Mathematics of Operations Research, 15(3):430-466, 1990.
9. [Kar74] A. V. Karzanov. Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl., 15:434-437, 1974.
10. [KARR90] P. Klein, A. Agrawal, R. Ravi, and S. Rao. Approximation through multicommodity flow. In Proc. 31st IEEE Symp. on Found, of Comp. Science, pauges 726-727, 1990.
11. [KPP93] Anil Kamath, Omri Palmon, and Serge Plotkin. Simple and fast distributedmulti- commondity flow algorithm. Unpublished manuscript, December 1993.
12. [LMP+91] T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommod- ity flow problem. In Proc. 23rd, ACM Symp. on Theory of Computing, pages 101-111, May 1991.
13. [LR88] F. T. Leighton and Satish Rao. An approximate max-flow min-cut theorem for uniform multicommod ity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, IEEE, pages 422-431, 1988.
14. [MS78] F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes. North Holland Publishing Company, Amsterdam, 1978.
15. [Rab89] M.O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. ACM, 36(2):335-348, 1989.
16. [Vai89] P.M. Vaidya. Speeding up linear programming using fast matrix multiplication. In Proc. 30th IEEE Symp. on Found, of Comp. Science, pages 332-337, 1989.