| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 1.01 MB | Adobe PDF |
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
Contexto Educativo
Citação
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
Editora
Springer