论文部分内容阅读
网络可靠度的计算和任意失效树概率的计算一样,都是NP问题,即其计算量随网络或失效树的规模成指数增长。现有的计算方法大多比较复杂、繁琐、需要编成算法,借助于电子计算机运算。本文介绍一种通过建造树来直接求得网络成功的不交型路集,从而计算网络可靠度的方法。此法比较直观、简便易行,按照一定的规则可以方便地找出不交型表达式。这一方法可用于人造卫星分系统的可靠性分析和通信网络、交通网络的可靠度计算。
The calculation of network reliability is the same as the calculation of the probability of any failure tree, which is an NP problem. That is to say, its calculation amount increases exponentially with the size of the network or the failure tree. Most of the existing calculation methods are complicated and cumbersome, and need to be compiled into algorithms, with the help of computer operations. This article presents a method of calculating network reliability by building a tree that directly determines the network’s successful non-intersecting set of paths. This method is more intuitive, simple and easy, in accordance with certain rules can easily find the non-intersecting expression. This method can be used for the reliability analysis of artificial satellite subsystems and the reliability calculation of communication networks and traffic networks.