Computer Science ›› 2021, Vol. 48 ›› Issue (8): 284-290.doi: 10.11896/jsjkx.200900059

• Information Security • Previous Articles     Next Articles

FAWA:A Negative Feedback Dynamic Scheduling Algorithm for Heterogeneous Executor

YANG Lin, WANG Yong-jie, ZHANG Jun   

  1. College of Electromagnetic Countermeasure,National University of Defense Technology,Hefei 230037,China;Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation,Hefei 230037,China
  • Received:2020-09-07 Revised:2020-10-29 Published:2021-08-10
  • About author:YANG Lin,born in 1995,postgraduate,is a member of China Computer Federation.His main research interests include cyberspace security,network security situational awareness and swarm intelligence.(yanglin0815@nudt.edu.cn)WANG Yong-jie,born in 1974,Ph.D,associate professor.His main research interests include cyberspace security,risk assessment and information system modeling and simulation.
  • Supported by:
    National Natural Science Foundation of China(61802422).

Abstract: As a new cyber defense method,the mimic defense has an excellent defense effect due to its unpredictable characteristics.Heterogeneous executors are heterogeneous components composed of various defense strategies to mimic defense.The mimic defense mechanism obtains the dynamics of defense through the dynamic scheduling of heterogeneous executors.Traditional scheduling methods have certain limitations.Because of these limitations,comprehensively considering the comprehensiveness of defense and historical defense success rate information,a new dynamic scheduling algorithm FAWA with negative feedback capability is proposed,and simulation collision experiments are designed.The network attack and defense process are compared with the defense effects of other scheduling methods.The experimental results show that in the scenario where the attacker randomly loads the attack load,the scheduling effect of the FAWA algorithm is always better than other algorithms,which can well improve the defense success.In the scenario where the attacker also adopts negative feedback loading,the scheduling effect of the FAWA algorithm is better than that of the CRA algorithm and some improved dynamic artificial weighting algorithms but weaker than FIFO.Besides,the simulation experiment compares the two types of load loading scenarios of the attacker and finds that in the random loading scenario,the defender's defense success rate is lower,indicating that the attacker's success rate is better than the negative feedback loading scenario.This conclusion shows that the attack also needs to have randomness and unpredictability in the network attack and defense game,and should not be excessively interfered and adjusted.

Key words: Dynamic scheduling strategy, Heterogeneous executor, Mimic defense, Negative feedback scheduling, Simulation

CLC Number: 

  • TP393.08
[1]NITRD.Cybersecurity game-change research & developmentrecommendations[OL].http://www.nitrd.gov/pubs/CSIAI WG%20 Cybersecurity%20GameChange_RD%20Re-commendations 20100513.pdf,2014-03-21.
[2]ZHANG Z Y.Research on Dynamic Scheduling Strategy for Mimic Defense [D].Zhengzhou:Zhengzhou University,2018.
[3]ZHANG H,ZHENG K,WANG X,et al.Efficient Strategy Selection for Moving Target Defense Under Multiple Attacks [J].IEEE Access,2019,7:65982-65995.
[4]WANG H,JIA Q,FLECK D,et al.A moving target DDoS defense mechanism [J].Computer Communications,2014,46:10-21.
[5]TIAN J,TAN R,GUAN X,et al.Enhanced Hidden MovingTarget Defense in Smart Grids [J].IEEE Transactions on Smart Grid,2019,10(2):2208-2223.
[6]ZHANG Z,DENG R,YAU D K Y,et al.Analysis of Moving Target Defense Against False Data Injection Attacks on Power Grid [J].IEEE Transactions on Information Forensics and Security,2020,15:2320-2335.
[7]TIAN J,TAN R,GUAN X,et al.Moving Target Defense Approach to Detecting Stuxnet-Like Attacks [J].IEEE Transactions on Smart Grid,2020,11(1):291-300.
[8]XIONG X,YANG L,ZHAO G.Effectiveness Evaluation Model of Moving Target Defense Based on System Attack Surface [J].IEEE Access,2019,7:9998-10014.
[9]WU J X.Research on Cyber Mimic Defense [J].Journal of Cyber Security,2016,1(4):1-10.
[10]HU H C,CHEN F C,WANG Z P.Performance Evaluations on DHR for Cyberspace Mimic Defense [J].Journal of Cyber Security,2016,1(4):40-51.
[11]FAN Y W,ZHU W J,BAN S H,et al.Dynamic Heterogeneous and Redundancy Data Protection Architecture [J].Journal of Chinese Computer Systems,2019,40(9),1956-1961.
[12]WU Z Q,ZHANG F,GUO W,et al.A Mimic Arbitration Optimization Method Based on Heterogeneous Degree of Executors [J].Computer Engineering,2020,46(5),12-18.
[13]MA H L,YI P,JIANG Y M,et al.Dynamic Heterogeneous Redundancy based Router Architecture with Mimic Defenses [J].Journal of Cyber Security,2017,2(1):29-42.
[14]ZHANG J X,PANG J M,ZHANG Z,et al.Executors Scheduling Algorithm for Web Server with Mimic Structure [J].Computer Engineering,2019,45(8):14-21.
[15]LIU Q R,LIN S J,GU Z Y.Heterogeneous redundancies schedu-ling algorithm for mimic security defense[J].Journal on Communications,2018,39(7):188-198.
[16]LIU J,ZHANG H Q,LIU Y.Research on Optimal Selection of Moving Target Defense Policy Based on Dynamic Game with Incomplete Information [J].Acta Electronica Sinica,2018,46(1):82-89.
[17]CAI Y T,CHANG X L,SHI Y,et al.Analyzing Transient Effectiveness of Dynamic Platform Technique in Resisting Attacks [J].Journal of Cyber Security,2019,4(4):59-67.
[18]ZHANG X M,GU Z Y,WEI S,et al.Markov game modeling of mimic defense and defense strategy determination [J].Journal on Communications,2018,39(10):143-154.
[1] DOU Jia-wei. Privacy-preserving Hamming and Edit Distance Computation and Applications [J]. Computer Science, 2022, 49(9): 355-360.
[2] GUO Zheng-wei, FU Ze-wen, LI Ning, BAI Lan. Study on Acceleration Algorithm for Raw Data Simulation of High Resolution Squint Spotlight SAR [J]. Computer Science, 2022, 49(8): 178-183.
[3] GAO Ya, ZHAO Ning, LIU Wen-qi. Dependence Analysis Among Service Stations in Tandem Queueing Systems [J]. Computer Science, 2022, 49(7): 304-309.
[4] LI Tang, QIN Xiao-lin, CHI He-yu, FEI Ke. Secure Coordination Model for Multiple Unmanned Systems [J]. Computer Science, 2022, 49(7): 332-339.
[5] ZHANG Ming-xin. Conceptual Model for Large-scale Social Simulation [J]. Computer Science, 2022, 49(4): 16-24.
[6] YANG Lin, WANG Yong-jie. Application and Simulation of Ant Colony Algorithm in Continuous Path Prediction of Dynamic Network [J]. Computer Science, 2021, 48(6A): 485-490.
[7] CHENG Yu, LIU Tie-jun, TANG Yuan-gui, WANG Jian, JIANG Zhi-bin, QI Sheng. Underwater Robert Visual Simulation Based on UNITY3D [J]. Computer Science, 2021, 48(6A): 281-284.
[8] XIANG Chang-sheng, CHEN Zhi-gang. Chaotic Prediction Model of Network Traffic for Massive Data [J]. Computer Science, 2021, 48(5): 289-293.
[9] ZENG Wei-liang, HAN Yu, HE Jin-yuan, WU Miao-sen, SUN Wei-jun. Simulation Analysis on Dynamic Ridesharing Efficiency of Shared Autonomous Taxi [J]. Computer Science, 2021, 48(2): 257-263.
[10] JIANG Hua-nan, ZHANG Shuai, LIN Yu-fei, LI Hao. Simulation Optimization and Testing Based on Gazebo of MPI Distributed Parallelism [J]. Computer Science, 2021, 48(11A): 672-677.
[11] CUI Xiang, LI Xiao-wen, CHEN Yi-feng. Communication Optimization Method of Heterogeneous Cluster Application Based on New Language Mechanism [J]. Computer Science, 2020, 47(8): 17-15.
[12] CHENG Sheng-gan, YU Hao-ran, WEI Jian-wen, James LIN. Design and Optimization of Two-level Particle-mesh Algorithm Based on Fixed-point Compression [J]. Computer Science, 2020, 47(8): 56-61.
[13] GUO Cong-rui, WANG Jun and FENG Yi-ming. Research on Method of Credibility Evaluation of System Simulation [J]. Computer Science, 2020, 47(6A): 567-571.
[14] ZHENG Geng-feng. Emergency Plan Evaluation of Special Equipment Accident Based on Intuitionistic Fuzzy Analytic Hierarchy Process [J]. Computer Science, 2020, 47(6A): 616-621.
[15] XU Zi-xi, MAO Xin-jun, YANG Yi, LU Yao. Modeling and Simulation of Q&A Community and Its Incentive Mechanism [J]. Computer Science, 2020, 47(6): 32-37.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!