Journal of Computer Applications ›› 2011, Vol. 31 ›› Issue (06): 1521-1524.DOI: 10.3724/SP.J.1087.2011.01521

• Information security • Previous Articles     Next Articles

DDoS detection with non-iterative Apriori algorithm

Yan GAO1,2,WANG Taihua2,GUO Fan2,3,YU Min2   

  1. 1. Jiangxi Provincial Meteorological Information Center, Nanchang Jiangxi 330046, China
    2. School of Computer and Information Engineering, Jiangxi Normal University, Nanchang Jiangxi 330022, China
  • Received:2010-11-22 Revised:2011-01-04 Online:2011-06-20 Published:2011-06-01
  • Contact: GUO Fan



  1. 1. 江西省气象信息中心,南昌 330046
    2. 江西师范大学 计算机信息工程学院,南昌 330022
    3. 江西省南昌市江西师范大学计算机信息工程学院
  • 通讯作者: 郭帆
  • 作者简介:高琰(1973-),女,江苏阜宁人,硕士,主要研究方向:数据处理、信息安全;王台华(1987-),男,江西吉安人,硕士研究生,主要研究方向:信息安全、软件体系结构;郭帆(1977-),男,江西于都人,副教授,博士,主要研究方向:信息安全、软件体系结构;余敏(1964-),女,江西南昌人,教授,博士,主要研究方向:分布式计算、信息安全。
  • 基金资助:

Abstract: An improved non-iterative Apriori algorithm was proposed to detect Distributed Denail of Service (DDoS) attacks. An one-step intersection operation was used to process network packets within the specific time range, and the strong correlation rules of the packets were studied so as to achieve the quick detection of DDoS atttacks. In comparison with current algorithms, it shows better performance in efficiency and storage space in detection of DDoS attacks. Experimental results on DARPA data-sets show the algorithm is able to detect DDoS effectively.

Key words: data mining, Apriori algorithm, Distributed Denial of Service (DDoS) attack, intrusion detection

摘要: 提出了一种非迭代Apriori算法,无需多次扫描事务数据库,使用一步交集操作处理同一时间段的网络数据包,通过挖掘各数据包之间的强关联规则,可较快检测分布式拒绝服务(DDoS)攻击。与现有算法相比,检测DDoS攻击的时间和空间性能较优。在DARPA数据集上的实验结果表明应用该算法能有效检测DDoS攻击。

关键词: 数据挖掘, Apriori算法, 分布式拒绝服务攻击, 入侵检测