COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD

Kong Fanjia; Wang Guangxing; Zhang Xiangde

Volume 21 Issue 3

May 1999

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1999 > 21(3): 379-383

Kong Fanjia, Wang Guangxing, Zhang Xiangde. COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD[J]. Journal of Electronics & Information Technology, 1999, 21(3): 379-383.

Citation:

Kong Fanjia, Wang Guangxing, Zhang Xiangde. COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD[J]. Journal of Electronics & Information Technology, 1999, 21(3): 379-383.

Kong Fanjia, Wang Guangxing, Zhang Xiangde. COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD[J]. Journal of Electronics & Information Technology, 1999, 21(3): 379-383.

Citation:

Kong Fanjia, Wang Guangxing, Zhang Xiangde. COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD[J]. Journal of Electronics & Information Technology, 1999, 21(3): 379-383.

PDF( 578 KB)

COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD

Received Date: 1997-11-26
Rev Recd Date: 1998-10-14
Publish Date: 1999-05-19

Abstract

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.

FullText(HTML)

References(1)

References

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.

Relative Articles

Supplements(0)

Cited By

Proportional views