利用因子分解方法计算网络的根通信可靠性
COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD
-
摘要: 本文使用因子分解(factoring)的方法计算网络的根通信可靠性(存在从根点到每一个其它结点正常运行道路的概率)。我们充分利用无圈有向网络的拓扑结构提出了两个新的可靠性保护缩减(Reliability-Preserving Reduction)和一个进行因子分解的选边规则。在此基础上,给出一个因子分解算法(factoring algorithm)。对于不是非常稠密的网络,该算法是非常有效的。Abstract: This paper uses factoring method for computing rooted communication reliability of networks, i.e., the proability that there are operating paths from the root vertex to all other vertices. Two new reliability-preserving reductions and an edge-selection strategy are presented by using the topological structure of acyclic directed networks. Based on that, a factoring algorithm is developed. It is very efficient for networks which are not very dense.
-
Page L B, Perry J E. Reliability of directed networks using the factoring theorem. IEEE Trans on Reliability, 1989, R-38(5): 556-562.[2]Ball M O, Provan J S. Calculating bounds on reachability and connectedness in stochastic net-works. Networks, 1983, 13(2), 253-278.[3]Zhao L C, Kong F J. A new formula and an algorithm for reliability analysis of network. Micro-[4]electron Reliab. 1997, 37(3): 511-518.[5]Satyanarayana A. A unified formula for the analysis of some network reliability problems[J].IEEE Trans on Reliability.1982, R-31(1):23-32[6]Wood R K. Factoring algorithms for computing K-terminal network reliability. IEEE Trans. on Reliability, 1986, R-35(3): 256-278.[7]Theologou O R, Carlier J G. Factoring and reductions for netnrorks with imperfect sertices. IEEE Trans. on Miability1991, R-40(2): 210-217.[8]Colbourn C J. The Combinatorics of Network Reliability. Oxford: Oxford University Press, 1987, 1-100. -
计量
- 文章访问数: 2123
- HTML全文浏览量: 135
- PDF下载量: 645
- 被引次数: 0
下载:
