A Dynamic Scheduling Algorithm Based on Endogenous Security

Abstract

Endogenous security enables the network to have its own immunity against various known and unknown attacks. The redundant executive scheduling strategy is an important link, which determines the security and reliability of the architecture. The existing scheduling strategy lacks consideration of scheduling time and the number of executors, and does not flexibly utilize attack feedback information. They are relatively simple and lack of security to a certain extent. Based on this, this paper proposes a dynamic scheduling algorithm by introducing the consideration of scheduling attributes and historical attack information. Firstly, a scheduling trigger based on the joint control of working time and abnormal feedback is designed. Then, the dynamic calculation formulas under different attack scenarios are constructed by using historical attack feedback information. Finally, a complete scheduling scheme is proposed. Experiments show that the dynamic performance of the algorithm is better than the fixed strategy. In addition, the algorithm improves the utilization of the actuator and achieves a good balance between reliability and efficiency.