logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Practical OSPF traffic engineering

delete2004-11-01
delete23
PRE
AI
G
Gábor Rétvári
T
Tibor Cinkler
DOI：10.1109/LCOMM.2004.837629delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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:
Open Shortest Path First (OSPF)
traffic engineering
linear optimization

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.2W
Citations:
2.2W

Organization

No organization information available