Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/87215
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Girão-Silva, Rita | - |
dc.contributor.author | Martins, Lúcia | - |
dc.contributor.author | Gomes, Teresa | - |
dc.contributor.author | Alashaikh, Abdulaziz | - |
dc.contributor.author | Tipper, David | - |
dc.date.accessioned | 2019-06-26T16:44:40Z | - |
dc.date.available | 2019-06-26T16:44:40Z | - |
dc.date.issued | 2019 | - |
dc.identifier.isbn | 978-981-13-1164-2 | - |
dc.identifier.isbn | 978-981-13-1165-9 | - |
dc.identifier.uri | https://hdl.handle.net/10316/87215 | - |
dc.description.abstract | The availability of the resources in communication networks is critical, due to the impact that possible disruptions of communication services may have in the society. Therefore, providing adequate levels of availability for every demand in a network is of paramount importance. In this work, we focus on the topological structure of a network to select a set of links that provide a high availability path to be used by the different end-to-end demands. This set of links constitutes a high availability structure (the spine) and is used as the working path for each demand. The backup path for each demand is edge-disjoint with the corresponding working path. This path pair provides end-to-end protection for critical service demands in the network. An exact formulation of the problem is presented and solved for small instances of networks. A heuristic resolution approach with centrality measures is also put forward, with an experimental study comparing the exact and the approximate results. | pt |
dc.language.iso | eng | pt |
dc.relation | CENTRO-01-0145-FEDER-029312 | pt |
dc.relation | UID/MULTI/00308/2013 | pt |
dc.relation.ispartofseries | Advances in Intelligent Systems and Computing; | - |
dc.rights | embargoedAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | pt |
dc.subject | Availability | pt |
dc.subject | Network design | pt |
dc.subject | Path protection | pt |
dc.subject | Heuristics | pt |
dc.subject | Centrality measures | pt |
dc.title | Improving Network Availability—A Design Perspective | pt |
dc.type | article | pt |
degois.publication.firstPage | 799 | pt |
degois.publication.lastPage | 815 | pt |
dc.relation.publisherversion | https://link.springer.com/chapter/10.1007/978-981-13-1165-9_73 | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.1007/978-981-13-1165-9_73 | - |
degois.publication.volume | 797 | pt |
dc.date.embargo | 2020-01-01 | * |
rcaap.embargofct | Required by Springer | pt |
uc.date.periodoEmbargo | 365 | pt |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
item.fulltext | Com Texto completo | - |
item.languageiso639-1 | en | - |
crisitem.author.dept | Faculty of Sciences and Technology | - |
crisitem.author.parentdept | University of 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.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.orcid | 0000-0002-2331-8340 | - |
crisitem.author.orcid | 0000-0002-6534-0159 | - |
crisitem.author.orcid | 0000-0002-3084-5608 | - |
Appears in Collections: | FCTUC Eng.Electrotécnica - Artigos em Livros de Actas I&D INESCC - Artigos e Resumos em Livros de Actas |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ICITC2018_Girao-Silva_Accepted.pdf | Proceddings of ICITC2018, Girao-Silva et-al | 439.51 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
7
checked on Apr 15, 2024
WEB OF SCIENCETM
Citations
10
5
checked on Apr 2, 2024
Page view(s)
369
checked on Apr 23, 2024
Download(s)
353
checked on Apr 23, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License