摘要
提出计算无线通信网络从源点到汇点 (ST)可靠性的一个新拓扑公式。该公式本质上是将容斥原理公式和不交和公式融合在一起 ,公式中各项和网络的一类特殊子网络一一对应 ,与相应的Satyanarayanna公式比较 ,该公式包含更少的项和更少的算术运算。提出一个计算从网络源点到汇点 (ST)可靠性算法。这个算法本质上是通过系统地枚举网络的一类特殊子网络而计算其ST可靠性或生成可靠性表达式。由于所需枚举的子网络数量小于相应的Satyanarayanna算法需枚举的子网络数量 ,因此新算法性能优于Satyanarayanna算法。最后通过一个具体例子说明了这个结论。
A new topological formula for computing ST reliability of radio-communication networks (RCN) from sources to terminals is presented. Combining Inclusion Exclusion principle with disjoint sum of products formula,the new formula contains terms which correspond one by one to a class of special subnetworks. For a given network,terms of the new formula are fewer than those corresponding Satyaranayanna formula.An algorithm for computing ST reliability is presented. It computes ST reliability or produces a ST reliability expression by enumerating a class of special subnetworks of given networks. Because the number of this class of subnetworks needed to be enumerated is relatively small,the new algorithm's performance is better than Satyaranayanna's algorithm.Finally an example illustrates the conclusion.
出处
《计算机应用》
CSCD
北大核心
2004年第1期25-28,共4页
journal of Computer Applications
基金
国家自然科学基金资助项目 (699730 1 1 )
关键词
算法
可靠性
可靠性表达式
容斥原理
无线通信网络
algorithm
reliability
reliability expression
inclusion exclusion principle
radio-communication network
