通信学报 ›› 2015, Vol. 36 ›› Issue (1): 237-245.doi: 10.11959/j.issn.1000-436x.2015027

• 学术通信 • 上一篇    

基于随机松弛优选策略的网络脆弱性弥补算法

赵光胜1,程庆丰1,孙永林2   

  1. 1 解放军外国语学院 语言工程系,河南 洛阳 471003
    2 国防科技大学 计算机学院,湖南 长沙 410073
  • 出版日期:2015-01-25 发布日期:2017-06-21
  • 基金资助:
    国家高技术研究发展计划(“863”计划)基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;信息保障技术重点实验室开放基金资助项目

Minimum-cost network hardening algorithm based on stochastic loose optimize strategy

Guang-sheng ZHAO1,Qing-feng CHENG1,Yong-lin SUN2   

  1. 1 Department of Language Engineering,PLA University of Foreign Languages,Luoyang 471003,China
    2 College of Computer Science,National University of Defense Technology,Changsha 410073,China
  • Online:2015-01-25 Published:2017-06-21
  • Supported by:
    The National High Technology Research and Development Program of China (863 Program);The National Natural Science Foundation of China;The National Natural Science Foundation of China;Foundation of Science and Technology on Information Assurance Laboratory

摘要:

为了在大规模网络中构建代价最小的脆弱性弥补方案,提出了一种基于随机松弛优选策略的网络脆弱性弥补算法 (MCNHA-SLOS),并分析了算法的有效性。MCNHA-SLOS 是一种近似最优算法,通过在全部弥补方案空间的一系列随机松弛子空间中进行迭代计算,使近似最优弥补方案必定落入低代价弥补方案空间中。实例分析和仿真结果表明,MCNHA-SLOS具有高效、精度可控、渐近最优等特点,能够应用于大规模网络环境。

关键词: 网络脆弱性, 攻击图, 网络脆弱性弥补, 随机松弛优选

Abstract:

To construst a minimum-cost network hardening (MCNH) scheme in large-scale network,a stochastic loose optimize strategy based algorithm (MCNHA-SLOS) was proposed,and its effectiveness was analyzed.MCNHA-SLOS was a near-optimal approximation algorithm,which could achieve iterative computations in the array of sparse spaces of the whole plan space,so that the near-optimal scheme must exist in the low cost plan space.Instantiation analysis and experimental results show that the MCNHA-SLOS algorithm to be efficient,precision controllable and asymptotically optimal,and thus very applicable for large-scale network.

Key words: network vulnerability, attack graph, minimum-cost network hardening, stochastic loose optimize strategy