An Efficient Algorithm for Reliability Evaluation of the Bus Network

Abstract

The bus network is widely used in industrial automation and avionics systems due to its many advantages. Network reliability is an important indicator of the bus network design and analysis. However, the widely used reliability evaluation method is not capable of dealing with the bus network. In this paper, we model the bus network without redundancy and the bus network with redundancy, propose the algorithms to calculate the two-terminal reliability and the k-terminal reliability of the bus network with redundancy, and verify the effectiveness of the algorithms in three scenarios. The experimental results show that when the reliability of the link reaches 0.9, the two-terminal reliability of the bus network with redundancy of six terminal nodes, eight terminal nodes, and ten terminal nodes is 40.95%, 52.17%, and 61.26% higher than that of the bus network without redundancy, respectively; the k-terminal reliability is 61.26%, 74.58%, and 83.32% higher than that of the bus network without redundancy, respectively. The bus network with redundancy increases the communication paths for data exchange between devices and has higher reliability than the bus network without redundancy. The algorithms proposed in this paper provide an effective solution for the reliability evaluation of the bus network. It perfects the reliability evaluation system of the network with different topology architectures.

Keywords

• Minimal path sets
• minimal cut sets
• reliability evaluation
• sum-of-disjoint products
• the bus network