东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2006, Vol. 27 ›› Issue (7): 751-754.DOI: -

• 论著 • 上一篇    下一篇

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

孙艳蕊;马玉杰;张祥德;   

  1. 东北大学理学院;东北大学理学院;东北大学理学院 辽宁沈阳110004;辽宁沈阳110004;辽宁沈阳110004
  • 收稿日期:2013-06-23 修回日期:2013-06-23 出版日期:2006-07-15 发布日期:2013-06-23
  • 通讯作者: Sun, Y.-R.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60475036);;

Monte carlo method for K-residual connectedness reliability based on reliability preserving reductions

Sun, Yan-Rui (1); Ma, Yu-Jie (1); Zhang, Xiang-De (1)   

  1. (1) School of Sciences, Northeastern University, Shenyang 110004, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2006-07-15 Published:2013-06-23
  • Contact: Sun, Y.-R.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

486

摘要： 讨论了具有不可靠结点网络的可靠度估计问题,提出了具有不可靠结点K-终端网络的串并联缩简原则,并将该缩简原则应用于递归方差衰减(Recursive Variance Reduction,RVR)蒙特卡洛(Monte Carlo)方法中,得到一种无偏且高效的估计可靠度的方法.该方法是依据状态空间分解原理,将对原状态空间的抽样实验递归地转为对其子空间的实验,并且在对子空间抽样实验前进行网络缩简,使得有些子空间不用抽样,对应方差为0.最后,通过实验验证了算法的有效性.

关键词: 网络可靠度, 蒙特卡洛方法, 不可靠结点, 保持可靠度缩简

Abstract: 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.

中图分类号: