摘要
提出一个计算从网络源点到某些特定结点(SKT)可靠性算法.这个算法本质上是通过系统地枚举网络的一类特殊子网络而计算其SKT可靠性或生成可靠性表达式.由于所需枚举的子网络数量小于相应的Satyanarayana算法需枚举的子网络数量,因此新算法性能优于Satyanarayana算法.最后通过一个具体例子说明了这个结论.
An algorithm for computing reliability of networks from source to some specified nodes is presented. The algorithm computes SKT reliability or produces a SKT reliability expression by enumerating a class of special subnetworks of the given network. Because the number of this class of subnetworks which need to be enumerated is relatively small,the new algorithms performance is better than the corresponding Satyanarayanas algorithm. Finally,an example illustrates the conclusion.
出处
《东北大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
1998年第4期335-337,共3页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金
关键词
网络
可靠性
算法
networks,reliability,algorithm.