Please use this identifier to cite or link to this item:
Title: An algorithm for computing all-terminal reliability bounds
Authors: Silva, Jaime 
Gomes, Teresa Martinez dos Santos 
Tipper, David 
Martins, Lucia
Kounev, Velin 
Keywords: All-terminal network reliability; Bonferroni bounds; Network availability; Network reduction
Issue Date: 2014
Publisher: IEEE
Citation: J. 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.
Project: ICIS Project CENTRO-07- 0224-FEDER-002003 
PEst-OE/ EEI/UI308/2014 
Place of publication or event: Barcelona, Espanha
Abstract: The 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.
ISBN: 978-1-4799-7040-7
DOI: 10.1109/RNDM.2014.7014934
Rights: embargoedAccess
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 full item record


checked on Jun 10, 2024

Page view(s)

checked on Jun 18, 2024


checked on Jun 18, 2024

Google ScholarTM




This item is licensed under a Creative Commons License Creative Commons