Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/48325
Title: A Comparison between Two All-Terminal Reliability Algorithms
Authors: Pino, Willem 
Gomes, Teresa 
Kooij, Robert 
Keywords: All-terminal network reliability; decomposition; network availability,; pathwidth
Issue Date: 2015
Project: info:eu-repo/grantAgreement/FCT/5876/147388/PT 
Serial title, monograph or event: Journal of Advances in Computer Networks
Volume: 3
Issue: 4
Abstract: Two algorithms computing the all-terminal reliability are compared. The first algorithm uses the pathsets and cutsets of the network to find lower and upper bounds respectively. The second algorithm uses decomposition and is able to give an exact outcome. The latter approach is significantly faster and able to calculate the exact value. However, for some large networks the decomposition algorithm does not give results while the ath- and cutset algorithm still returns bounds. The low computation times of the proposed decomposition algorithm make it feasible to incorporate the repeated calculation of the all-terminal reliability in new types of network analysis. Some illustrations of these analyses are provided.
Description: A Comparison between Two All-Terminal Reliability Algorithms
URI: http://hdl.handle.net/10316/48325
ISSN: 1793-8244
DOI: 10.18178/jacn.2015.3.4.183
Rights: openAccess
Appears in Collections:FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais
I&D INESCC - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
183-IS202.pdf1.93 MBAdobe PDFView/Open
Show full item record

Page view(s)

339
checked on Oct 22, 2021

Download(s) 50

287
checked on Oct 22, 2021

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons