Utilize este identificador para referenciar este registo: http://hdl.handle.net/10198/11657
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, Jose
Melo, Paulo
Jorge, Luísa
Mirones, Vitor
Brízido, André
Palavras-chave: Diverse routing
SRLG-disjoint
Node-disjoint
Min-sum
Data: 2014
Editora: Springer
Citação: Gomes, Teresa; Soares, Miguel; Craveirinha, Jose; Melo, Paulo; Jorge, Luísa; Mirones, Vitor; Brízido, André (2014) - Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost. Journal of Network and Systems Management. ISSN 1064-7570.
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, 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, 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 is reported.
Peer review: yes
URI: http://hdl.handle.net/10198/11657
DOI: 10.1007/s10922-014-9332-6
Versão do Editor: http://link.springer.com/article/10.1007%2Fs10922-014-9332-6
Aparece nas colecções:IC - Artigos em Revistas Indexados ao ISI/Scopus

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
2014gomesetal_bon_LookInside.pdf115,82 kBAdobe PDFVer/Abrir    Acesso Restrito. Solicitar cópia ao autor!


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.