Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/105404
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Santos, Dorabella | - |
dc.contributor.author | Martins, Lucia | - |
dc.contributor.author | Gomes, Teresa Martinez dos Santos | - |
dc.contributor.author | Silva, Rita Cristina Girão Coelho da | - |
dc.date.accessioned | 2023-02-24T17:58:14Z | - |
dc.date.available | 2023-02-24T17:58:14Z | - |
dc.date.issued | 2022-10-26 | - |
dc.identifier.citation | 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. | pt |
dc.identifier.isbn | 978-1-6654-8677-4 | - |
dc.identifier.uri | https://hdl.handle.net/10316/105404 | - |
dc.description.abstract | 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. | pt |
dc.language.iso | eng | pt |
dc.publisher | IEEE Xplore | pt |
dc.relation | UIDB/00308/2020 | pt |
dc.rights | embargoedAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt |
dc.subject | resilient network design | pt |
dc.subject | availability guarantees | pt |
dc.subject | optimization | pt |
dc.subject | convex relaxation | pt |
dc.title | Near Optimal Network Design for Path Pair Availability Guarantees | pt |
dc.type | article | pt |
degois.publication.firstPage | 1 | pt |
degois.publication.lastPage | 8 | pt |
degois.publication.title | 2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM 2022) | pt |
dc.relation.publisherversion | https://ieeexplore.ieee.org/document/9927721 | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.1109/RNDM55901.2022.9927721 | - |
dc.date.embargo | 2023-04-24 | * |
uc.date.periodoEmbargo | 180 | pt |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | en | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | Com Texto completo | - |
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.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.orcid | 0000-0003-0368-2222 | - |
crisitem.author.orcid | 0000-0002-3084-5608 | - |
crisitem.author.orcid | 0000-0002-2331-8340 | - |
Appears in Collections: | FCTUC Eng.Electrotécnica - Artigos em Livros de Actas |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RNDM2022_SelfArchiveVersion.pdf | Near Optimal Network Design for Path Pair Availability Guarantees | 851.16 kB | Adobe PDF | View/Open |
Page view(s)
96
checked on May 7, 2024
Download(s)
43
checked on May 7, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License