基于Markov时间博弈的移动目标防御最优策略选取方法

Optimal strategy selection approach of moving target defense based on Markov time game

针对现有博弈模型难以有效建模网络攻防对抗动态连续特性的问题,提出了一种基于Markov时间博弈的移动目标防御最优策略选取方法。在分析移动目标攻防对抗过程的基础上,构建了移动目标攻防策略集合,利用时间博弈刻画了单阶段移动目标防御过程的动态性,利用Markov决策过程描述了多阶段移动目标防御状态转化的随机性。同时,将攻防双方对资源脆弱性抽象为对攻击面控制权的交替,从而有效保证了博弈模型的通用性。在此基础上,分析并证明了均衡的存在性,设计了最优策略选取算法。最后,通过应用实例验证了所提模型的实用性和算法的有效性。

For the problem that the existed game model was challenging to model the dynamic continuous characteristics of network attack and defense confrontation effectively, a method based on Markov time game was proposed to select the optimal strategy for moving target defense. Based on the analysis of the attack and defense confrontation process of moving targets, the set of moving target attack and defense strategies was constructed. The dynamics of the single-stage moving target defense process was described by time game. The randomness of multi-stage moving target defense state transformation was described by Markov decision process. At the same time, by abstracting the use of resource vulnerability by attack-defense participants as the alternation of the control of the attack surface, the versatility of the game model was effectively guaranteed. On this basis, the existence of equilibrium was analyzed and proved, and the optimal strategy selection algorithm was designed. Finally, the practicality of the constructed model and the effectiveness of the algorithm are verified by an application example.