Stronger Necessary Conditions for the Existence of a Compatible OSPF Metric
2004 (English)Report (Other academic)
A dominating standard for routing in telecommunication networks is Internet Protocol with OSPF (Open Shortest Path First) and ECM (Equal Cost Multipath). Each router sends the traffic on the shortest path to the destination. If there are several shortest path, the router splits the traffic evenly. The operator can assign weights to the links in the network, which are used by the routers when calculating the shortest paths. An important question is whether or not for a set of desired traffic patterns there exists a compatible metric, i.e. weights making the routers give the specified traffic patterns. We describe necessary conditions, stronger than those previously discovered, for the existence of compatible weights for a set of given desired shortest path-graphs.
Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 2004. , 24 p.
LiTH-MAT-R, ISSN 0348-2960 ; 8
Internet protocol, OSPF, compatible metric, optimization
IdentifiersURN: urn:nbn:se:liu:diva-22361Local ID: 1568OAI: oai:DiVA.org:liu-22361DiVA: diva2:242674