Publication
Fundamental schemes to determine disjoint paths for multiple failure scenarios
| dc.contributor.author | Gomes, Teresa | |
| dc.contributor.author | Jorge, Luisa | |
| dc.contributor.author | Girão-Silva, Rita | |
| dc.contributor.author | Yallouz, Jose | |
| dc.contributor.author | Babarczi, Péter | |
| dc.contributor.author | Rak, Jacek | |
| dc.date.accessioned | 2023-02-06T15:39:01Z | |
| dc.date.available | 2023-02-06T15:39:01Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | Disjoint path routing approaches can be used to cope with multiple failure cenarios. 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. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.citation | Gomes, Teresa; Jorge, Luisa; Girão-Silva, Rita; Yallouz, Jose; Babarczi, Péter; Rak, Jacek (2020). Fundamental schemes to determine disjoint paths for multiple failure scenarios. In: Rak, Jacek, Hutchison, David (eds) Guide to Disaster-Resilient Communication Networks. Springer, Cham. p. 429-453 | pt_PT |
| dc.identifier.doi | 10.1007/978-3-030-44685-7_17 | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10198/26752 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.publisher | Springer | pt_PT |
| dc.relation | COST Action CA15127 | pt_PT |
| dc.relation | CENTRO-01-0145-FEDER-029312 | pt_PT |
| dc.relation | Institute for Systems Engineering and Computers at Coimbra - INESC Coimbra | |
| dc.relation.ispartofseries | Computer Communications and Networks; | |
| dc.relation.publisherversion | https://link.springer.com/chapter/10.1007/978-3-030-44685-7_17 | pt_PT |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt_PT |
| dc.title | Fundamental schemes to determine disjoint paths for multiple failure scenarios | pt_PT |
| dc.type | book part | |
| dspace.entity.type | Publication | |
| oaire.awardTitle | Institute for Systems Engineering and Computers at Coimbra - INESC Coimbra | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F00308%2F2020/PT | |
| oaire.citation.endPage | 453 | pt_PT |
| oaire.citation.startPage | 429 | pt_PT |
| oaire.citation.title | Guide to Disaster-Resilient Communication Networks | pt_PT |
| oaire.fundingStream | 6817 - DCRRNI ID | |
| person.familyName | Jorge | |
| person.givenName | Luísa | |
| person.identifier.ciencia-id | AB16-0263-87CB | |
| person.identifier.orcid | 0000-0002-0623-7282 | |
| person.identifier.rid | F-5156-2014 | |
| person.identifier.scopus-author-id | 22134881600 | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| rcaap.rights | restrictedAccess | pt_PT |
| rcaap.type | bookPart | pt_PT |
| relation.isAuthorOfPublication | 103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00 | |
| relation.isAuthorOfPublication.latestForDiscovery | 103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00 | |
| relation.isProjectOfPublication | 63cf9cb9-63d9-43bc-95b7-91eef504ac35 | |
| relation.isProjectOfPublication.latestForDiscovery | 63cf9cb9-63d9-43bc-95b7-91eef504ac35 |