参考文献/References:
[1] YEH W C.A Revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network[J].IEEE Transations on Reliability,1998,47(4):436-442.
[2] IN Yongkun.A Simple algorithm for reliability evaluation of a stochastic-flow network with node failure[J].Computers and Operations Research,2001,28(13):1277-1285.
[3] 骆剑锋,陈俞强.采用环加星型网络结构负载均衡集群技术的云平台设计[J].华侨大学学报(自然科学版),2016,37(2):164-167.
[4] CHEN Run,MO Yong,PAN Zhan.Performance improvement of edge expansion technique for BDD-based network reliability analysis[J].Journal of Computers 2013,8(9):2190-2196.
[5] JHA S,SHEYNER O,WING J M.Two formal analyses of attack graphs[C]//Proceedings of 15th IEEE Computer Security Foundations Workshop.Ottawa:IEEE Press,2002:234-238.
[6] NOEL S,JAJODIA S,O’BERRY B,et al.Efficient minimum-cost network hardening via exploit dependency graphs[C]//Proceedings of 19th Annual Computer Security Applications Conference.Hangzhou:IEEE Press,2003:86-95.
[7] PHILLIPS C,SWILER L.A graph-based system for network vulnerability analysis[C]//Proc of the New Security Paradigms Workshop.Charlottesville:User Evaluation,1998:71-79.
[8] SHEYNER O,HAINES J,JHA S,et al.Automated generation and analysis of attack graphs[C]//Proc of the IEEE Symposm on Security and Privacy.Oakland:IEEE Computer Society Press,2002:254-265.
[9] SHEYNER O.Scenario graphs and attack graphs[D].Pittsburgh:Carnegie Mellon University,2004:256-257.
[10] HOMER J.A comprenhensive approach to enterprise network security management[D].Manhattan:Kansas State University,2008:148-150.
[11] WANG Lingyu,NOEL S,JAJODIA S.Minimum-cost network hardening using attack graphs[J].Computer Communications,2006,29(18):3812-3824.
[12] CHEN Feng,WANG Lingyu,SU Junshang.An efficient approach to minimum-cost network hardening using attack graphs[C]//Proc of the Fourth International Conference on Information Assurance and Security.Tokyo:User Evaluation,2008:209-212.