基于链路重要性的分布式网络可靠性评价方法

Evaluation method for distributed network reliability based on link importance

为了快速有效地评估分布式网络可靠性,针对目前最有效的HRFST算法在搜索最小文件生成树过程中存在的3个问题,提出了一种基于链路重要性的分布式网络可靠性评价方法.该算法以链路重要性为最小文件生成树的首要搜索依据,提高了干路被选中的概率.将改进的网络化简方法用于搜索的每一步,使图更为简化,并消除了对不含文件生成树的子图搜索.分析和实验结果表明,在得到正确可靠性结果的基础上,该算法减少了子图产生数量和分析可靠性的实际执行时间,性能优于其他算法.

In order to estimate the distributed network reliability in a fast and efficient way, focusing on three problems of the most effective HRFST algorithm in searching process of minimal file spanning tree, an evaluation algorithm for distributed network reliability based on the importance of link is proposed. The algorithm takes the link importance as the main rule for the minimal file spanning tree searching to increase the probability of choosing the network backbone. The improved network reduction methods are introduced during each searching step to make the graph simpler and the algorithm eliminates the need to search for the subgraghs which have no file spanning trees. The analysis and experimental results show that, based on the correct reliability results, the algorithm reduces both the number of generated subgraghs and the actual execution time. Therefore, its performance is better than those of other conventional algorithms.