Files:DescriptionFile size FormatBrowse
Fulltext0.66 MBPDF (requires Acrobat Reader)Next
  
Authors:Peter Broström: Department of Mathematics, Linköping University, Sweden
Kaj Holmberg: Department of Mathematics, Linköping University, Sweden
Publication title:Determining the Non-Existence of Compatibel OSPF Weights
Conference:Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society
Publication type: Abstract and Fulltext
Issue:014
Article No.:001
Abstract:Many telecommunication networks use the OSPF protocol (Open Shortest Path First) for deciding the routing of traffic. In such networks, each router sends traffic on all shortest paths to the destination. The links in the network are assigned weights to be used by the routers when calculating the shortest paths.

An interesting question is whether or not a set of desired routing patterns can be used in an OSPF network. We investigate this problem, and find new necessary conditions for the existence of weights making the desired patterns shortest. A polynomial algorithm that for most cases verifies the non-existence of compatible weights is presented. The algorithm also indicates which parts of the traffic patterns that are in conflict. Some computational tests of the algorithm are reported.

Language:Swedish
Keywords:Telecommunication networks, Internet protocol, OSPF, routing, compatible weights
Year:2004
No. of pages:15
Pages:7-21
Series:Linköping Electronic Conference Proceedings
ISSN (print):1650-3686
ISSN (online):1650-3740
File:http://www.ep.liu.se/ecp/014/001/ecp014001.pdf
Available:2004-12-28
Publisher:Linköping University Electronic Press, Linköpings universitet

REFERENCE TO THIS PAGE
Peter Broström, Kaj Holmberg (2004). Determining the Non-Existence of Compatibel OSPF Weights, Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society http://www.ep.liu.se/ecp_article/index.en.aspx?issue=014;article=001 (accessed 4/24/2014)