Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/90456
DC FieldValueLanguage
dc.contributor.authorGirão-Silva, Rita-
dc.contributor.authorGomes, Teresa-
dc.contributor.authorMartins, Lúcia-
dc.contributor.authorTipper, David-
dc.contributor.authorAlashaikh, Abdulaziz-
dc.date.accessioned2020-07-17T16:22:29Z-
dc.date.available2020-07-17T16:22:29Z-
dc.date.issued2020-05-11-
dc.identifier.citationR. Girão-Silva, T. Gomes, L. Martins, D. Tipper and A. Alashaikh, "A centrality-based heuristic for network design to support availability differentiation," 2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020, Milano, Italy, 2020, pp. 1-7, doi: 10.1109/DRCN48652.2020.1570603040.pt
dc.identifier.isbn978-1-7281-6300-0-
dc.identifier.urihttps://hdl.handle.net/10316/90456-
dc.description.abstractIn today's society, communication networks are of paramount importance, and providing adequate levels of availability of the resources in a cost effective way is crucial for network managers. We consider the design of a high availability structure (a spine) in the network, so that a desired availability for the network flows may be achieved. The tackled problem involves the selection of the edges forming the spine and the selection of the enhanced availability for each of those edges, aiming at fulfilling a prespecified availability value for each flow, at minimum cost. We solve the formulated Mixed Integer Linear Problem (MILP) for small networks, which allows us to identify some characteristics of the spanning tree formed by the set of links with upgraded availability. Afterwards, using that information, we propose a heuristic based on a centrality measure, which allows us to devise the appropriate set of links, and which may be used in larger networks. Experimental results show the effectiveness of the resolution approach in finding spines equal to the optimal ones or to the best known solutions.pt
dc.language.isoengpt
dc.publisherIEEEpt
dc.relationCENTRO-01-0145-FEDER-029312pt
dc.relationUIDB/00308/2020pt
dc.rightsembargoedAccesspt
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/pt
dc.subjectavailabilitypt
dc.subjectresiliencept
dc.subjectheuristicpt
dc.subjectcentralitypt
dc.subjectcost functionspt
dc.titleA centrality-based heuristic for network design to support availability differentiationpt
dc.typearticlept
degois.publication.firstPage1pt
degois.publication.lastPage7pt
degois.publication.locationMilano, Italypt
degois.publication.title2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020pt
dc.relation.publisherversionhttps://ieeexplore.ieee.org/document/9089371pt
dc.peerreviewedyespt
dc.identifier.doi10.1109/DRCN48652.2020.1570603040-
dc.date.embargo2022-05-11*
uc.date.periodoEmbargo730pt
item.openairetypearticle-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextopen-
item.fulltextCom Texto completo-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.parentdeptUniversity of Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.orcid0000-0002-2331-8340-
crisitem.author.orcid0000-0002-3084-5608-
crisitem.author.orcid0000-0002-6534-0159-
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 SizeFormat
GiraoSilva-et-al_DRCN2020.pdf345.78 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

5
checked on Feb 26, 2024

WEB OF SCIENCETM
Citations 20

1
checked on Mar 2, 2024

Page view(s)

185
checked on Mar 26, 2024

Download(s)

72
checked on Mar 26, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons