A simple polynomial time framework for reduced-path decomposition in multi-path routing

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 739-749

  Mirrokni, Vahab S ^a   Thottan, Marina ^b   Uzunalioglu, Huseyin ^b   Paul, Sanjoy ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC DEMANDS; LINK POLICIES; MULTI-COMMODITY FLOW; NETWORK UTILIZATION;

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; BANDWIDTH; INTEGER PROGRAMMING; OPTIMIZATION; TELECOMMUNICATION LINKS; THEOREM PROVING;

INTERNET;

EID: 8344278789     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. K. Ambs, S. Cwilich, M. Deng, D. J. Houck, D. F. Lynch, and D. Yan. Optimizing restoration capacity in the at&t network. Interfaces, 30(1):26-44, Jan - Feb 2000.
2. D Applegate and M. Thorup. Load optimal mpls routing with n + m labels. In Proc. of IEEE Infocom, 2003.
3. G. Baier, E Kohler, and M. Skutella. On the k-splittable flow problem. In In the proceeding of ESA 2002, 10th Annual European Symposium of Algorithms, pages 101-113, 2002.
4. J. Boyle, V. Gill, A. Hannan, D. Cooper, D. Awduche, B. Christian, and W. S. Lai. Applicability statement for traffic engineering with mpls. IETF RFC, 3346.
5. ILOG CPLEX. http://www.ilog.com/products/cplex/.
6. Y. Dinitz, N. Garg, and M. X. Goemans. On the single-source unsplittable flow problem. In IEEE Symposium on Foundations of Computer Science(FOCS), pages 290-299, 1998.
7. A. Dwivedi and R. E. Wagner. Traffic model for usa long distance optimal network. Proc. Optical Fiber Communication Conference, pages 156-158, 2000.
8. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving traffic demands for operational ip networks: Methodology and experience. IEEE/ACM Transactions on Networking, 9, 2001.
9. A. Gupta, A. Kumar, and R. Rastogi. Exploring the trade-off between label size and stack depth in mpls routing. Proc. IEEE INFOCOM, 2003.
10. V. Guruswami, S. Khanna, B. Rajaraman, F. B. Shepherd, and M. Yannakakis. Near-optimal hard-ness results and approximation algorithms for edge-disjoint paths and related problems. In Proc. of ACM STOC, pages 19-28, 1999.
11. K. Kar, M. Kodialam, and T. V. Lakshman. Minimum interference routing with applications to (mpls) traffic engineering. Proc. IEEE INFOCOM, pages 884-893, 2000.
12. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
13. J. Kleinberg. Approximation algorithms for disjoint paths problems. Phd Thesis, MIT, 1996.
14. J. M. Kleinberg. Single-source unsplittable flow problem. In IEEE Symposium on Foundations of Computer Science(FOCS), pages 68-77, 1996.
15. P. Kolman and C. Scheideler. Improved bounds for the unsplittable flow problem. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'02, pages 184-193, 2002.
16. L. Li, M. Thottan, B. Yao, and S. Paul. Distributed network monitoring with bounded link utilization. Proc. IEEE INFOCOM, 2003.
17. A. Medina, A. Lakhina, I. Matta, and J. Byers. Brite: An approach to universal topology generation. Proc. MASCOTS, Aug 2001.
18. D. Mitra, J. A. Morrison, and K. G. Ramakrishnan. Atm network design and optimization: A multirate loss network framework. IEEE/ACM Transactions on Networking, 4(4):531-543, Aug 1996.
19. D. Mitra and K. G. Ramakrishnan. A case study of multiservice, multipriority traffic engineering design for data networks. Proc. IEEE GLOBECOM, pages 1077-1083, Dec, 1999.
20. S. Nelakuditi and Z. Zhang, On selection of paths for multi-path routing, IWQoS, June 2001.
21. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexit. Dover, 1998.
22. P. Raghavan and C. Thompson. Randomized rounding: A technique for provably good algorithms. Combinatorica, 7:365-374, 1987.
23. A. Sridharan, R. Guerin, and C. Diot. Achieving near-optimal traffic engineering solutions for current ospf/is-is networks. Proc. IEEE INFOCOM, 2003.
24. S. Suri, M. Waldvogel, D. Bauer, and P. R. Warkhede. Profile-based routing and traffic engineering. Computer Communications, 25, 2002.
25. Eva Tardos. A strongly polynomial algorithm to solve combinatorial linear programs. Operation Research, 34:250-256, 1986.
26. M. Thottan, K. Swanson, M. Cantone, T. K. Ho, J. Ren, and S. Paul, Sequin: An snmp-based mpls, diffserv network monitoring system. Bell Labs Technical Journal, Aug 2003.
27. Pravin, M. Vaidya. Speeding-up linear programming using fast matrix multiplication. In In the proceeding 30th symp. of Foundations of Computer Science FOCS, pages 332-337, 1989.
28. C. Villamizar. Mpls optimized multipath mpls-omp. Internet draft, 1999.
29. B. M. Waxman. Routing of multi-point connections. IEEE JSAC, 6(9):1617-1622, 1988.
30. X. Xiao, A. Hannan, B. Bailey, and L. Ni. Traffic engineering with mpls in the internet. IEEE Network Magazine, pages 28-33, Mar 2000.
31. S. Yilmaz and I. Matta. On the scalability tradeoffs in mpls and ip routing. Technical Report Boston University, Computer Science Department, 2002.