On the representability of arbitrary path sets as shortest paths: Theory, algorithms, and complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3042, Issue , 2004, Pages 1180-1191

  Rétvári, Gábor ^a   Szabó, Róbert ^a   Bíró, József J ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Linear programming; OSPF; Routing; Traffic engineering

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; INTERNET PROTOCOLS; LINEAR PROGRAMMING;

FUNDAMENTAL THEORY; LINK WEIGHTS; OSPF; REPRESENTABILITY; ROUTING; SHORTEST PATH; SHORTEST PATH FIRSTS; TRAFFIC ENGINEERING;

GRAPH THEORY;

EID: 33745894193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24693-0_97     Document Type: Article

References (11)

1. D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao, "Overview and principles of Internet traffic engineering." RFC 3272, May 2002.
2. J. Moy, "OSPF Version 2." RFC 2328, April 1998.
3. B. Fortz, J. Rexford, and M. Thorup, "Traffic engineering with traditional IP routing protocols," IEEE Communications Magazine, vol. 40, pp. 118-124, Oct 2002.
4. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing world," IEEE Journal of Selected Areas in Communications, vol. 20, pp. 756-767, May 2002.
5. B. Fortz and M. Thorup, "Increasing internet capacity using local search," 2000. unpublished manuscript, http://www.research.att.com/ ~mthorup/PAPERS/or_ospf.ps.
6. Z. Wang, Y. Wang, and L. Zhang, "Internet traffic engineering without full-mesh overlaying," in Proceedings of INFOCOM 2001, April 2001.
7. A. Sridharan, C. Diot, and R. Guérin, "Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks," in Proceedings of INFOCOM 2003, March 2003.
8. M. Thorup, "Avoiding ties in shortest path first routing," 2001. unpublished manuscript, http://www.research.att.com/~mthorup/PAPERS/ ties_ospf.ps.
9. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1993.
10. M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows. John Wiley & Sons, January 1990.
11. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: Universal topology generation from a user's perspective," Tech. Rep. 2001-003, 1 2001.