Optimization in the Design of OSPF Telecommunication Networks
2004 (English)Licentiate thesis, comprehensive summary (Other academic)
This thesis address optimization problems related to the design of lP (Internet Protocol) networks. One of the most commonly used IGP's (Interior Gateway Protocols) in telecommunication networks is the OSPF (Open Shortest Path First) protocol with ECM (Equal Cost Multipath) distribution. This link state based protocol uses link weights, which usually are set by an network operator, for providing routers necessary information regarding how traffic should be routed. By shortest path computations, router decide by themselves how to distribute the traffic.
One problem considered in this thesis is the problem of designing networks which are capable of accommodating large parts of the traffic when network components fails. Link failures are the most common failures, and this is the kind of disturbance which is considered. A multiobjective optimization model is presented and we search for pareto-optimal solutions using a two-phased weight based search method. This method tries to minimize the design cost simultaneously as the level of network survivability is maximized. This method uses the fact that is is easy to compute how traffic is distributed when the OSPF metric is known.
In contrary, it is a much more difficult task to determine if there are any OSPF weights that yield a desired flow distribution. This is a topic which also is studied in the thesis. Necessary conditions, which flow patterns must fulfill for being identical to the shortest paths obtained from OSPF weights, are reported. Sufficient conditions for a special type of flow patterns are also presented. The thesis also contains a polynomial method which can be used for detecting impossibilities in a set of flow patterns when this set do not correspond to the shortest paths of any OSPF weights.
Flow patterns are the basis for a new model which is developed for designing lP networks where OSPF and ECM distribution is used . This model uses a set of in-graphs in order to represent weights implicitly. The model also uses a new set of constraints used for modeling ECM distribution. The usefulness of the model is verified by computational experiments.
Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 2004. , 10 p.
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1102
IdentifiersURN: urn:nbn:se:liu:diva-22354Local ID: 1560ISBN: 91-7373-988-XOAI: oai:DiVA.org:liu-22354DiVA: diva2:242667
2004-06-03, Sal BL 32, Hus B, Linköpings Universitet, Linköping, 10:15 (Swedish)
Prytz, Mikael, Tekn. Dr.
List of papers