Practical OSPF traffic engineering

IEEE Communications Letters

Volumn 8, Issue 11, 2004, Pages 689-691

  Rétvári, Gábor ^a   Cinkler, Tibor ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Linear optimization; Open Shortest Path First (OSPF); Traffic engineering

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

LINEAR OPTIMIZATION; OPEN SHORTEST PATH FIRST (OSPF); TRAFFIC ENGINEERING;

INTERNET;

EID: 10244222705     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2004.837629     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, Apr. 1998.
3. D. Katz, D. Yeung, and K. Kompella, "Traffic engineering extensions to OSPF version 2," in Internet Draft, Oct. 2002.
4. B. Fortz, J. Rexford, and M. Thorup, "Traffic engineering with traditional IP routing protocols," IEEE Commun. Mag., vol. 40, pp. 118-124, Oct. 2002.
5. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing world," IEEE J. Select. Areas Commun., vol. 20, pp. 756-767, May 2002.
6. B. Fortz, "Internet traffic engineering by optimizing OSPF weights," in Proc. INFOCOM (2), 2000, pp. 519-528.
7. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
8. Z. Wang, Y. Wang, and L. Zhang, "Internet traffic engineering without full-mesh overlaying," in Proc. INFOCOM, Apr. 2001, pp. 565-571.
9. A. Sridharan, C. Diot, and R. Guérkin, "Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks," in Proc. INFOCOM, Mar. 2003, pp. 1167-1177.
10. M. Thorup, Avoiding Ties in Shortest Path First Routing, 2001. unpublished manuscript.
11. M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows. New York: Wiley, Jan. 1990.