首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于网络缩简的K-剩余连通可靠度的蒙特卡洛方法
引用本文:孙艳蕊,马玉杰,张祥德.基于网络缩简的K-剩余连通可靠度的蒙特卡洛方法[J].东北大学学报(自然科学版),2006,27(7):751-754.
作者姓名:孙艳蕊  马玉杰  张祥德
作者单位:东北大学,理学院,辽宁,沈阳,110004
基金项目:国家自然科学基金,中国博士后科学基金
摘    要:讨论了具有不可靠结点网络的可靠度估计问题,提出了具有不可靠结点K-终端网络的串并联缩简原则,并将该缩简原则应用于递归方差衰减(Recursive Variance Reduction,RVR)蒙特卡洛(Monte Carlo)方法中,得到一种无偏且高效的估计可靠度的方法.该方法是依据状态空间分解原理,将对原状态空间的抽样实验递归地转为对其子空间的实验,并且在对子空间抽样实验前进行网络缩简,使得有些子空间不用抽样,对应方差为0.最后,通过实验验证了算法的有效性.

关 键 词:网络可靠度  蒙特卡洛方法  不可靠结点  保持可靠度缩简  
文章编号:1005-3026(2006)07-0751-04
收稿时间:2005-08-30
修稿时间:2005年8月30日

Monte Carlo Method for K-Residual Connectedness Reliability Based on Reliability Preserving Reductions
SUN Yan-rui,MA Yü-jie,ZHANG Xiang-de.Monte Carlo Method for K-Residual Connectedness Reliability Based on Reliability Preserving Reductions[J].Journal of Northeastern University(Natural Science),2006,27(7):751-754.
Authors:SUN Yan-rui  MA Yü-jie  ZHANG Xiang-de
Institution:School of Sciences, Northeastern University, Shenyang 110004, China.
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.
Keywords:network reliability  Monte Carlo method  unreliable nodes  reliability preserving reductions
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《东北大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号