Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/48324
DC FieldValueLanguage
dc.contributor.authorMartins, Lúcia-
dc.contributor.authorGomes, Teresa-
dc.contributor.authorTipper, David-
dc.date.accessioned2018-04-15T18:46:09Z-
dc.date.issued2017-
dc.identifier.citationL. 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.21778por
dc.identifier.issn0028-3045por
dc.identifier.issn1097-0037por
dc.identifier.urihttp://hdl.handle.net/10316/48324-
dc.descriptionPeer reviewed version of "Efficient heuristics for determining node-disjoint path pairs visiting specified nodes"por
dc.description.abstractA 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.por
dc.description.sponsorshipLú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).por
dc.language.isoengpor
dc.publisherWileypor
dc.relationinfo:eu-repo/grantAgreement/FCT/5876/147388/PTpor
dc.rightsembargoedAccess-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/por
dc.subjectresilient routingpor
dc.subjectvisiting a given set of nodespor
dc.subjectmin-sumpor
dc.subjectheuristicspor
dc.subjectnode-disjoint path pairpor
dc.subjectpath-based formulationpor
dc.titleEfficient heuristics for determining node-disjoint path pairs visiting specified nodespor
dc.typearticlepor
degois.publication.firstPage292por
degois.publication.lastPage307por
degois.publication.issue4por
degois.publication.titleNetworkspor
dc.relation.publisherversionhttp://onlinelibrary.wiley.com/doi/10.1002/net.21778/fullpor
dc.peerreviewedyespor
dc.identifier.doi10.1002/net.21778por
degois.publication.volume70por
dc.date.embargo2019-04-15T18:46:10Z-
item.fulltextCom Texto completo-
item.grantfulltextopen-
item.languageiso639-1en-
crisitem.author.deptFaculdade de Ciências e Tecnologia, Universidade de Coimbra-
crisitem.author.parentdeptUniversidade de Coimbra-
crisitem.author.researchunitInstitute for Systems Engineering and Computers at Coimbra-
Appears in Collections:FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais
I&D INESCC - Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
Martins_Gomes_Tipper_Networks_2017_EstudoGeral.pdf1.25 MBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

2
checked on Nov 8, 2019

WEB OF SCIENCETM
Citations

2
checked on Jun 25, 2019

Page view(s) 50

295
checked on Nov 13, 2019

Download(s) 50

408
checked on Nov 13, 2019

Google ScholarTM

Check

Altmetric

Dimensions


This item is licensed under a Creative Commons License Creative Commons