首页> 外文会议>International Conference on Computational Intelligence and Security pt.2 >Sampling Distance Analysis of Gigantic Data Mining for Intrusion Detection Systems
【24h】

Sampling Distance Analysis of Gigantic Data Mining for Intrusion Detection Systems

机译:用于入侵检测系统巨大数据挖掘的采样距离分析

获取原文

摘要

Real-Time intrusion detection system (IDS) based on traffic analysis is one of the highlighted topics of network security researches. Restricted by computer resources, real-time IDS is computationally infeasible to deal with gigantic operations of data storage and analyzing in real world. As a result, the sampling measurement technique in a high-speed network becomes an important issue in this topic. Sampling distance analysis of gigantic data mining for IDS is shown in this paper. Based on differential equation theory, a quantitative analysis of the effect of IDS on the network traffic is given firstly. Secondly, a minimum delay time of IDS needed to detect some kinds of intrusions is analyzed. Finally, an upper bound of the sampling distance is discussed. Proofs are given to show the efficiency of our approach.
机译:基于交通分析的实时入侵检测系统(IDS)是网络安全研究的突出显示的主题之一。受计算机资源的限制,实时ID在计算上不可行,可以处理数据存储和在现实世界中分析的巨大操作。结果,高速网络中的采样测量技术成为本主题中的一个重要问题。本文示出了IDS巨大数据挖掘的采样距离分析。基于微分方程理论,首先给出了IDS对网络流量的效果的定量分析。其次,分析了检测某些类型入侵所需的ID的最小延迟时间。最后,讨论了采样距离的上限。给出了证明来展示我们方法的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号