Optimal configuration of OSPF aggregates

IEEE/ACM Transactions on Networking

Volumn 11, Issue 2, 2003, Pages 181-194

  Rastogi, Rajeev ^a   Breitbart, Yuri ^b   Garofalakis, Minos ^a   Kumar, Amit ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Area border routers; Dynamic programming; IP address aggregation; Open shortest path first (OSPF); Optimal routing; OSPF advertisements; OSPF weights

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; HIERARCHICAL SYSTEMS; LARGE SCALE SYSTEMS; NETWORK PROTOCOLS; OPTIMAL SYSTEMS; REQUIREMENTS ENGINEERING; TELECOMMUNICATION TRAFFIC;

AREA BORDER ROUTERS; HIERARCHICAL ROUTING; INTERNET PROTOCOL ADDRESS AGGREGATION; OPEN SHORTEST PATH FIRST; OPTIMAL ALGORITHM; ROUTER LINK STATE DATABASE; SUBOPTIMAL ROUTING;

OPEN SYSTEMS;

EID: 0038325710     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.810317     Document Type: Article

References (5)

1. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 519-528.
2. C. Huitema, Routing in the Internet, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2000.
3. J. T. Moy, OSPF Anatomy of an Internet Routing Protocol. Reading, MA: Addison-Wesley, 1998.
4. Y. Breitbart, M. Garofalakis, A. Kumar, and R. Rastogi, "Optimal Configuration of OSPF Aggregates," Bell Labs., Tech. Memo., Aug. 2000.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.