Optimal Strategy of Moving Target Defense Based on Differential Game
-
摘要: 目前，针对移动目标防御最优策略研究大多采用经典单/多阶段博弈和Markov博弈模型，无法在连续实时网络攻防对抗中进行灵活决策.为实现实时选取最优移动目标防御策略，在研究节点级传染病模型与微分博弈理论的基础上，提出了一种移动目标防御微分博弈模型，对网络空间重要节点构造安全状态演化方程与攻防收益目标函数，并设计开环纳什均衡求解算法以得出最优防御策略.仿真结果表明，该方法可有效对网络攻击进行实时防御，并且可针对网络关键节点制定相应移动目标防御策略.Abstract: Easy to attack and difficult to defend is one of the core issues on network security. Moving target defense is a key technology to enhance network defense capabilities and ensure cyberspace security. At present, most studies on the optimal defense strategy for moving targets defense adopt the classic single/multi-stage game model and Markov game model, which cannot make flexible decisions in continuous real-time network attack and defense confrontation. In order to achieve the real-time selection of the optimal moving target defense strategy, this paper considers that the interdependence between the microscopic individual behavior and the macroscopic communication phenomenon in the network will have impact on the network’s offensive and defense decisions. Based on the research on node-level infectious disease model and differential game theory, a differential game model for moving target defense is proposed. The security state evolution equation and the objective function of offensive and defensive gains are constructed for important nodes in cyberspace. And the open-loop Nash equilibrium solution algorithm is designed to obtain the optimal defense strategy. The simulation results show that this method can effectively defend against network attacks in real-time and can make moving target defense decisions for key network nodes. Finally, based on the experimental results, key recommendations are put forward for the defense of important nodes in the network system.
-
计量
- 文章访问数: 497
- HTML全文浏览量: 3
- PDF下载量: 183
下载:
