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 path- 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.
Index Terms—All-terminal network reliability, decomposition, network availability, pathwidth.
Willem Pino is with the Netherlands Organization for Applied Scientific Research (TNO), the Hague, the Netherlands, he is also with the Department of Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands (e-mail: willem.pino@tno.nl).
Teresa Gomes is with the Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal, she is also with INESC, Coimbra, Portugal (e-mail: Teresa@deec.uc.pt).
Robert Kooij is with the Netherlands Organization for Applied Scientific Research (TNO), the Hague, the Netherlands, he is also with the Faculty of Electrical Engineering, Delft University of Technology, Delft, the Netherlands (e-mail: robert.kooij@tno.nl).
[PDF]
Cite:Willem Pino, Teresa Gomes, and Robert Kooij, "A Comparison between Two All-Terminal Reliability Algorithms," Journal of Advances in Computer Networks vol. 3, no. 3, pp. 284-290, 2015.
