Resilient arcs and node disjointness in diverse routing
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | |
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/47604 https://doi.org/Teresa Gomes, Mateusz Żotkiewicz, Resilient arcs and node disjointness in diverse routing, Optical Switching and Networking, Volume 14, Part 2, 2014, Pages 149-163, ISSN 1573-4277, https://doi.org/10.1016/j.osn.2014.05.022. (http://www.sciencedirect.com/science/article/pii/S1573427714000666) https://doi.org/10.1016/j.osn.2014.05.022 |
Resumo: | In multi-layer networks protection can be provided at multiple layers. Hence some links at an upper layer may be {\it resilient} because they are protected at a lower layer. We will designate as {\it resilient arc} at a given layer, an arc which has some form of protection at an underlaying layer. When path diversity is used at an upper layer, and resilient arcs are taken into account, it may not be necessary for the considered paths to be fully disjoint. We solve a problem of finding the shortest node-disjoint pair of paths that can share resilient arcs. It is assumed that a network consists of a set of nodes and a set of arcs. Moreover, a number of available arcs are resilient. Our goal is to find the shortest pair of paths such that they share only those nodes that are incident to shared resilient arcs. Moreover, we assume that the resulting paths cannot contain loops, and costs of shared resilient arcs are counted only once towards the objective function. In the paper we present two novel algorithms solving the above problem, and two supporting algorithms that are utilized as subroutines. We implement the proposed algorithms and compare them to an MIP approach. |
id |
RCAP_d54005cb321b921d7344e665117941a2 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/47604 |
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 |
Resilient arcs and node disjointness in diverse routingroutingprotectiondisjoint pathsIn multi-layer networks protection can be provided at multiple layers. Hence some links at an upper layer may be {\it resilient} because they are protected at a lower layer. We will designate as {\it resilient arc} at a given layer, an arc which has some form of protection at an underlaying layer. When path diversity is used at an upper layer, and resilient arcs are taken into account, it may not be necessary for the considered paths to be fully disjoint. We solve a problem of finding the shortest node-disjoint pair of paths that can share resilient arcs. It is assumed that a network consists of a set of nodes and a set of arcs. Moreover, a number of available arcs are resilient. Our goal is to find the shortest pair of paths such that they share only those nodes that are incident to shared resilient arcs. Moreover, we assume that the resulting paths cannot contain loops, and costs of shared resilient arcs are counted only once towards the objective function. In the paper we present two novel algorithms solving the above problem, and two supporting algorithms that are utilized as subroutines. We implement the proposed algorithms and compare them to an MIP approach.Elsevier2014info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/47604https://doi.org/Teresa Gomes, Mateusz Żotkiewicz, Resilient arcs and node disjointness in diverse routing, Optical Switching and Networking, Volume 14, Part 2, 2014, Pages 149-163, ISSN 1573-4277, https://doi.org/10.1016/j.osn.2014.05.022. (http://www.sciencedirect.com/science/article/pii/S1573427714000666)http://hdl.handle.net/10316/47604https://doi.org/10.1016/j.osn.2014.05.022enghttps://www.sciencedirect.com/science/article/pii/S1573427714000666?via%3DihubGomes, TeresaŻotkiewicz, Mateuszinfo: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-25T12:19:41Zoai:estudogeral.uc.pt:10316/47604Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:53:44.384998Repositó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 |
Resilient arcs and node disjointness in diverse routing |
title |
Resilient arcs and node disjointness in diverse routing |
spellingShingle |
Resilient arcs and node disjointness in diverse routing Gomes, Teresa routing protection disjoint paths |
title_short |
Resilient arcs and node disjointness in diverse routing |
title_full |
Resilient arcs and node disjointness in diverse routing |
title_fullStr |
Resilient arcs and node disjointness in diverse routing |
title_full_unstemmed |
Resilient arcs and node disjointness in diverse routing |
title_sort |
Resilient arcs and node disjointness in diverse routing |
author |
Gomes, Teresa |
author_facet |
Gomes, Teresa Żotkiewicz, Mateusz |
author_role |
author |
author2 |
Żotkiewicz, Mateusz |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Gomes, Teresa Żotkiewicz, Mateusz |
dc.subject.por.fl_str_mv |
routing protection disjoint paths |
topic |
routing protection disjoint paths |
description |
In multi-layer networks protection can be provided at multiple layers. Hence some links at an upper layer may be {\it resilient} because they are protected at a lower layer. We will designate as {\it resilient arc} at a given layer, an arc which has some form of protection at an underlaying layer. When path diversity is used at an upper layer, and resilient arcs are taken into account, it may not be necessary for the considered paths to be fully disjoint. We solve a problem of finding the shortest node-disjoint pair of paths that can share resilient arcs. It is assumed that a network consists of a set of nodes and a set of arcs. Moreover, a number of available arcs are resilient. Our goal is to find the shortest pair of paths such that they share only those nodes that are incident to shared resilient arcs. Moreover, we assume that the resulting paths cannot contain loops, and costs of shared resilient arcs are counted only once towards the objective function. In the paper we present two novel algorithms solving the above problem, and two supporting algorithms that are utilized as subroutines. We implement the proposed algorithms and compare them to an MIP approach. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014 |
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/47604 https://doi.org/Teresa Gomes, Mateusz Żotkiewicz, Resilient arcs and node disjointness in diverse routing, Optical Switching and Networking, Volume 14, Part 2, 2014, Pages 149-163, ISSN 1573-4277, https://doi.org/10.1016/j.osn.2014.05.022. (http://www.sciencedirect.com/science/article/pii/S1573427714000666) http://hdl.handle.net/10316/47604 https://doi.org/10.1016/j.osn.2014.05.022 |
url |
http://hdl.handle.net/10316/47604 https://doi.org/Teresa Gomes, Mateusz Żotkiewicz, Resilient arcs and node disjointness in diverse routing, Optical Switching and Networking, Volume 14, Part 2, 2014, Pages 149-163, ISSN 1573-4277, https://doi.org/10.1016/j.osn.2014.05.022. (http://www.sciencedirect.com/science/article/pii/S1573427714000666) https://doi.org/10.1016/j.osn.2014.05.022 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://www.sciencedirect.com/science/article/pii/S1573427714000666?via%3Dihub |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
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_ |
1799133823758237696 |