论文标题
平行蝙蝠的开发及其在二进制网络可靠性问题中的应用
Development of a Parallel BAT and Its Applications in Binary-state Network Reliability Problems
论文作者
论文摘要
各种网络广泛地应用于现实生活中。可靠性是测量所有网络类型的性能的最重要索引。在各种算法中，只有隐式枚举算法，例如深度优先搜索，广度搜索，通用生成函数方法，二进制决策图和二进制 - 附加性树算法（BAT），才能用于计算确切的网络可靠性。但是，隐式枚举算法只能用于解决小规模网络可靠性问题。蝙蝠最近被提议为一种简单，快速，易于编码和灵活的拟合精确解决算法。基于实验结果，BAT及其变体的表现优于其他隐式枚举算法。因此，为了克服大小问题的上述障碍物，提出了一个新的平行蝙蝠（PBAT），以根据计算多线程体系结构来改进蝙蝠，以计算二进制国家网络可靠性问题，这对于所有类型的网络可靠性问题都是基本的。从对二元状态网络可靠性问题的20个基准进行的时间复杂性和实验的分析，PBAT能够有效地解决中等规模的网络可靠性问题。
Various networks are broadly and deeply applied in real-life applications. Reliability is the most important index for measuring the performance of all network types. Among the various algorithms, only implicit enumeration algorithms, such as depth-first-search, breadth-search-first, universal generating function methodology, binary-decision diagram, and binary-addition-tree algorithm (BAT), can be used to calculate the exact network reliability. However, implicit enumeration algorithms can only be used to solve small-scale network reliability problems. The BAT was recently proposed as a simple, fast, easy-to-code, and flexible make-to-fit exact-solution algorithm. Based on the experimental results, the BAT and its variants outperformed other implicit enumeration algorithms. Hence, to overcome the above-mentioned obstacle as a result of the size problem, a new parallel BAT (PBAT) was proposed to improve the BAT based on compute multithread architecture to calculate the binary-state network reliability problem, which is fundamental for all types of network reliability problems. From the analysis of the time complexity and experiments conducted on 20 benchmarks of binary-state network reliability problems, PBAT was able to efficiently solve medium-scale network reliability problems.
