liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A survey of optimization methods for solving the inverse shortest path routing problem
Linköping University, Department of Mathematics, Optimization .
2010 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [sv]

Ruttningen av trafik i IP-nätverk sker ofta med hjälp av bågvikter som bestämmer vilken väg trafiken tar (kortastevägruttning). Problemet här är att avgöra ifall det existerar en uppsättning vikter givet ett önskat ruttningsschema. Den hör rapporten undersöker prestandan hos ett antal modeller och optimeringsprogram avsedda att lösa denna typ av problem som ofta kallas inversa kortastevägruttningsproblemet.

Undersökningen visar att det existerar en stor skillnad mellan modellerna och optimeringsprogrammen och att modellen baserad på cykelbaser löst med CPLEXdualopt lösaren är snabbast.

Abstract [en]

The routing of traffic in IP networks is often done with a set of weights that determinewhich way the traffic will go (shortest path routing). The problem here is todetermine if there exists a set of weights for a desired routing pattern. This thesis willinvestigate the performance of a number of different models and solvers for solvingthis type of problem which is usually called the inverse shortest path routing (ISPR)problem. The models tested are the same as described in [1]. The different solversused are mainly the linear CPLEX solvers but also a few multi commodity networksolvers.

The tests showed that there is a big performance difference between the models andsolvers and that the cycle bases model solved with the CPLEX dualopt solver wasthe fastest overall.

Place, publisher, year, edition, pages
2010. , 63 p.
Keyword [en]
ISPR, WFP, SPR, OSPF, MMCF, Graph, Network, Optimization, Routing
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-59536ISRN: LiTH-MAT-EX--2010/26--SEOAI: oai:DiVA.org:liu-59536DiVA: diva2:352876
Presentation
2010-09-14, Determinanten, 10:00 (Swedish)
Uppsok
Physics, Chemistry, Mathematics
Supervisors
Examiners
Available from: 2010-11-08 Created: 2010-09-19 Last updated: 2010-11-08Bibliographically approved

Open Access in DiVA

A survey of optimization methods for solving the inverse shortest path routing problem(420 kB)1137 downloads
File information
File name FULLTEXT01.pdfFile size 420 kBChecksum SHA-512
575ca3f2063f4b988bc09bbbc6879cf87fb608e6c3f83b5d06bceb88edf5df3f4d2e24015a28612433259b3b5940fc030583e49d0f4cfc84b02cf2d31d2ac714
Type fulltextMimetype application/pdf

By organisation
Optimization
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 1137 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

urn-nbn

Altmetric score

urn-nbn
Total: 321 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf