Computer Science ›› 2018, Vol. 45 ›› Issue (11): 160-163.doi: 10.11896/j.issn.1002-137X.2018.11.024

• Information Security • Previous Articles     Next Articles

Network Security Experiment Environment Multi-emulation Planning Based on Capability Measurement

ZENG Zi-yi, QIU Han, ZHU Jun-hu, ZHOU Tian-yang   

  1. (Information Engineering University,Zhengzhou 450001,China)
    (National Digital Switching System Engineering & Technological Research Center,Zhengzhou 450001,China)
  • Received:2018-07-09 Published:2019-02-25

Abstract: The combined usage of multiple emulation technologies can provide flexible resource allocation for construction of experimental environment for network security.Its difficulty lies in how to balance the fidelity requirements.A multi-emulation planning method based on “distribution on demand” was proposed for this problem.Firstly,the emulation capability is used to define the fidelity requirement,and then the complex,abstract and unstructured requirements are represented as simple,concrete and structured forms.Secondly,a fidelity satisfaction decision criterion based on default rejection strategy and a multi-emulation scheme solving algorithm based on greedy strategy are given.In the expe-riment of emulation environment construction of worm sample propagation,the emulation scheme solved by this method can obtain the minimum emulation cost under the condition of satisfying the fidelity requirement.

Key words: Capability measurement, Fidelity requirement representation, Greedy strategy, Multi-emulation planning

CLC Number: 

  • 393.01
[1]ALKHATHAMI M,ALAZZAWI L,ELKATEEB A.Large Scale Border Security Systems Modeling and Simulation with OPNET [C]∥Computing and Communication Workshop and Conference (CCWC).IEEE,2017:1-8.
[2]MEHIC M,MAURHART O,RASS S,et al.Implementation of Quantum Key Distribution Network Simulation Module in the Network Simulator NS-3 [J].Quantum Information Proces-sing,2017,16(10):253.
[3]ORGERIE A C,ASSUNCAO M D,LEFEVRE L.A Survey on Techniques for Improving the Energy Efficiency of Large-scale Distributed Systems[J].ACM Computing Surveys,2014,46(4):1-31.
[4]BOETTIGER C.An introduction to Docker for reproducible research.ACM SIGOPS Operating Systems Review,2015, 49(1):71-79.
[5]LUBKE R,BUSCHEL P,SCHUSTER D,et al.Measuring Accuracy and Performance of Network Emulators [C]∥2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom).IEEE,2014:63-65.
[6]MIJUMBI R,SERRAT J,GORRICHO J L,et al.Network Function Virtualization:State-of-the-art and Research Challenges [J].IEEE Communications Surveys & Tutorials,2016,18(1):236-262.
[7]FANG B X,JIA Y,LI A P,et al.Cyber Ranges:State-of-the-art and Research Challenges [J].Journal of Cyber Security,2016,1(3):1-9.(in Chinese)
方滨兴,贾焰,李爱平,等.网络空间靶场技术研究[J].信息安全学报,2016,1(3):1-9.
[8]YANG R,LIU Y K.Simulation Fidelity Theory and Measurement:A Literature Review [J].System Simulation Technology,2014,10(2):85-89.(in Chinese)
杨蓉,刘玉坤.建模与仿真逼真度理论与方法研究综述[J].系统仿真技术,2014,10(2):85-89.
[9]SIATERLIS C,GARCIA A P,GENGE B.On the Use of Emulab Testbeds for Scientifically Rigorous Experiments [J].IEEE Communications Surveys & Tutorials,2013,15(2):929-942.
[10]WROCLAWSKI J,BENZEL T,BLYTHE J,et al.DETERLab and the DETER Project [M]∥The GENI Book.Springer International Publishing,2016:35-62.
[11]ROZA Z C.Simulation Fidelity Theory and Practice [D].Netherlands:TU Delft,2005.
[12]GARDENGHI L,GOLDWEBER M,DAVOLI R.View-os:A New Unifying Approach against the Global View Assumption [C]∥International Conference on Computational Science(ICCS 2008).2008:287-296.
[13]SHUJA J,GANI A,BILAL K,et al.A Survey of Mobile Device Virtualization:Taxonomy and State of the Art [J].ACM Computing Surveys,2016,49(1):1.
[14]DETER T.Building Apparatus for Multi-resolution Networking Experiments Using Containers:ISI-TR-683[R].2011.
[1] LI Xiao-dong, YU Zhi-yong, HUANG Fang-wan, ZHU Wei-ping, TU Chun-yu, ZHENG Wei-nan. Participant Selection Strategies Based on Crowd Sensing for River Environmental Monitoring [J]. Computer Science, 2022, 49(5): 371-379.
[2] JIA Xin and ZHANG Shao-ping. Research on Wear Leveling Algorithm of NAND FLASH Memory Based on Greedy Strategy [J]. Computer Science, 2017, 44(Z11): 312-316.
[3] . Fast Approximation Algorithm Based on Adjacent Matrix for Construction Virtual Backbone [J]. Computer Science, 2012, 39(3): 83-87.
[4] CHEN Duan-Bing ,HUANG Wen-Qi (School of Computer Science, Huazhong University of Science and Technology, Wuhan 430074). [J]. Computer Science, 2007, 34(4): 133-136.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!