Research On Dynamic Scheduling Strategy For Mimic Defense

Network technology is widely used in various fields due to its convenience and high efficiency.However,with the deepening of network technology's application,network security issues have become increasingly prominent.Traditional security defense technology can only take measures after a security incident occurs,and strive to prevent the occurrence of similar incidents.But it makes traditional defense techniques very passive that system vulnerabilities throughout the network and network attack patterns are changeable.In order to reverse the passive situation,WU jiang-xing,the Chinese academician,proposes a Game-Change theory for cyber security—the Cyberspace Mimic Defense(CMD)theory.This theory uses dynamic,heterogeneous,and redundant features to build an information system(network environment)to block network attacks from intermediate links,so that attackers cannot exploit vulnerabilities in the system.However,if the dynamic change law in the theory is grasped by the attacker,the security of the corresponding information system will be drastically reduced.This thesis deeply analyzes the function and structure mechanism of mimic defense,and the mechanism of dynamic heterogeneous redundancy construction.According to the problems that various defense mechanism rules of mimetic defense system may be stolen by attackers,the following ideas are proposed to solve this problem.First of all,in characterizing the dynamic nature of dynamic heterogeneous redundant components,random elements are introduced to make the dynamic scheduling strategy decisions random.Then,the performance of individual execution bodies is improved by setting the attributes to detect the functional execution entities.Finally,By analyzing the relationship between randomness,heterogeneity and the security of the mimetic defense system,the autonomous controllability of the system is ensured by introducing a carrier function.Based on the above ideas,this thesis combines the concept of heterogeneous defense and dynamic scheduling in the architecture of mimicry defense,and proposes a new dynamic scheduling strategy-a dynamic scheduling strategy based on normal distribution.This thesis validates the theoretical model through simulation.The simulation results show that the proposed algorithm improves the randomness of heterogeneous redundant components,guarantees the controllability of the mimic defense system,and can effectively prevent the attackers from stealing the various defense mechanisms of system defense.The disadvantage is that this algorithm improves the complexity of the mimetic defense algorithm,which increases the operating overhead of the system.