Novel Algorithm for Computing All-Pairs Homogeneity-Arc Binary-State Undirected Network Reliability

Among various real-life emerging applications, wireless sensor networks, Internet of Things, smart grids, social networks, communication networks, transportation networks, and computer grid systems, etc., the binary-state network is the fundamental network structure and model with either working or failed binary components. The network reliability is an effective index for assessing the network function and performance. Hence, the network reliability between two specific nodes has been widely adopted and more efficient network reliability algorithm is always needed. To have complete information for a better decision, all-pairs network reliability thus arises correspondingly. In this study, a new algorithm called the all-pairs BAT is proposed by revising the binary-addition-tree algorithm (BAT) and the layered-search algorithm (LSA). From both the theoretical analysis and the practical experiments conducted on 20 benchmark problems, the proposed all-pairs BAT is more efficient than these algorithms by trying all combinations of any pairs of nodes.

💡 Research Summary

This paper presents a new algorithm for assessing network reliability in binary-state undirected networks, which are fundamental models where components can be either working or failed. The study focuses on the calculation of all-pairs network reliability, an important metric for evaluating network function and performance. To achieve this, the authors propose the all-pairs BAT (Binary-Addition-Tree) algorithm by revising existing methods such as the binary-addition-tree algorithm and layered-search algorithm.

The new approach aims to efficiently compute the reliability between any pair of nodes in a network, which is critical for making informed decisions about network management. The paper provides both theoretical analysis and practical experiments on 20 benchmark problems to demonstrate that the proposed all-pairs BAT algorithm outperforms existing methods by effectively trying all combinations of node pairs.

The research highlights the importance of efficient algorithms in handling the computational complexity associated with calculating reliability across a large number of nodes, especially in complex networks like wireless sensor networks, Internet of Things (IoT), smart grids, social networks, communication networks, transportation networks, and computer grid systems. The proposed algorithm thus offers a significant improvement over previous methods by providing faster and more accurate reliability assessments for all node pairs within these network types.

Overall, the study contributes to advancing the field of network reliability analysis by introducing an efficient computational method that can be applied across various real-world applications, enhancing decision-making processes in network management.