考虑节点与边失效的网络全端可靠性上界拓展算法

An Extended upper Bound of All-terminal Reliability Considering both Edge and Node Failures

拓展了Jan R H的网络全端可靠性上界。根据网络失效类型(节点自身失效与边失效造成节点孤立的两类网络系统失效状态),给出了节点与边均不可靠的网络系统全端可靠性上界的计算方法。在多项式时间内,该上界计算精度较以往的一个上界算法有显著提高。该上界适用于交通网络、ER随机网络、BA无标度网络等不同网络结构的可靠性评价与可靠性设计。

Jan R. H. ＇ s upper bound for all-terminal network reliability was extended to networks with both un-reliable edges and unreliable nodes. Considering two kinds of typical network failures, node failures in the network and edge failures leading to separating individual nodes from network, the extended upper bound can be calculated in polynomial time, and more importantly, it is shown that the new bound yields statistically better results than a previously published bound. Furthermore, this upper bound is applicable to different types of network topology such as transportation network, random network and scale-free network for the purpose of network evaluating and desig-ning.