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