利用因子分解方法計(jì)算網(wǎng)絡(luò)的根通信可靠性
COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD
-
摘要: 本文使用因子分解(factoring)的方法計(jì)算網(wǎng)絡(luò)的根通信可靠性(存在從根點(diǎn)到每一個(gè)其它結(jié)點(diǎn)正常運(yùn)行道路的概率)。我們充分利用無(wú)圈有向網(wǎng)絡(luò)的拓?fù)浣Y(jié)構(gòu)提出了兩個(gè)新的可靠性保護(hù)縮減(Reliability-Preserving Reduction)和一個(gè)進(jìn)行因子分解的選邊規(guī)則。在此基礎(chǔ)上,給出一個(gè)因子分解算法(factoring algorithm)。對(duì)于不是非常稠密的網(wǎng)絡(luò),該算法是非常有效的。
-
關(guān)鍵詞:
- 網(wǎng)絡(luò)可靠性; 因子分解算法; 可靠性保護(hù)縮減
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. -
計(jì)量
- 文章訪問數(shù): 2154
- HTML全文瀏覽量: 145
- PDF下載量: 648
- 被引次數(shù): 0
下載:
