Journal on Communications ›› 2018, Vol. 39 ›› Issue (7): 188-198.doi: 10.11959/j.issn.1000-436x.2018124

• Correspondences • Previous Articles    

Heterogeneous redundancies scheduling algorithm for mimic security defense

Qinrang LIU,Senjie LIN,Zeyu GU   

  1. National Digital Switching System Engineering and Technological Research Center,Zhengzhou 450001,China
  • Revised:2018-03-29 Online:2018-07-01 Published:2018-08-08
  • Supported by:
    The National Natural Science Foundation of China(61572520);The National Natural Science Foundation of China(61521003);Shanghai Research Project(14DZ1104800)

Abstract:

The scheduling of heterogeneous redundancies is one of the key lines of mimic security defense,but the existing scheduling strategies are lack of consideration about the similarity among redundancies and the scheduling algorithms are incomprehensive.A new scheduling algorithm called random seed & minimum similarity (RSMS) algorithm was proposed,which combined dynamics and reliability by determining a scheduling scheme with minimum global-similarity after choosing a seed-redundancy randomly.Theoretical analysis and simulation results show that RSMS algorithm possessed a far longer scheduling cycle than maximum dissimilarity algorithm,as well as a far lower failure rate than random scheduling algorithm,which represents an effective balance between dynamics and reliability.

Key words: mimic security defense, heterogeneous redundancies scheduling, similarity, random seed

CLC Number: 

No Suggested Reading articles found!