期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

权为费用的多状态网络可靠度算法

Reliability algorithm of weighted multi-state flow network
下载PDF
导出
摘要 为避免求解多状态网络可靠度的复杂性,通过对多值决策图的结点进行分类,利用直接求解的方式对多状态网络可靠度进行求解。实例计算和分析表明,给出的算法构建的决策图结构精简,求解的可靠度精确性高,利用结点分类的方式直接分析网络的可靠度切实可行。 To avoid the complexity of calculating reliability of multi-state probabilistic network,the nodes of multi-valued decision diagram are classified,a solution is used to calculate the reliability of multi-state network directly.The analyses of application examples show that the proposed algorithm can construct decision diagram concisely and has a high accuracy,reliability calculation of network is practicable by classifying nodes of decision diagram.
作者 刘金林 董荣胜 万芷君
机构地区 桂林电子科技大学计算机科学与工程学院
出处 《桂林电子科技大学学报》 2013年第6期461-465,共5页 Journal of Guilin University of Electronic Technology
基金 广西自然科学基金(0991242)
关键词 多状态加权概率网络 多值决策图(MDD) 网络可靠度 multi-state probabilistic network multi-valued decision diagram network reliability
分类号 TP302.7 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献9

  • 1Terruggia R,Bobbio A. QoS analysis of weighted muhi- state probabilistic networks via decision diagrams l-C3// Computer Safety, Reliability, and Security, Lecture Notes in Computer Science, SAFECOMP, 2010 : 41-54.
  • 2Feo T A,Johnson R. An efficient algorithm for approxi- mating two terminals Reliability on complete graphs [-J-]. IEEE Transaction Reliability, 1990,39(3) :290-295.
  • 3Xing L. Efficientanalysis of systems with multiple states [C//Proc IEEE 21st Int'l Conf,2007.666-672.
  • 4Caneela H. Series parallel reductions in Monte Carlo network reliability evaluation[-J. IEEE Transaction Re- liability, 1998,47(2) : 159-164.
  • 5徐周波,古天龙,赵岭忠.网络最大流问题的一种新的符号ADD求解算法[J].通信学报,2005,26(2):1-8. 被引量：15
  • 6Lee Yizong. Apply binary decision diagram to the quic- kest path problem for system reliability evaluation of the multi-state flow network[D]. Taiwan:National Qing Hua University,2010.
  • 7Arvind S, Timothy K, Sharad M, et al. Algorithms for discrete function manipulation[C]//Proceedings of the IEEE International Conference on Computer-Aided De- sign (ICCAD-90), 1990 : 92-95.
  • 8Bobbio A,Terruggia R. Reliability and quality of serv- ice in weighted probabilistic networks using algebraic decision diagrams[-C]//Proc of the 2009 Annual Relia- bility and Maintainability Symposium, 2009 : 19-4.
  • 9Ball M O, Magnanti T L, Monma C L, et al. Hand Books in Operations Research and Management Sci- ence, Network Models[- M-]. New York: Elsevier, 1995.

二级参考文献15

  • 1TAKAO A, YASUHITO A. Recent developments in maximum flow algorithms[J]. Journal of the Operations Research Society of Japan,2000, 43(1): 2-31.
  • 2FORD L R, FULKERSON D R. Maximum flow through a network[J].Canadian Journal of Math, 1956, 8(5): 399-404.
  • 3DINIC E A. Algorithm for solution of a problem of maximum flow in networks with power estimation[J]. Soviet Math Dokl, 1970, 11(8):1277-1280.
  • 4KARZANOV A V. Determining the maximum flow in a network by the method of preflows[J]. Soviet Math Dokl, 1974, 15(3): 434-437.
  • 5GOLDBERG A V, TARJAN R E. A new approach to the maximum flow problem[J]. Journal of the Association for Computing Machinery,1988, 35(4): 921-940.
  • 6GOLDBERG A V, RAO S. Beyond the flow decomposition barrier[J].Journal of the Association for Computing Machinery, 1998, 45(5):783-797.
  • 7TAR JAN R E. A simple version of Karzanov's blocking flow algorithm[J]. Operations Research Letters, 1984, 2(6): 265-268.
  • 8TRAFF J L. A heuristic for blocking flow algorithms[J]. European Journal of Operational Research, 1996, 89(3): 564-569.
  • 9BRYANT R E. Graph-based algorithms for Boolean function manipulation[J]. IEEE Transaction on Computer, 1986, 35(8):677-691.
  • 10HACHTEL G D, SOMENZI F. A symbolic algorithm for maximum flow in 0-1 networks[J]. Formal Methods in System Design,1997,10(2/3): 207-219.

共引文献14

桂林电子科技大学学报
2013年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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