摘要
在已有结果的基础上,提出了一种利用二元判决图计算网络可靠度的方法.该方法将网络的最小路集用二元判决图来表示,并得到最小路集的不交和,最后获得网络的可靠度.与其他方法比较,该方法所用的二元判决图的规模较小,并且可以计算出在不同故障率条件下、不同时间长度下的网络可靠度.
The network reliability is an important parameter in evaluating the performance of a communication network. A new algorithm of computing network reliability by using binary decision diagrams(BDD) is presented. The algorithm can get a much simpler BDD diagram than the past algorithms, and can reduce the complexity of the algorithm efficiently. The networks reliability is also obtained by changing the time and the fault rate.
出处
《华南师范大学学报（自然科学版）》
CAS
2004年第3期53-58,共6页
Journal of South China Normal University(Natural Science Edition)
基金
国家自然科学基金资助项目(60006002)
关键词
二元判决图
网络可靠度
最小路集
不交和
BDD
binary decision diagram
networks reliability
least - path-collection
sum of disjoint products
