Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

On open shortest path first related network optimisation problems

  • Michal Pioro
  • A Szentesi
  • J Harmatos
  • A Juttner
  • P Gajowniczek
  • S Kozdrowski
Publiceringsår: 2002
Språk: Engelska
Sidor: 201-223
Publikation/Tidskrift/Serie: Performance Evaluation
Volym: 48
Nummer: 1-4
Dokumenttyp: Artikel i tidskrift
Förlag: Elsevier


The paper deals with flow allocation problems in IP networks using open shortest path first (OSPF) routing. Its main purpose is to discuss and propose methods for finding settlements of OSPF link weight system realising the assumed demand pattern for the given network resources (links capacities). Such settlements can result in a significantly better network performance, as compared with the simplified weight setting heuristics typically used nowadays. Although the configuration of the link weight system is primarily done in the network planning phase, still additional re-optimisations are feasible, and in fact essential, in order to cope with major changes in traffic conditions and with major resources' failures and rearrangements. The paper formulates a relevant OSPF routing optimisation problem, proves its NP-completeness, and discusses possible heuristic approaches and related optimisation methods for solving it. Two basic approaches are considered (the direct approach and the two-phase approach) and the resulting optimisation algorithms are presented. The considerations are illustrated with numerical results. (C) 2002 Elsevier Science B.V. All rights reserved.


  • Communication Systems
  • Electrical Engineering, Electronic Engineering, Information Engineering
  • multicommodity flows
  • network optimisation
  • OSPF
  • traffic engineering


  • ISSN: 0166-5316

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen