CAJ | 학술논문

有序二元决策图(OBDD)被广泛用到网络可靠度的计算中，在基于 OBDD 计算网络可靠度时，其计算时间主要取决于参与操作的OBDD的大小，而OBDD的大小严重依赖于OBDD的变量序。该文根据布尔函数的性质和OBDD原理提出一种优化计算网络可靠性的算法(BF-OBDD)，提高计算网络可靠性的效率。实验结果表明改进的算法有较少的 OBDD节点数量，在计算网络可靠性时，花费的时间较少。
유서이원결책도(OBDD)피엄범용도망락가고도적계산중，재기우 OBDD 계산망락가고도시，기계산시간주요취결우삼여조작적OBDD적대소，이OBDD적대소엄중의뢰우OBDD적변량서。해문근거포이함수적성질화OBDD원리제출일충우화계산망락가고성적산법(BF-OBDD)，제고계산망락가고성적효솔。실험결과표명개진적산법유교소적 OBDD절점수량，재계산망락가고성시，화비적시간교소。
Ordered Binary Decision Diagram (OBDD) is commonly used in network reliability calculation. When evaluating the network reliability based on OBDD, computation time mainly depends on the size of the operating OBDD, which mostly relies on the variable ordering of OBDD. An algorithm is called BF-OBDD which is considered as the Boolean Function-OBDD, and it is the optimization algorithm for computing the reliability of the network. This paper shows that the reliability of network can be improved considerably by using of the proposed BF-OBDD algorithm. The experimental results demonstrate that the improved algorithm has less OBDD node numbers which cost less time when calculating the network reliability.