Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/95486
DC FieldValueLanguage
dc.contributor.authorSilva, Jaime-
dc.contributor.authorGomes, Teresa Martinez dos Santos-
dc.contributor.authorTipper, David-
dc.contributor.authorMartins, Lúcia-
dc.contributor.authorKounev, Velin-
dc.date.accessioned2021-08-04T14:36:33Z-
dc.date.available2021-08-04T14:36:33Z-
dc.date.issued2014-
dc.identifier.citationJ. Silva, T. Gomes, D. Tipper, L. Martins and V. Kounev, "An algorithm for computing all-terminal reliability bounds," 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), 2014, pp. 76-83, doi: 10.1109/RNDM.2014.7014934.pt
dc.identifier.isbn978-1-4799-7040-7-
dc.identifier.isbn978-1-4799-7039-1-
dc.identifier.isbn978-1-4799-7038-4-
dc.identifier.urihttps://hdl.handle.net/10316/95486-
dc.description.abstractThe exact calculation of all-terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all-terminal reliability have been utilized. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The performance of the algorithm is compared with the first two Bonferroni bounds, for networks where all mincuts could be calculated. The results show that the proposed approach is computationally feasible and reasonably accurate. Thus allowing one to obtain bounds when it not possible to enumerate all mincuts or all minpaths.pt
dc.description.sponsorshipFCT - Fundação para a Ciência e a Tecnologia, I.Ppt
dc.language.isoengpt
dc.publisherIEEEpt
dc.relationICIS Project CENTRO-07- 0224-FEDER-002003pt
dc.relationPEst-OE/ EEI/UI308/2014pt
dc.rightsembargoedAccesspt
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/pt
dc.subjectAll-terminal network reliabilitypt
dc.subjectBonferroni boundspt
dc.subjectNetwork availabilitypt
dc.subjectNetwork reductionpt
dc.titleAn algorithm for computing all-terminal reliability boundspt
dc.typearticlept
degois.publication.firstPage76pt
degois.publication.lastPage83pt
degois.publication.locationBarcelona, Espanhapt
dc.relation.publisherversionhttps://ieeexplore.ieee.org/document/7014934pt
dc.peerreviewedyespt
dc.identifier.doi10.1109/RNDM.2014.7014934-
dc.date.embargo2014-06-30*
uc.date.periodoEmbargo180pt
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextCom Texto completo-
item.openairetypearticle-
item.cerifentitytypePublications-
item.languageiso639-1en-
crisitem.author.researchunitCMUC - Centre for Mathematics of the University 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.orcid0000-0003-4467-7366-
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
Silva_et-al_RNDM2014_EstudoGeral.pdfAn Algorithm for Computing All-terminal Reliability Bounds316.54 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

7
checked on Sep 2, 2024

Page view(s)

204
checked on Oct 30, 2024

Download(s)

135
checked on Oct 30, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons