层次化分类淘汰法的网络最优弥补模型

针对求解最优弥补的特点和需求,利用层次化分类淘汰,提出一种基于层次化分类淘汰法的最优弥补模型(HSE-ONHM),得到最优弥补的精确解.为了验证HSE-ONHM的可行性和有效性,分别采取穷举法和层次化淘汰算法求解同一目标网络环境的最优弥补.实验结果表明:无论是淘汰次数还是CPU消耗时间,层次化分类淘汰法比穷举法优越;层次化分类淘汰法的计算时间随着初始属性节点数量呈指数增加,该实验结果与算法性能分析结果一致.

Optimal Network Hardening Model Based on Hierarchical Classification Elimination

This paper considers the characteristics and requirement of solving the optimal hardening problem. A new optimal network hardening model based on hierarchical separatal elimination(HSE-ONHM)is proposed and accurate solution for optimal hardening is got. In order to verify the feasibility and effectiveness of the model, the optimal exhaustive method and hierarchical algorithm is taken for elimination of the same target for network environment. Experimental results show that either eliminated or the number of CPU time consuming, HSE-ONHM is superior. The computation time of HSE-ONHM with initial attribute node increases exponentially with the number. The experimental results are consistent with the performance analysis of the algorithm.