摘要
提出了一种非迭代Apriori算法,无需多次扫描事务数据库,使用一步交集操作处理同一时间段的网络数据包,通过挖掘各数据包之间的强关联规则,可较快检测分布式拒绝服务(DDoS)攻击。与现有算法相比,检测DDoS攻击的时间和空间性能较优。在DARPA数据集上的实验结果表明应用该算法能有效检测DDoS攻击。
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.
出处
《计算机应用》
CSCD
北大核心
2011年第6期1521-1524,共4页
journal of Computer Applications
基金
国家973计划项目(2007CB316505)
