Utilize este identificador para referenciar este registo: https://hdl.handle.net/10316/48329
Título: Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
Autor: Gomes, Teresa 
Soares, Miguel 
Craveirinha, José 
Melo, Paulo 
Jorge, Luísa 
Mirones, Vitor 
Brízido, André 
Palavras-chave: diverse routing; SRLG-disjoint; node-disjoint; min-sum
Data: 2015
Editora: Springer
Projeto: QREN 23301 PANORAMA II 
PEst-OE/EEI/UI308/2014 
PERGS (Portugal Telecom Inovação) 
Título da revista, periódico, livro ou evento: Journal of Network and Systems Management
Volume: 23
Número: 4
Resumo: A Shared Risk Link Group (SRLG) is a set of links which share a common risk of failure. Routing protocols in Generalized MultiProtocol Label Switching (GMPLS), using distributed SRLG information, can calculate paths avoiding certain SRLGs. For single SRLG failure an end-to-end SRLG-disjoint path pair can be calculated, but to ensure connection in the event of multiple SRLG failures a set with more than two end-to-end SRLG-disjoint paths should be used. Two heuristic, the Conflicting SRLG-Exclusion Min Sum (CoSE-MS) and the Iterative Modified Suurballes's Heuristic (IMSH), for calculating node and SRLG-disjoint path pairs, which use the Modified Suurballes's Heuristic (MSH), are reviewed and new versions (CoSE-MScd and IMSHd) are proposed, which may improve the number of obtained optimal solutions. Moreover two new heuristics are proposed: kCoSE-MScd and kIMSHd, to calculate a set of k node and SRLG-disjoint paths, seeking to minimize its total cost. To the best of our knowledge these heuristics are a first proposal for seeking a set of k (k>2) node and SRLG-disjoint paths of minimal additive cost. The performance of the proposed heuristics is evaluated using a real network structure, where SRLGs were randomly defined. The number of solutions found, the percentage of optimal solutions and the relative error of the sub-optimal solutions are presented. Also the CPU time for solving the problem in a Path Computation Element (PCE) is reported.
Descrição: Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
URI: https://hdl.handle.net/10316/48329
ISSN: 1064-7570
DOI: 10.1007/s10922-014-9332-6
Direitos: openAccess
Aparece nas coleções:I&D INESCC - Artigos em Revistas Internacionais
FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato
gomes_et_al_R2_JONS_2015_EstudoGeral.pdf1.14 MBAdobe PDFVer/Abrir
Mostrar registo em formato completo

Citações SCOPUSTM   

3
Visto em 18/mar/2024

Citações WEB OF SCIENCETM
20

2
Visto em 2/mar/2024

Visualizações de página 50

471
Visto em 26/mar/2024

Downloads 50

426
Visto em 26/mar/2024

Google ScholarTM

Verificar

Altmetric

Altmetric


Este registo está protegido por Licença Creative Commons Creative Commons