Optimal Network Hardening Model Based on Parallel Genetic Algorithm

摘要：

Because the existed approaches to harden networks have an unavoidable exponential worse-case complexity,and are not scalable to large networks,this paper proposes an optimal network hardening model (ONHM) based on parallel genetic algorithm by combining attack graphs and parallel genetic algorithm. Firstly,we describe the optimal network hardening problem;secondly,we establish a corresponding mathematical model,which converts the optimal network hardening problem to a non-restraint optimization problem with penalty. Through a large number of repeated laboratory tests,the experimental results show ONHM can find the optimal network hardening,and can be applied to large-scale networks.

关键词： network security vulnerability attack graphs optimal network hardening parallel genetic algorithm

作者: Ma Jun-chun Sun Ji-yin

作者单位: 402 Staff the Second Artillery Engineering Institute,Xian,710025,China

会议类型: 国际会议

会议名称: 2011 International Conference on Opto-Electronics Engineering and Information Science(2011光电电子工程与信息科学国际会议 ICOEIS 2011)

会议地点: 西安

会议语种:英文

页码: 2263-2267

在线出版日期: 2011-12-23（万方平台首次上网日期，不代表论文的发表时间）