Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

On open shortest path first related network optimisation problems

Författare

  • Michal Pioro
  • A Szentesi
  • J Harmatos
  • A Juttner
  • P Gajowniczek
  • S Kozdrowski

Summary, in English

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.

Publiceringsår

2002

Språk

Engelska

Sidor

201-223

Publikation/Tidskrift/Serie

Performance Evaluation

Volym

48

Issue

1-4

Dokumenttyp

Artikel i tidskrift

Förlag

Elsevier

Ämne

  • Communication Systems
  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • multicommodity flows
  • network optimisation
  • OSPF
  • traffic engineering

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0166-5316