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.
Citations
-
3 0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (6)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Monographic publication
- Type:
- rozdział, artykuł w książce - dziele zbiorowym /podręczniku w języku o zasięgu międzynarodowym
- Language:
- English
- Publication year:
- 2020
- Bibliographic description:
- Gomes T., Jorge L., Girão-Silva R., Yallouz J., Babarczi P., Rak J.: Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios// Guide to Disaster-Resilient Communication Networks/ : , 2020, s.429-453
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/978-3-030-44685-7
- Sources of funding:
- Verified by:
- Gdańsk University of Technology
seen 83 times