Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost

Detalhes bibliográficos
Autor(a) principal: Gomes, Teresa
Data de Publicação: 2015
Outros Autores: Soares, Miguel, Craveirinha, José, Melo, Paulo, Jorge, Luísa, Mirones, Vitor, Brízido, André
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/48329
https://doi.org/10.1007/s10922-014-9332-6
Resumo: Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
id RCAP_d94753f695e64bad13f5b73592243bdc
oai_identifier_str oai:estudogeral.uc.pt:10316/48329
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Costdiverse routingSRLG-disjointnode-disjointmin-sumTwo Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum CostA 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.The author acknowledges financial support through project QREN 23301 PANORAMA II, co-financed by European Union’s FEDER through “Programa Operacional Factores de Competitividade” (POFC) of QREN (FCOMP-01-0202-FEDER-023301) by the Portuguese Foundation for Science and Technology under project grant PEst-OE/EEI/UI308/2014 and by Project PERGS of Portugal Telecom Inovação.Springer2015info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/48329http://hdl.handle.net/10316/48329https://doi.org/10.1007/s10922-014-9332-6eng1064-7570https://link.springer.com/article/10.1007%2Fs10922-014-9332-6Gomes, TeresaSoares, MiguelCraveirinha, JoséMelo, PauloJorge, LuísaMirones, VitorBrízido, Andréinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-05-29T10:05:29Zoai:estudogeral.uc.pt:10316/48329Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:53:44.031562Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
title Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
spellingShingle Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
Gomes, Teresa
diverse routing
SRLG-disjoint
node-disjoint
min-sum
title_short Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
title_full Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
title_fullStr Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
title_full_unstemmed Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
title_sort Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
author Gomes, Teresa
author_facet Gomes, Teresa
Soares, Miguel
Craveirinha, José
Melo, Paulo
Jorge, Luísa
Mirones, Vitor
Brízido, André
author_role author
author2 Soares, Miguel
Craveirinha, José
Melo, Paulo
Jorge, Luísa
Mirones, Vitor
Brízido, André
author2_role author
author
author
author
author
author
dc.contributor.author.fl_str_mv Gomes, Teresa
Soares, Miguel
Craveirinha, José
Melo, Paulo
Jorge, Luísa
Mirones, Vitor
Brízido, André
dc.subject.por.fl_str_mv diverse routing
SRLG-disjoint
node-disjoint
min-sum
topic diverse routing
SRLG-disjoint
node-disjoint
min-sum
description Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost
publishDate 2015
dc.date.none.fl_str_mv 2015
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/48329
http://hdl.handle.net/10316/48329
https://doi.org/10.1007/s10922-014-9332-6
url http://hdl.handle.net/10316/48329
https://doi.org/10.1007/s10922-014-9332-6
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1064-7570
https://link.springer.com/article/10.1007%2Fs10922-014-9332-6
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133823746703360

Registros relacionados