Mimic Scoring Voting Algorithm Based on Historical Confidence and Heterogeneity

Abstract

Cyberspace mimic defense technology uses dynamic heterogeneous redundancy (DHR) architecture to improve system security. DHR architecture contains scheduling, voting, and feedback algorithms. The voting algorithm of the voting unit plays a crucial role in the overall security performance of the mimic defense system. A good voting algorithm can significantly improve the security of the whole system. Because of this, our paper optimizes the existing mimic defense voting algorithm by adding the heterogeneity and historical confidence among executors as decision factors in the heterogeneous executor voting algorithm, which reduces the probability of the common-mode escape problem that is prone to occur in the classical voting algorithm. Through simulation experiments, the results show that compared with traditional algorithms, this algorithm can significantly improve the safety performance of mimic defense systems and effectively reduce the risk of common-mode escape. Even when the number of scheduled executors is small, the algorithm performance is still very good, so good security can be achieved under a low load.