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.

中文翻译：

---

计算全对同质弧二进制状态无向网络可靠性的新算法

在各种现实生活中的新兴应用，无线传感器网络，物联网，智能电网，社交网络，通信网络，交通网络和计算机网格系统等中，二进制状态网络是基本的网络结构和模型，其中正常工作或出现故障的二进制组件。网络可靠性是评估网络功能和性能的有效指标。因此，两个特定节点之间的网络可靠性已被广泛采用，并且始终需要更有效的网络可靠性算法。为了获得完整的信息以做出更好的决策，因此相应地出现了所有对网络的可靠性。在这项研究中，通过修改二进制加法树算法（BAT）和分层搜索算法（LSA），提出了一种称为全对BAT的新算法。