摘要
Reliability is one of the most popular tools for evaluating network performance. A new algorithm called QB-II (quick binary-addition tree algorithm II) is proposed to efficiently assess the reliability of the binary-state network which is the fundamental of current real-life networks. The QB-II implements the shortest minimum cuts (MCs) to separate the entire network into smaller sub-networks, and the source-target matrix convolution products to connect these sub-networks intelligently, and the aggregated probability to improve the efficiency in calculating the network reliability. Twenty benchmark problems were used to validate the performance of the QB-II.