| 基于最小路集的网络可靠性分析方法研究 |
| |
| 引用本文： | 高会生,展敬宇,王博颖. 基于最小路集的网络可靠性分析方法研究[J]. 信息网络安全, 2011, 0(10): 28-31. DOI: 10.3969/j.issn.1671-1122.2011.10.011 |
| |
| 作者姓名： | 高会生 展敬宇 王博颖 |
| |
| 作者单位： | 华北电力大学,河北,保定,071003 |
| |
| 摘 要： | 基于最小路集的网络可靠性分析方法是研究网络可靠度的重要算法之一,研究表明,在最小路集基础上求解网络可靠性是一个典型的NP-hard问题,其主要计算方法有三类：容斥原理法、不交积和法以及二叉决策图法。该文重点阐述了这三类计算方法的研究进展,并对其进行总结,对网络可靠性的未来发展方向进行了展望。
|
| 关 键 词： | 网络可靠性 最小路集 容斥原理 不交积和 二元决策图 |
Review of the Path-based Algorithm on Network Reliability |
| |
| GAO Hui-sheng,ZHAN Jing-yu,WANG Bo-ying. Review of the Path-based Algorithm on Network Reliability[J]. Netinfo Security, 2011, 0(10): 28-31. DOI: 10.3969/j.issn.1671-1122.2011.10.011 |
| |
| Authors: | GAO Hui-sheng ZHAN Jing-yu WANG Bo-ying |
| |
| Affiliation: | (North China Electric Power University,Baoding Hebei 071003,China) |
| |
| Abstract: | The path-based algorithm is one of the important algorithms in computing the network reliability.The study shows that the evaluation of network reliability based on minimal path is a typical NP-hard problem.It includes three branches：inclusion-exclusion,sum of disjoint products and binary decision diagrams.This paper mainly reviews these three algorithms.Finally,this survey concludes these three algorithms and presents the prospects of network reliability. |
| |
| Keywords: | network reliability minimal path inclusion-exclusion disjoint algorithm BDD |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
