首页> 中文期刊> 《清华大学学报(英文版)》 >A Scheduling Optimization Technique Based on Reuse in Spark to Defend Against APT Attack

A Scheduling Optimization Technique Based on Reuse in Spark to Defend Against APT Attack

         

摘要

Advanced Persistent Threat (APT) attack,an attack option in recent years,poses serious threats to the security of governments and enterprises data due to its advanced and persistent attacking characteristics.To address this issue,a security policy of big data analysis has been proposed based on the analysis of log data of servers and terminals in Spark.However,in practical applications,Spark cannot suitably analyze very huge amounts of log data.To address this problem,we propose a scheduling optimization technique based on the reuse of datasets to improve Spark performance.In this technique,we define and formulate the reuse degree of Directed Acyclic Graphs (DAGs) in Spark based on Resilient Distributed Datasets (RDDs).Then,we define a global optimization function to obtain the optimal DAG sequence,that is,the sequence with the least execution time.To implement the global optimization function,we further propose a novel cost optimization algorithm based on the traditional Genetic Algorithm (GA).Our experiments demonstrate that this scheduling optimization technique in Spark can greatly decrease the time overhead of analyzing log data for detecting APT attacks.

著录项

  • 来源
    《清华大学学报(英文版)》 |2018年第5期|550-560|共11页
  • 作者单位

    College of Computer, National University of Defense Technology,Changsha 410073, China;

    College of Computer, National University of Defense Technology,Changsha 410073, China;

    College of Computer, National University of Defense Technology, Changsha 410073;

    Sate Key Laboratory of Cryptology, Beijing 100878, China;

    College of Computer, National University of Defense Technology,Changsha 410073, China;

  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号