Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/48324
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Martins, Lúcia | - |
dc.contributor.author | Gomes, Teresa | - |
dc.contributor.author | Tipper, David | - |
dc.date.accessioned | 2018-04-15T18:46:09Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | 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 | por |
dc.identifier.issn | 0028-3045 | por |
dc.identifier.issn | 1097-0037 | por |
dc.identifier.uri | https://hdl.handle.net/10316/48324 | - |
dc.description | Peer reviewed version of "Efficient heuristics for determining node-disjoint path pairs visiting specified nodes" | por |
dc.description.abstract | 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. | por |
dc.description.sponsorship | 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). | por |
dc.language.iso | eng | por |
dc.publisher | Wiley | por |
dc.relation | info:eu-repo/grantAgreement/FCT/5876/147388/PT | por |
dc.rights | embargoedAccess | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | por |
dc.subject | resilient routing | por |
dc.subject | visiting a given set of nodes | por |
dc.subject | min-sum | por |
dc.subject | heuristics | por |
dc.subject | node-disjoint path pair | por |
dc.subject | path-based formulation | por |
dc.title | Efficient heuristics for determining node-disjoint path pairs visiting specified nodes | por |
dc.type | article | por |
degois.publication.firstPage | 292 | por |
degois.publication.lastPage | 307 | por |
degois.publication.issue | 4 | por |
degois.publication.title | Networks | por |
dc.relation.publisherversion | http://onlinelibrary.wiley.com/doi/10.1002/net.21778/full | por |
dc.peerreviewed | yes | por |
dc.identifier.doi | 10.1002/net.21778 | por |
degois.publication.volume | 70 | por |
dc.date.embargo | 2019-04-15T18:46:10Z | - |
item.fulltext | Com Texto completo | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.openairetype | article | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.orcid | 0000-0002-6534-0159 | - |
crisitem.author.orcid | 0000-0002-3084-5608 | - |
Appears in Collections: | I&D INESCC - Artigos em Revistas Internacionais FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Martins_Gomes_Tipper_Networks_2017_EstudoGeral.pdf | 1.25 MB | Adobe PDF | View/Open |
SCOPUSTM
Citations
8
checked on Sep 23, 2024
WEB OF SCIENCETM
Citations
10
8
checked on Sep 2, 2024
Page view(s) 50
522
checked on Sep 10, 2024
Download(s) 50
778
checked on Sep 10, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License