Rough Network Security Analysis Model Based on Dynamic Game
Jin Zhang · Jisuanji gongcheng · 2015
Now the network security evaluation method based on attack graph becomes the main research point,but most of the netw ork attack models are analyzed from the standpoint of the attack side,and ignore the w hole process of the connection relationship betw een offensive and defensive and the roughness of the know ledge system. This paper uses the rough access components association graph to describe the rough access relationship among the netw ork components at some time and some special netw ork topology state,through the rough characterization of the attack and defense policy set in the know ledge domain space to reflect the dynamic decision-making mechanism in the process of offensive and defensive. It gives the optimal attack policy-selection algorithm simultaneously,points out the most possible defensive policy in the current state of the netw ork connection and the know ledge level of both sides of offensive and defensive.Examples show that the results of the analysis can help the defense side of the netw ork administrator take related defensive measures better.