2021/05/04 by Wei‐Chang Yeh, Yeh, Wei-Chang
Engineering · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graphics (cs.GR) #Reliability and Maintenance Optimization
paper · pdf · doi:10.48550/arxiv.2105.01500
openalex publication_date 2021/05/04 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
Among various real-life emerging applications, wireless sensor networks,\nInternet of Things, smart grids, social networks, communication networks,\ntransportation networks, and computer grid systems, etc., the binary-state\nnetwork is the fundamental network structure and model with either working or\nfailed binary components. The network reliability is an effective index for\nassessing the network function and performance. Hence, the network reliability\nbetween two specific nodes has been widely adopted and more efficient network\nreliability algorithm is always needed. To have complete information for a\nbetter decision, all-pairs network reliability thus arises correspondingly. In\nthis study, a new algorithm called the all-pairs BAT is proposed by revising\nthe binary-addition-tree algorithm (BAT) and the layered-search algorithm\n(LSA). From both the theoretical analysis and the practical experiments\nconducted on 20 benchmark problems, the proposed all-pairs BAT is more\nefficient than these algorithms by trying all combinations of any pairs of\nnodes.\n