Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/91115
DC Field | Value | Language |
---|---|---|
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, Peter | - |
dc.contributor.author | Rak, Jacek | - |
dc.date.accessioned | 2020-09-27T11:28:33Z | - |
dc.date.available | 2020-09-27T11:28:33Z | - |
dc.date.issued | 2020-07-23 | - |
dc.identifier.isbn | 978-3-030-44684-0 | pt |
dc.identifier.uri | https://hdl.handle.net/10316/91115 | - |
dc.description.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. | pt |
dc.language.iso | eng | pt |
dc.publisher | Springer, Cham | pt |
dc.relation | CENTRO-01-0145-FEDER-029312 | pt |
dc.relation | UIDB/00308/2020 | pt |
dc.relation | COST Action CA15127 | pt |
dc.relation | UIDB/05757/2020 | pt |
dc.rights | embargoedAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by-nc/4.0/ | pt |
dc.title | Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios | pt |
dc.type | bookPart | pt |
degois.publication.firstPage | 429 | pt |
degois.publication.lastPage | 453 | pt |
degois.publication.title | Guide to Disaster-Resilient Communication Networks | pt |
dc.relation.publisherversion | https://link.springer.com/chapter/10.1007%2F978-3-030-44685-7_17 | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.1007/978-3-030-44685-7_17 | pt |
dc.date.embargo | 2022-07-23 | * |
rcaap.embargofct | Embargo period as indicated by the publisher | pt |
uc.date.periodoEmbargo | 730 | pt |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | bookPart | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.project.grantno | Institute for Systems Engineering and Computers at Coimbra - INESC Coimbra | - |
crisitem.project.grantno | Research Centre in Digitalization and Intelligent Robotics - CeDRI | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.orcid | 0000-0002-3084-5608 | - |
crisitem.author.orcid | 0000-0002-2331-8340 | - |
crisitem.author.orcid | 0000-0003-1644-2172 | - |
Appears in Collections: | FCTUC Eng.Electrotécnica - Livros e Capítulos de Livros I&D INESCC - Livros e Capítulos de Livros |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
_Chapter_3_0__Basic_approaches_to_determine_disjoint_paths_v2.pdf | 5.87 MB | Adobe PDF | View/Open |
Page view(s)
245
checked on Oct 1, 2024
Download(s)
142
checked on Oct 1, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License