Novel Binary Addition Tree Algorithm (BAT) for Calculating the Direct Lower-Bound of the Highly Reliable Binary-State Network Reliability

TL;DR

This paper introduces a new binary addition tree algorithm to efficiently compute a direct lower bound on the reliability of highly reliable binary-state networks, addressing the computational challenges of exact reliability calculation.

Contribution

The paper presents a novel binary addition tree algorithm that provides a direct lower bound for network reliability, improving efficiency for large, highly reliable networks.

Findings

The proposed algorithm effectively computes reliability lower bounds.

Numerical experiments validate the efficiency and accuracy of the method.

The approach is suitable for large-scale, highly reliable networks.

Abstract

Real-world applications such as the internet of things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems are typically modeled as network structures. Network reliability represents the success probability of a network and it is an effective and popular metric for evaluating the performance of all types of networks. Binary-state networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are some of the most popular network structures. The scale of networks has grown dramatically in recent years. For example, social networks have more than a billion users. Additionally, the reliability of components has increased as a result of both mature and emergent technology. For highly reliable networks, it is more practical to calculate approximated reliability, rather than exact reliability, which is an NP-hard problem. Therefore, we propose a novel direct reliability lower bound based on the binary addition tree algorithm to calculate approximate reliability. The efficiency and effectiveness of the proposed reliability bound are analyzed based on time complexity and validated through numerical experiments.