Achieving near-optimal traffic engineering solutions for current OSPF/ IS-IS networks

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2003, Pages 1167-1177

  Sridharan, Ashwin ^a   Guérin, Roch ^a   Diot, Christophe ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Sprint Applied Research & Advanced Technology Labs California   (United States)

Author keywords

Aggregation; Networks; Routing; Traffic Engineering

Indexed keywords

INTERNET; NETWORK PROTOCOLS; TELECOMMUNICATION TRAFFIC; AGGLOMERATION; GRAPH THEORY; INTERNET PROTOCOLS; NETWORKS (CIRCUITS); ROUTING PROTOCOLS;

TRAFFIC ENGINEERING;

TELECOMMUNICATION NETWORKS; OPTIMIZATION;

IP NETWORKS; NEXT-HOP; OPTIMAL DISTRIBUTIONS; PERFORMANCE CRITERION; PERFORMANCE LEVEL; ROUTING; SHORTEST PATH; TRAFFIC DISTRIBUTIONS; TRAFFIC ENGINEERING;

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

References (16)

1. E. Rosen, A. Viswanathan, and R. Callon, "Multiprotocol label switching architecture," Internet Engineering Task Force, Request For Comments (Standards Track) RFC 3031, January 2001.
2. J. Moy, "OSPF Version 2," Internet Engineering Task Force, Request For Comments (Standard) RFC 2328, April 1998.
3. R. Callon, "Use of OSI IS-IS for routing in TCP/IP and dual environments," Internet Engineering Task Force, Request For Comments (Standard) RFC 1195, December 1990.
4. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proceedings of INFOCOM'2000, Tel Aviv, Israel, March 2000.
5. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Chapter 17, Section 17.2. Prentice-Hall Inc., 1990.
6. Z. Wang, Y. Wang, and L. Zhang, "Internet traffic engineering without full mesh overlaying," in Proceedings of INFOCOM'2001, Anchorage, Alaska, April 2001.
7. 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, 2001.
8. C. Villamizar, "MPLS optimized multipath MPLS-OMP," INTERNET-DRAFT, draft-villamizar-mpls-omp-01.txt, February 1999, (work in progress).
9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
10. E. W. Zegura, "GT-ITM: Georgia tech internet-work topology models (software)," Georgia Tech," http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm/tar.gz, 1996.
11. A. Medina, A. Lakhina, I. Malta, and J. Byers, "BRITE: Boston university representative internet topology generator," Boston University," http://cs-www.bu.edu/brite, April 2001.
12. R. G. Ashwin Sridharan and C. Diot, "Achieving Near-Optimal Traffic Engineering Solutions for Current OSPF/IS-IS Networks," University of Pennsylvania, Tech. Rep., May 2002, Available at http://einstein.seas.upenn.edu/publications.html.
13. S. Bhattacharya, C. Diot, J. Jetcheva, and N. Taft, "Pop-level and access-link level traffic dynamics in a tier-1 pop," Proceedings of ACM SIGCOMM Internet Measurement Workshop (IMW 2001), November 2001.
14. M. Kodialam and T. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," in PROCEEDINGS of INFOCOM, Tel Aviv, Israel, March 2000.
15. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing world," Journal on Selected Areas in Communication, February 2002.
16. R. L. Graham, "Bounds on multiprocessing timing anamolies," SIAM Journal on Applied Mathematics, vol. 17, March 1969.