DocumentCode :
1165837
Title :
Practical OSPF traffic engineering
Author :
Rétvári, Gábor ; Cinkler, Tibor
Author_Institution :
Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary
Volume :
8
Issue :
11
fYear :
2004
Firstpage :
689
Lastpage :
691
Abstract :
Open Shortest Path First (OSPF) traffic engineering (TE) is intended to bring long-awaited traffic management capabilities into IP networks, which still rely on today´s prevailing routing protocols: OSPF or IS-IS. In OSPF, traffic is forwarded along, and split equally between, equal cost shortest paths. In this letter, we formulate the basic requirements placed on a practical TE architecture built on top of OSPF and present a theoretical framework meeting these requirements of practicality. The main contribution of our work comes from the recognition that coupled with an instance of the maximum throughput problem there exists a related inverse shortest-path problem yielding optimal OSPF link weights.
Keywords :
IP networks; computer network management; optimisation; routing protocols; telecommunication traffic; IP network; linear optimization; maximum throughput problem; open shortest path first; practical OSPF traffic engineering; routing protocols; Computer architecture; Costs; Engineering management; Hardware; IP networks; Load management; Routing protocols; Telecommunication traffic; Tellurium; Throughput; 65; OSPF; Open Shortest Path First; linear optimization; traffic engineering;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2004.837629
Filename :
1359894
Link To Document :
بازگشت