Disentangled Orchestration on Cyber Ranges

被引:0
作者
Fu, Yongquan [1 ]
Han, Weihong [2 ]
Yuan, Dong [3 ]
机构
[1] Natl Univ Def Technol, Coll Comp, Natl Key Lab Parallel & Distributed Comp, Changsha 410073, Peoples R China
[2] Guangzhou Univ, Sch Comp Sci & Cyber Engn, Guangzhou 511370, Guangdong, Peoples R China
[3] Univ Sydney, Fac Engn, Sydney, NSW 2050, Australia
基金
中国国家自然科学基金;
关键词
Task analysis; Containers; Behavioral sciences; Delays; Testing; Chatbots; Malware; Composition; event chaining; experiment; orchestration; cyber range;
D O I
10.1109/TDSC.2023.3303888
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cyber ranges require networked applications to test cyberspace events effectively. As testing becomes more advanced, it involves multiple real-world applications with flexible execution orders. However, it is increasingly challenging to orchestrate large-scale, chained, and heterogeneous Internet applications. State-of-the-art orchestration techniques face scalability issues due to inefficient representation models and entangled scheduling of events and applications. To address these issues, we present Wukong, a disentangled orchestration system in cyber ranges that disaggregates the scheduling and execution of workflows and their applications in a decentralized coordination approach. First, we overcome the heterogeneity of events with a workflow model that encodes event chains with compositional Directed Acyclic Graphs (DAGs) and unified event triggers. Second, Wukong disaggregates the execution of DAGs and applications with push-pull decentralized coordination over distributed agents. Our evaluation of Wukong on a real-world cyber range demonstrates its expressive, scalable, and efficient abilities for automatically emulating diverse event chains. The storage footprint of compositional modeling is up to 57 times smaller than that of baseline models. Wukong's response delay is 1.52 to 2.74 times shorter than state-of-the-art orchestration engines, and the scheduling delay is up to 2.16 times smaller than the baseline approach.
引用
收藏
页码:2344 / 2360
页数:17
相关论文
共 47 条
  • [31] Massicotte M., 2011, P 1 WORKSH BUILD AN, P19, DOI [10.1145/1978672.1978675, DOI 10.1145/1978672.1978675]
  • [32] (Acyclic) Job Shops are Hard to Approximate
    Mastrolilli, Monaldo
    Svensson, Ola
    [J]. PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 583 - 592
  • [33] CyExec*: A High-Performance Container-Based Cyber Range With Scenario Randomization
    Nakata, Ryotaro
    Otsuka, Akira
    [J]. IEEE ACCESS, 2021, 9 : 109095 - 109114
  • [34] Container-based bioinformatics with Pachyderm
    Novella, Jon Ander
    Emami Khoonsari, Payam
    Herman, Stephanie
    Whitenack, Daniel
    Capuccini, Marco
    Burman, Joachim
    Kultima, Kim
    Spjuth, Ola
    [J]. BIOINFORMATICS, 2019, 35 (05) : 839 - 846
  • [35] Taverna: a tool for the composition and enactment of bioinformatics workflows
    Oinn, T
    Addis, M
    Ferris, J
    Marvin, D
    Senger, M
    Greenwood, M
    Carver, T
    Glover, K
    Pocock, MR
    Wipat, A
    Li, P
    [J]. BIOINFORMATICS, 2004, 20 (17) : 3045 - 3054
  • [36] Openstack heat, 2020, About us
  • [37] Podnar T, 2021, Technical Report CMU/SEI-2021-TR-001
  • [38] Qasha R, 2016, P IEEE INT C E-SCI, P81, DOI 10.1109/eScience.2016.7870888
  • [39] Workflow Scheduling in Multi-Tenant Cloud Computing Environments
    Rimal, Bhaskar Prasad
    Maier, Martin
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (01) : 290 - 304
  • [40] Stackstorm, 2020, About us