期刊文献+

基于网络缩简的K-剩余连通可靠度的蒙特卡洛方法 被引量:2

Monte Carlo Method for K-Residual Connectedness Reliability Based on Reliability Preserving Reductions
下载PDF
导出
摘要 讨论了具有不可靠结点网络的可靠度估计问题,提出了具有不可靠结点K-终端网络的串并联缩简原则,并将该缩简原则应用于递归方差衰减(Recursive Variance Reduction,RVR)蒙特卡洛(Monte Carlo)方法中,得到一种无偏且高效的估计可靠度的方法.该方法是依据状态空间分解原理,将对原状态空间的抽样实验递归地转为对其子空间的实验,并且在对子空间抽样实验前进行网络缩简,使得有些子空间不用抽样,对应方差为0.最后,通过实验验证了算法的有效性. Discusses the estimate of reliability of a network with unreliable nodes. Proposes the principle on which the reduction is available to the K-terminal networks with unreliable nodes in series/parallel. Applying the principle to the Monte Carlo method with RVR (recursive variance reduction), an unbiased and efficient reliability estimating method is obtained, which depends on the decomposition of state space and reduces recursively the sampling test in original state space to that in subspace. Before the sampling test in subspace, reliability preserving reductions are performed so as to enable some sampling action not to be done in subspace with corresponding variance to be 0. The validity of the algorithm is verified by testing results.
机构地区 东北大学理学院
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2006年第7期751-754,共4页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目(60475036) 国家博士后基金资助项目(2003033372)
关键词 网络可靠度 蒙特卡洛方法 不可靠结点 保持可靠度缩简 network reliability Monte Carlo method unreliable nodes reliability preserving reductions
  • 相关文献

参考文献12

  • 1Colbourn C J.The combinatorics of network reliability[M].New York:Oxford University Press,1987.1-40.
  • 2刘普寅,张维明.通信网络可靠性研究中的数学问题[J].通信学报,2000,21(10):50-57. 被引量:32
  • 3Manzi E,Labbe M.Fishman's sampling plan for computing network reliability[J].IEEE Transaction on Reliability,2001,50(1):41-46.
  • 4Fishman G S.Estimation the s-t reliability function using importance and stratified sampling[J].Operation Research,1989,37(4):462-473.
  • 5Fishman G S.A comparison of four Monte Carlo method for estimating the probability of s-t connectedness[J].IEEE Transaction on Reliability,1986,35(2):145-155.
  • 6Cancela H,Khadiri M E.The recursive variance-reduction simulation algorithm for network reliability evaluation[J].IEEE Transcation on Reliability,2003,52(2):207-212.
  • 7Cancela H,Khadiri M E.A recursive variance-reduction algorithm for estimating communication-network reliability[J].IEEE Transaction on Reliability,1995,44(5):599-602.
  • 8Cancela H,Khadiri M E.Series-parallel reductions in Monte Carlo network-reliability evaluation[J].IEEE Transactions on Reliability,1998,47(2):159-164.
  • 9Cancela H,Urquhart M E.Adapting RVR simulation techniques for residual connectedness network reliability models[J].IEEE Transactions on Computers,2002,51(4):439-443.
  • 10王芳,侯朝桢.一种估计网络可靠性的蒙特卡洛方法[J].计算机工程,2004,30(18):13-15. 被引量:6

二级参考文献16

  • 1江光杰,李德毅.通信网络的可靠性评估[J].通信学报,1997,18(8):85-89. 被引量:19
  • 2孔繁甲,东北大学学报,1998年,19卷,5期,492页
  • 3Cheng C S,Microelectron Reliability,1998年,38卷,345页
  • 4刘普寅,模糊理论及其应用,1998年
  • 5陈国良,遗传算法及其应用,1996年
  • 6Chen S M,Fuzzy Sets Systems,1994年,64卷,31页
  • 7Mon DL,Fuzzy Sets Systems,1994年,64卷,145页
  • 8Cheng C H,Fuzzy Sets Systems,1993年,56卷,29页
  • 9Cancela H,Khadiri M E.A Recursive Variance-reduction Algorithm for Estimating Communication-network Reliability [J].IEEE Transaction on Reliability,1995,44:599-602
  • 10Bulteau S,Khadiri M E.A Monte Carlo Simulation of the Flow Network Reliability Using Importance and Stratified Sampling.Technical Report PI 1087,I.R.I.S.A.,1997

共引文献37

同被引文献10

  • 1Colboum C J. The combinatories of network reliability[ M ]. New York: Oxford University Press, 1987:10- 100.
  • 2Hui K P. Monte Carlo network reliability ranking estimation [J]. IEEE Transactions on Reliability, 2007, 56 ( 1 ) : 50 - 57.
  • 3Rai S, Veeraraghavan M, Trlvedi K S. A survey of efficient reliability computation using disjoint products approach [J ]. Networks, 1995,25(1):147-163.
  • 4Hardy G, Lucet C, Limnios N. K-temlinal network reliability measures with binary decision diagrams [ J ]. IEEE Transactions on Reliability, 2007,56 ( 3 ) : 506 - 515.
  • 5Provan J S, Ball M O. The complexity of counting cuts and of computing the probability that a graph is connected[J]. SIAM Journal on Computing, 1983,12:777 788.
  • 6Agrawal A, Satyanarayana A. Network reliability analysis using 2-connected digraph reductions [J]. Networks, 1985,15 (2) :239-254.
  • 7孔繁甲,王光兴,张祥德.计算两类网络的可靠性的多项式时间算法[J].软件学报,1999,10(3):324-326. 被引量:1
  • 8孔繁甲,王光兴,张祥德.利用因子分解方法计算网络的根通信可靠性[J].电子科学学刊,1999,21(3):379-383. 被引量:2
  • 9吴俊,段东立,赵娟,李俊,邓宏钟,谭跃进.网络系统可靠性研究现状与展望[J].复杂系统与复杂性科学,2011,8(2):77-86. 被引量:34
  • 10谭跃进,赵娟,吴俊,邓宏钟,段东立.基于路径的网络可靠性研究综述[J].系统工程理论与实践,2012,32(12):2724-2730. 被引量:14

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部