Meet and merge: Approximation algorithms for confluent flows

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 373-382

  Chen, Jiangzhuo ^a   Rajaraman, Rajmohan ^a   Sundaram, Ravi ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b AKAMAI TECHNOLOGIES   (United States)

Author keywords

Approximation algorithms; Confluent flow; Multicommodity flow; Network flow; Randomization; Rounding; Routing

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); DATA TRANSFER; INTERNET;

CONFLUENT FLOWS;

DATA COMMUNICATION SYSTEMS;

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

References (27)

1. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley, New York, NY, 1991.
2. K. Athreya and A. Vidyashankar. Branching processes. Technical Report TR-99-16, Department of Statistics, University of Georgia, 1999.
3. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, Feb. 1998.
4. J. Chen, R. Rajaraman, and R. Sundaram. Meet and merge: Approximation algorithms for confluent flows. Technical report, College of Computer & Information Science, Northeastern University, March 2003.
5. Y. Dinitz, N. Garg, and M. Goemans. On the single-source unsplittable flow problem. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 290-299, November 1998.
6. W. Evans, C. Kenyon, Y. Peres, and L. Schulman. Broadcasting on trees and the ising model. Annals of Applied Probability, 10:410-433, 2000.
7. W. Feller. An Introduction to Probability Theory and its Applications, volume 1. Wiley, New York, NY, 1967.
8. L. Ford, Jr. and D. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956.
9. L. Ford, Jr. and D. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
10. S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111-121, 1980.
11. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.
12. A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener. Provisioning a virtual private network: A network design problem for multicommodity flow. In STOC: ACM Symposium on Theory of Computing, 2001.
13. R. Karp and Y. Zhang. Bounded branching process and AND/OR tree evaluation. Random Structures & Algorithms, 7:97-116, 1995.
14. S. Khuller, B. Raghavachari, and N. Young. Designing multi-commodity flow trees. In F. K. H. A. Dehne, J.-R. Sack, N. Santoro, and S. Whitesides, editors, Proceedings of the 3rd Workshop on Algorithms and Data Structures, volume 709 of Lecture Notes in Computer Science, pages 433-441, Montréal, Canada, Aug. 1993. Springer.
15. J. Kleinberg, Y. Rabani, and E. Tardos. Fairness in routing and load balancing. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 568-578, Oct. 1999.
16. J. M. Kleinberg. Single-source unsplittable flow. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 68-77, Oct. 1996.
17. G. Konjevod, R. Ravi, and A. Srinivasan. An approximation algorithm for the covering steiner problem. Random Structures & Algorithms, 20:465-48, 2002. Special Issue on Probabilistic Methods in Combinatorial Optimization.
18. A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener. Algorithms for provisioning virtual private networks in the hose model. In Proceedings of the ACM SIGCOMM 2001 Conference, volume 31 of Computer Communication Review, pages 135-148, Aug. 2001.
19. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM: Journal of the ACM, 46, 1999.
20. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
21. D. Lorenz, A. Orda, D. Raz, and Y. Shavitt. How good can IP routing be? Technical Report 2001-17, DIMACS, Apr. 2001.
22. M. Marathe, R. Ravi, R. Sundaram, S. Ravi, D. Rosenkrantz, and H. Hunt. Bicriteria network design problems. Journal of Algorithms, 28(1):142-171, July 1998.
23. C. McDiarmid. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics, pages 148-188. Cambridge University Press, Cambridge, UK, 1989.
24. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 2000.
25. P. Raghavan and C. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7, 1987.
26. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8:223-250, 1995.
27. J. Wang and K. Nahrstedt. Hop-by-hop routing algorithms for premium-class traffic in diffserv networks. In Proc. of IEEE INFOCOM 2002, New York, NY, June 2002.