• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (9): 26-32.

• 论文 • Previous Articles     Next Articles

Performance Improvement of BDDbased Network Reliability Analysis Algorithm

PAN Zhusheng,MO Yuchang,ZHONG Farong,ZHAO Jianmin   

  1. (School  of Mathematics,Physics and Information Engineering,
    Zhejiang Normal University,Jinhua 321004,China)
  • Received:2012-04-13 Revised:2012-06-28 Online:2012-09-25 Published:2012-09-25

Abstract:

BDD is a diagrammatic representation of the Boolean function and has been widely applied to the network reliability analysis.In order to enhance the performance of network reliability analysis algorithm based on BDD,this paper first puts forward two kinds of invalid edge expansion paths according to the edge expansion diagram instance:invalid edge expansion with redundant nodes and invalid edge expansion with ST unconnectedness.Then,useful techniques are provided to successfully eliminate those invalid edge expansion paths.Experimental results show that these techniques can identify the invalid paths in advance,avoid invalid extension,reduce the number of intermediate subnetworks and shorten the analysis time.With these two techniques,both of the invalid expansion paths can be eliminated,and hence great performance improvement of network reliability analysis is achieved.

Key words: binary decision diagram(BDD);network reliability;edge expansion paths