Practical OSPF traffic engineering

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 shorte...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2004-11, Vol.8 (11), p.689-691
Main Authors: Retvari, G., Cinkler, T.
Format: Article
Language:English
Subjects:
Access methods and protocols, osi model
Applied sciences
Computer architecture
Costs
Engineering management
Exact sciences and technology
Hardware
Inverse
IP (Internet Protocol)
IP networks
linear optimization
Load management
Open Shortest Path First (OSPF)
Optimization
Recognition
Routing (telecommunications)
Routing protocols
Shortest-path problems
Telecommunication traffic
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Tellurium
Throughput
Traffic engineering
Traffic flow
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2004.837629