| 一种大规模网络端端可靠度上下界的快速计算方法 |
| |
| 引用本文： | 尹星.一种大规模网络端端可靠度上下界的快速计算方法[J].科学技术与工程,2012,12(32):8513-8517,8526. |
| |
| 作者姓名： | 尹星 |
| |
| 作者单位： | 国防科技大学信息系统与管理学院,长沙,410073 |
| |
| 基金项目： | 国家自然科学基金项目（） |
| |
| 摘 要： | 在网络可靠性研究的基础上,针对大规模网络中精确计算端端可靠度这一难题,提出了一种快速计算大规模网络端端可靠度上下界的方法。算法分别基于最小割集和最小路径计算端端可靠度的上界和下界。最后通过算例分析,验证了本文所提出算法的有效性。
|
| 关 键 词： | 最小路径 最小割集 端端可靠度 |
| 收稿时间： | 2012/7/12 0:00:00 |
| 修稿时间： | 2012/7/13 0:00:00 |
An Algorithm for Fast Computation of Large-scale Network Reliability Bounds |
| |
| yinxing.An Algorithm for Fast Computation of Large-scale Network Reliability Bounds[J].Science Technology and Engineering,2012,12(32):8513-8517,8526. |
| |
| Authors: | yinxing |
| |
| Institution: | (College of Information System and Management,National University of Defense Technology,Changsha 410073,P.R.China) |
| |
| Abstract: | In this paper, based on the research of network reliability, because the exact computation of two-terminal reliability is NP-complete, an algorithm for the fast computation of large-scale network reliability bounds is proposed. The proposed algorithm is based on mincuts and minpaths to compute upper and lower bounds. At last, an example of regional communication network is presented to compare the exact computation of two-terminal reliability, the result is satisfied. Furthermore, compared to the algorithm presented in 16], the proposed algorithm is proved to be efficient. |
| |
| Keywords: | minpath mincut two-terminal reliability |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
|
