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

Path generation issues for survivable network design

  • Michal Pioro
  • Tomasz Śliwiński
  • Michal Zagożdżon
  • Mateusz Dzida
  • Włodzimierz Ogryczak
Publiceringsår: 2008
Språk: Engelska
Sidor: 820-835
Publikation/Tidskrift/Serie: Computational Science and Its Applications /Lecture Notes in Computer Science
Volym: 5073
Dokumenttyp: Konferensbidrag
Förlag: Springer


Link dimensioning and routing problems in resilient network design are considered. Reliable network operation is ensured by means of flow restoration which is performed on preselected protection (backup) paths that can absorb traffic overflows from failed primary paths. Backup and primary flows use separated link capacities, and can be split among many paths. In the paper, two restoration models are considered. The first model assumes that once the backup path is assigned it must be used in every state in which the protected primary path fails while the second model allows different protection paths to be used in different network failure states. The problems are formulated as multiple commodity linear programming (LP) models using the link-path (L-P) notation and solved by the column generation technique. Consequent pricing models and algorithms are introduced. Computational efficiency of the presented approaches is analyzed.

The research was partially supported by the Dean’s grant from the Faculty of Electronics and Information Technology, Warsaw University of Technology.


  • Electrical Engineering, Electronic Engineering, Information Engineering


ICCSA 2008
  • Networking-lup-obsolete
  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-540-69840-1

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