Efficient heuristics for determining node-disjoint path pairs visiting specified nodes

Detalhes bibliográficos
Autor(a) principal: Martins, Lúcia
Data de Publicação: 2017
Outros Autores: Gomes, Teresa, Tipper, David
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/48324
https://doi.org/10.1002/net.21778
Resumo: Peer reviewed version of "Efficient heuristics for determining node-disjoint path pairs visiting specified nodes"
id RCAP_1580c3771e3e6a4f9813a86fbc8e64bf
oai_identifier_str oai:estudogeral.uc.pt:10316/48324
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 Efficient heuristics for determining node-disjoint path pairs visiting specified nodesresilient routingvisiting a given set of nodesmin-sumheuristicsnode-disjoint path pairpath-based formulationPeer reviewed version of "Efficient heuristics for determining node-disjoint path pairs visiting specified nodes"A new recursive heuristic is proposed to calculate a shortest simple path, from a source node to a destination node, that visits a specified set of nodes in a network. To provide survivability to failures along the path, the proposed heuristic is modified to ensure that the calculated path can be protected by a node-disjoint backup path. Additionally, the case when both paths in the disjoint path pair are required to visit specific sets of nodes is studied and effective heuristics are proposed. An evaluation of the solutions of the heuristics is conducted by comparing with results from an integer linear programming (ILP) formulation for each of the considered problems, and also with previous heuristics. The ILP solver may require a significant amount of time to obtain a solution, especially in large networks, which justifies the need for effective, computationally efficient heuristics for solving these problems.Lúcia Martins and Teresa Gomes acknowledge financial support by Fundação para a Ciência e a Tecnologia (FCT) under project grant UID/MULTI/00308/2013 of INESC Coimbra. This article is based upon work from COST Action CA15127 (“Resilient communication services protecting end-user applications from disaster-based failures - RECODIS”) supported by COST (European Cooperation in Science and Technology).Wiley2017info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/48324http://hdl.handle.net/10316/48324https://doi.org/10.1002/net.21778engL. Martins, T. Gomes, D. Tipper. ''Efficient heuristics for determining node-disjoint path pairs visiting specified nodes'', Networks, Volume 70, Issue 4, 2017, Pages 292-307. DOI: 10.1002/net.217780028-30451097-0037http://onlinelibrary.wiley.com/doi/10.1002/net.21778/fullMartins, LúciaGomes, TeresaTipper, Davidinfo: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-09-25T11:12:01Zoai:estudogeral.uc.pt:10316/48324Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:53:44.170519Repositó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 Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
title Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
spellingShingle Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
Martins, Lúcia
resilient routing
visiting a given set of nodes
min-sum
heuristics
node-disjoint path pair
path-based formulation
title_short Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
title_full Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
title_fullStr Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
title_full_unstemmed Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
title_sort Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
author Martins, Lúcia
author_facet Martins, Lúcia
Gomes, Teresa
Tipper, David
author_role author
author2 Gomes, Teresa
Tipper, David
author2_role author
author
dc.contributor.author.fl_str_mv Martins, Lúcia
Gomes, Teresa
Tipper, David
dc.subject.por.fl_str_mv resilient routing
visiting a given set of nodes
min-sum
heuristics
node-disjoint path pair
path-based formulation
topic resilient routing
visiting a given set of nodes
min-sum
heuristics
node-disjoint path pair
path-based formulation
description Peer reviewed version of "Efficient heuristics for determining node-disjoint path pairs visiting specified nodes"
publishDate 2017
dc.date.none.fl_str_mv 2017
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/48324
http://hdl.handle.net/10316/48324
https://doi.org/10.1002/net.21778
url http://hdl.handle.net/10316/48324
https://doi.org/10.1002/net.21778
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv L. Martins, T. Gomes, D. Tipper. ''Efficient heuristics for determining node-disjoint path pairs visiting specified nodes'', Networks, Volume 70, Issue 4, 2017, Pages 292-307. DOI: 10.1002/net.21778
0028-3045
1097-0037
http://onlinelibrary.wiley.com/doi/10.1002/net.21778/full
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Wiley
publisher.none.fl_str_mv Wiley
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_ 1799133823751946240

Registros relacionados