Near Optimal Network Design for Path Pair Availability Guarantees
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
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/105404 https://doi.org/10.1109/RNDM55901.2022.9927721 |
Resumo: | Guaranteeing high levels of availability in the network in a cost effective manner is of primary importance to network operators and managers. We address the network design problem for path pair availability guarantees, assuming links can be upgraded to have an increased availability. Since the path pair availability constraints are non-linear and not linearizable in an exact manner, this mathematical problem has been avoided by considering only the working path availability or availability guarantees for the working and backup paths separately in a disaggregated way. In this paper, we present an aggregated model, where only the path pair availabilities must be ful- filled. In this model, we consider a convex relaxation for an approximation of the path pair availability to obtain linear constraints, and describe an iterative approach to tighten the bounds of the solution space, in order to obtain near-optimal solutions. The results show that considering an aggregated model is more cost effective than considering a disaggregated model with explicit values for the availabilities of the working and the backup paths. |
id |
RCAP_5ba9ead473372b5294b891fd3a6ddb61 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/105404 |
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 |
Near Optimal Network Design for Path Pair Availability Guaranteesresilient network designavailability guaranteesoptimizationconvex relaxationGuaranteeing high levels of availability in the network in a cost effective manner is of primary importance to network operators and managers. We address the network design problem for path pair availability guarantees, assuming links can be upgraded to have an increased availability. Since the path pair availability constraints are non-linear and not linearizable in an exact manner, this mathematical problem has been avoided by considering only the working path availability or availability guarantees for the working and backup paths separately in a disaggregated way. In this paper, we present an aggregated model, where only the path pair availabilities must be ful- filled. In this model, we consider a convex relaxation for an approximation of the path pair availability to obtain linear constraints, and describe an iterative approach to tighten the bounds of the solution space, in order to obtain near-optimal solutions. The results show that considering an aggregated model is more cost effective than considering a disaggregated model with explicit values for the availabilities of the working and the backup paths.IEEE Xplore2022-10-26info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/105404http://hdl.handle.net/10316/105404https://doi.org/10.1109/RNDM55901.2022.9927721engD. Santos, L. Martins, T. Gomes and R. Girão-Silva, "Near Optimal Network Design for Path Pair Availability Guarantees," 2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM), Compiègne, France, 2022, pp. 1-8, doi: 10.1109/RNDM55901.2022.9927721.978-1-6654-8677-4https://ieeexplore.ieee.org/document/9927721Santos, DorabellaMartins, LuciaGomes, Teresa Martinez dos SantosSilva, Rita Cristina Girão Coelho dainfo: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:RCAAP2023-02-24T17:58:14Zoai:estudogeral.uc.pt:10316/105404Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:21:58.728204Repositó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 |
Near Optimal Network Design for Path Pair Availability Guarantees |
title |
Near Optimal Network Design for Path Pair Availability Guarantees |
spellingShingle |
Near Optimal Network Design for Path Pair Availability Guarantees Santos, Dorabella resilient network design availability guarantees optimization convex relaxation |
title_short |
Near Optimal Network Design for Path Pair Availability Guarantees |
title_full |
Near Optimal Network Design for Path Pair Availability Guarantees |
title_fullStr |
Near Optimal Network Design for Path Pair Availability Guarantees |
title_full_unstemmed |
Near Optimal Network Design for Path Pair Availability Guarantees |
title_sort |
Near Optimal Network Design for Path Pair Availability Guarantees |
author |
Santos, Dorabella |
author_facet |
Santos, Dorabella Martins, Lucia Gomes, Teresa Martinez dos Santos Silva, Rita Cristina Girão Coelho da |
author_role |
author |
author2 |
Martins, Lucia Gomes, Teresa Martinez dos Santos Silva, Rita Cristina Girão Coelho da |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Santos, Dorabella Martins, Lucia Gomes, Teresa Martinez dos Santos Silva, Rita Cristina Girão Coelho da |
dc.subject.por.fl_str_mv |
resilient network design availability guarantees optimization convex relaxation |
topic |
resilient network design availability guarantees optimization convex relaxation |
description |
Guaranteeing high levels of availability in the network in a cost effective manner is of primary importance to network operators and managers. We address the network design problem for path pair availability guarantees, assuming links can be upgraded to have an increased availability. Since the path pair availability constraints are non-linear and not linearizable in an exact manner, this mathematical problem has been avoided by considering only the working path availability or availability guarantees for the working and backup paths separately in a disaggregated way. In this paper, we present an aggregated model, where only the path pair availabilities must be ful- filled. In this model, we consider a convex relaxation for an approximation of the path pair availability to obtain linear constraints, and describe an iterative approach to tighten the bounds of the solution space, in order to obtain near-optimal solutions. The results show that considering an aggregated model is more cost effective than considering a disaggregated model with explicit values for the availabilities of the working and the backup paths. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-10-26 |
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/105404 http://hdl.handle.net/10316/105404 https://doi.org/10.1109/RNDM55901.2022.9927721 |
url |
http://hdl.handle.net/10316/105404 https://doi.org/10.1109/RNDM55901.2022.9927721 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
D. Santos, L. Martins, T. Gomes and R. Girão-Silva, "Near Optimal Network Design for Path Pair Availability Guarantees," 2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM), Compiègne, France, 2022, pp. 1-8, doi: 10.1109/RNDM55901.2022.9927721. 978-1-6654-8677-4 https://ieeexplore.ieee.org/document/9927721 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
IEEE Xplore |
publisher.none.fl_str_mv |
IEEE Xplore |
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_ |
1799134110150557696 |