Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/91115
Title: Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios
Authors: Gomes, Teresa 
Jorge, Luisa
Silva, Rita Cristina Girão Coelho da 
Yallouz, Jose
Babarczi, Peter 
Rak, Jacek 
Issue Date: 23-Jul-2020
Publisher: Springer, Cham
Project: CENTRO-01-0145-FEDER-029312 
UIDB/00308/2020 
COST Action CA15127 
UIDB/05757/2020 
Serial title, monograph or event: Guide to Disaster-Resilient Communication Networks
Abstract: Disjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k > 2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links in any single SRLG. Paths traversing disaster-prone regions should be disjoint, but in safe regions it may be acceptable for the paths to share links or even nodes for a quicker recovery. Auxiliary algorithms for obtaining the shortest path from a source to a destination are also presented in detail, followed by the illustrated description of Bhandari’s and Suurballe’s algorithms for obtaining a pair of paths of minimal total additive cost. These algorithms are instrumental for some of the presented schemes to determine disjoint paths for multiple failure scenarios.
URI: http://hdl.handle.net/10316/91115
ISBN: 978-3-030-44684-0
DOI: 10.1007/978-3-030-44685-7_17
Rights: embargoedAccess
Appears in Collections:I&D INESCC - Livros e Capítulos de Livros
FCTUC Eng.Electrotécnica - Livros e Capítulos de Livros

Files in This Item:
File Description SizeFormat Login
Chapter_17__Fundamental_Schemes_to_Determine_Disjoint_Paths_for_Multiple_Failure_Scenarios.pdfChapter 17 of Guide to Disaster-Resilient Communication Networks1.29 MBAdobe PDFEmbargo Access    Request a copy
Show full item record

Page view(s)

5
checked on Oct 27, 2020

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons