A Comparison between Two All-Terminal Reliability Algorithms

Abstract

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. IndexTerms-All-terminal network reliability, decomposition, network availability, pathwidth.

Reliable and resilient access network design for advanced metering infrastructures in smart grid

“…Several approaches are introduced from different angles, in order to retain a high communication network reliability. As pointed out by the authors in [25–27], classical approaches such as minimal path set and minimal cut set have been both applied to calculate all‐terminal reliability of a specific network. Given a connected graph , a subset of E is called a path set of G , in which all nodes in the network are connected.…”

“…1, pp. [24][25][26][27][28][29][30] This is an open access article published by the IET under the Creative Commons Attribution-NonCommercial-NoDerivs License (http://creativecommons.org/licenses/by-nc-nd/3.0/) summarise it, ensuring a high communication network reliability still remains one of the most fundamental requirements in smart grid AMI.…”