Change search
ReferencesLink to record
Permanent link

Direct link
Shortest Path Routing Modelling, Infeasibility and Polyhedra
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
2012 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. This is of utmost importance. Traffic in IP networks is commonly routed along shortest paths with respect to auxiliary link weights, e.g. using the OSPF or IS-IS protocol. Here, shortest path routing is indirectly controlled via the link weights only, and it is therefore crucial to have a profound understanding of the shortest path routing mechanism to solve traffic engineering problems in IP networks. The theoretical aspects of such problems have received little attention.

Traffic engineering in IP networks leads to very difficult optimization problems and the key element in exact methods for such problems is an inverse shortest path routing problem. It is used to answer the fundamental question of whether there exist link weights that reproduce a set of tentative paths. Path sets that cannot be obtained correspond to routing conflicts. Valid inequalities are instrumental to prohibit such routing conflicts.

We analyze the inverse shortest path routing problem thoroughly. We show that the problem is NP-complete, contrary to what is claimed in the literature, and propose a stronger relaxation. Its Farkas system is used to develop a novel and compact formulation based on cycle bases, and to classify and characterize minimal infeasible subsystems. Valid inequalities that prevent routing conflicts are derived and separation algorithms are developed for such inequalities.

We also consider several approaches to modelling traffic engineering problems, especially Dantzig–Wolfe reformulations and extended formulations. We give characterizations of facets for some relaxations of traffic engineering problems.

Our results contribute to the theoretical understanding, modelling and solution of problems related to traffic engineering in IP networks.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2012. , 270 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1486
National Category
URN: urn:nbn:se:liu:diva-85547ISBN: 978-91-7519-751-7OAI: diva2:571482
Public defence
2012-11-29, Nobel (BL32), Hus B, ingång 23, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Available from: 2012-11-22 Created: 2012-11-22 Last updated: 2013-09-10Bibliographically approved

Open Access in DiVA

Shortest Path Routing Modelling, Infeasibility and Polyhedra(1484 kB)732 downloads
File information
File name FULLTEXT01.pdfFile size 1484 kBChecksum SHA-512
Type fulltextMimetype application/pdf
omslag(81 kB)73 downloads
File information
File name COVER01.pdfFile size 81 kBChecksum SHA-512
Type coverMimetype application/pdf

Search in DiVA

By author/editor
Call, Mikael
By organisation
Optimization The Institute of Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 732 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 544 hits
ReferencesLink to record
Permanent link

Direct link