摘要
拟态安全防御的一个关键环节是异构功能等价体的调度,现有的调度策略缺乏对冗余体间相似度的考虑,且调度算法较为单一。基于此,提出了一种兼顾动态性和可靠性的异构功能等价体调度算法——随机种子最小相似度算法,首先随机确定种子冗余体,然后再根据相似度指标选择整体相似度最小的最终调度方案。理论分析和仿真实验表明,该算法的调度周期远高于最长相异性距离算法,而失效率远低于随机调度算法,在动态性和可靠性之间达到了较好的平衡。
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.
作者
刘勤让
林森杰
顾泽宇
LIU Qinrang;LIN Senjie;GU Zeyu(National Digital Switching System Engineering and Technological Research Center,Zhengzhou 450001,China)
出处
《通信学报》
EI
CSCD
北大核心
2018年第7期188-198,共11页
Journal on Communications
基金
国家自然科学基金资助项目(No.61572520
No.61521003)
上海市科研计划基金资助项目(No.14DZ1104800)~~
关键词
拟态安全防御
异构冗余调度
相似度
随机种子
mimic security defense
heterogeneous redundancies scheduling
similarity
random seed
