Load optimal MPLS routing with N + M labels

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 555-565

  Applegate, David ^a   Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; ADVANCED TRAFFIC MANAGEMENT SYSTEMS; INTERNET PROTOCOLS; OPTIMIZATION;

INTRADOMAIN ROUTING;

SWITCHING NETWORKS; ROUTERS;

DIFFERENTIATED SERVICES; FAST MEMORY; FRAME RELAY NETWORKS; INTRA-DOMAIN ROUTING; IP BACKBONE; LINK LOADS; LOAD CONSTRAINTS; MPLS LABEL; MPLS ROUTING; OPTIMAL ROUTING; ROUTER TABLES; TABLE SIZE; TRAFFIC CLASS; TRAFFIC ENGINEERING;

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

References (38)

1. E. C. Rosen, A. Viswanathan, and R. Callon, "Multiprotocol label switching architecture," 2001, Network Working Group, Request for Comments, http://www.ietf.org/rfc/rfc3031.txt.
2. The MPLS Resource Center, http://www.mplsrc.com/faq3.shtml#MPLS Deployment.
3. D. O. Awduche, "MPLS and traffic engineering in IP networks," IEEE Communications Magazine, vol. 37, no. 12, pp. 42-47, Dec. 1999.
4. D. O. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus, "Requirements for traffic engineering over MPLS," September 1999, Network Working Group, Request for Comments, http://www.ietf.org/rfc/rfc2702.txt.
5. D. Mitra and K. Ramakrishnan, "A case study of multiservice, multipriority traffic engineering design for data networks," in Proc. IEEE GLOBECOM, 1999, pp. 1077-1083.
6. X. Xiao, A. Hannan, B. Bailey, and L. Ni, "Traffic engineering with MPLS in the Internet," IEEE Network Magazine, pp. 28-33, Mar. 2000.
7. J. T. Moy, "OSPF version 2," July 1991, Network Working Group, Request for Comments: 1247, http://www.ietf.org/rfc/rfc1247.txt.
8. R. Callon, "Use of OSI IS-IS for routing in TCP/IP and dual environments," December 1990, Network Working Group, Request for Comments: 1195, http://www.ietf.org/rfc/rfc1195.txt.
9. A. Bley, M. Grötchel, and R. Wessäly, "Design of broadband virtual private networks: Model and heuristics for the B-WiN," in Proc. DIMACS Workshop on Robust Communication Networks and Survivability, AMSDIMACS Series 53, 1998, pp. 1-16.
10. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. 19th IEEE Conf. on Computer Communications (INFOCOM), 2000, pp. 519-528.
11. K. Ramakrishnan and M. Rodrigues, "Optimal routing in shortest-path data networks," Lucent Bell Labs Technical Journal, vol. 6, no. 1, 2001.
12. F. Lin and J. Wang, "Minimax open shortest path first routing algorithms in networks supporing the SMDS services," in Proc. IEEE International Conference on Communications (ICC), vol. 2, 1993, pp. 666-670.
13. J. Cao, D. David, S. Weil, and B. Yu, "Time-varying network tomography: Router link data," Journal of the American Statistical Association, vol. 95, pp. 1063-1075, 2000.
14. 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, vol. 9, no. 3, pp. 265-279, 2001.
15. A. Dwivedi and R. Wagner, "Traffic model for USA long-distance optimal network," in Proc. Optical Fiber Communication Conference (OFC), 2000, pp. 156-158, TuK.1.
16. L. G. Khachiyan, "A polynomial time algorithm for linear programming," Dokl. Akad. Nauk SSSR, vol. 244, pp. 1093-1096, 1979.
17. ILOG CPLEX, http://www.ilog.com/products/cplex/.
18. A. Makhorin, "Gnu linear programming kit," http://www.gnu.org/software/glpk/glpk.html.
19. N. Garg and J. Könemann, "Faster and simpler algorithms for multi- commodity flow and other fractional packing problems," in Proc. IEEE Foundations of Computer Science, 1998, pp. 300-309.
20. K. Long, Z. Zhang, and S. Cheng, "Load balancing algorithms in MPLS traffic engineering," in Proc. IEEE Workshop on High Performance Switching and Routing, 2001, pp. 175-179.
21. Y. Wang and L. Zhang, "A scalable and hybrid IP network traffic engineering approach," 2001, Network Working Group, Internet Draft (work in progress), http://www.ietf.org/proceedings/02mar/ID/draft-wang-te-hybrid-approach-00.txt.
22. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, New Jersey: Prentice Hall, 1993.
23. T. Chen and T. Oh, "Reliable services in MPLS," IEEE Communications Magazine, pp. 58-62, Dec. 1999.
24. A. Gupta, A. Kumar, and R. Rastogi, "Traveling with a Pez dispenser (or, routing issues in MPLS)," in Proc. IEEE Foundations of Computer Science, 2001.
25. E. W. Zegura, "GT-ITM: Georgia Tech internetwork topology models (software)," http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar.gz, 1996.
26. N. Karmarkar and K. Ramakrishnan, "Computational results of an interior point algorithm for large scale linear programming," Mathematical Programming, vol. 52, pp. 555-586, 1991.
27. V. Chvátal, Linear Programming. New York, New York: W. H. Freeman, 1980.
28. A. Schrijver, Theory of linear and integer programming. New York, New York: John Wiley & Sons, 1986.
29. R. D. McBride, "Progress made in solving the multicommodity flow problem," SIAM Journal on Optimization, vol. 8, pp. 947-955, 1998.
30. J. Kennington, "A primal partitioning code for solving multicommodity flow problems (version 1)," Department of Industrial Engineering and Operations Research, Southern Methodist University, Tech. Rep. 79009, 1979.
31. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, vol. 4, pp. 373-395, 1984.
32. P. M. Vaidya, "Speeding-up linear programming using fast matrix multiplication," in Proc. 30th Symp. on Foundations of Computer Science (FOCS), 1989, pp. 332-337.
33. N. Megiddo, "On finding primal- and dual-optimal bases," ORSA Journal on Computing, vol. 3, no. 1, pp. 63-65, 1991.
34. Eva Tardos, "A strongly polynomial algorithm to solve combinatorial linear programs," Operations Research, vol. 34, pp. 250-256, 1986.
35. R. Guerin, A. Orda, and D. Williams, "QoS routing mechanisms and OSPF extensions," in Proc. 2nd Global Internet Miniconference, 1996.
36. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee, "How to model an internetwork," in Proc. 15th IEEE Conf. on Computer Communications (INFOCOM), 1996, pp. 594-602.
37. K. Calvert, M. Doar, and E. W. Zegura, "Modeling Internet topology," IEEE Communications Magazine, vol. 35, no. 6, pp. 160-163, 1997.
38. P. L. Toint, "Transportation modelling and operations research: A fruitful connection," in Operations Research and Decision Aid Methodologies in Traffic and Transportation Management, ser. NATO ASI series: Ser. F, Computer and systems sciences, M. Labbé, G. Laporte, K. Tanczos, and P. L. Toint, Eds., vol. 166. Springer, 1998, pp. 1-27.