Heterogeneous Executors Scheduling Algorithm for Mimic Defense Systems

Abstract

A key aspect of the mimetic defense system is the scheduling of heterogeneous executions to ensure that the system is dynamic. The existing scheduling strategy only performs random scheduling to satisfy heterogeneity and service quality. Combined with the historical information of the arbiter in the mimicry defense system, this paper proposed a random seed scheduling algorithm based on historical confidence for maximum heterogeneity and quality of service. First, the seed performer is randomly selected in the historical confidence executor that satisfies the threshold, and then the scheduling scheme is determined according to the maximum heterogeneity type and the quality of service indicator. The simulation results showed that the scheduling period of the algorithm is lower than the random scheduling algorithm. However, the scheduling effect is higher than the random scheduling algorithm, which achieved a good dynamic balance between dynamics, security, and quality of service.