摘要
在网络可靠性研究的基础上,针对大规模网络中精确计算端端可靠度这一难题,提出了一种快速计算大规模网络端端可靠度上下界的方法。算法分别基于最小割集和最小路径计算端端可靠度的上界和下界。最后通过算例分析,验证了本文所提出算法的有效性。
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, example analysis result shows the efficiency of our algorithm.
出处
《科学技术与工程》
北大核心
2012年第32期8513-8517,8526,共6页
Science Technology and Engineering
基金
自然科学基金(71031007)资助
