Jaal: Towards Network Intrusion Detection at ISP Scale

被引:4
作者
Aqil, Azeem [1 ]
Khalil, Karim [1 ]
Atya, Ahmed O. F. [1 ]
Papalexakis, Evangelos E. [1 ]
Krishnamurthy, Srikanth V. [1 ]
Jaeger, Trent [2 ]
Ramakrishnan, K. K. [1 ]
Yu, Paul [3 ]
Swami, Ananthram [3 ]
机构
[1] UC Riverside, Riverside, CA 92521 USA
[2] Penn State Univ, University Pk, PA 16802 USA
[3] US Army Res Lab, Adelphi, MD USA
来源
CONEXT'17: PROCEEDINGS OF THE 2017 THE 13TH INTERNATIONAL CONFERENCE ON EMERGING NETWORKING EXPERIMENTS AND TECHNOLOGIES | 2017年
关键词
D O I
10.1145/3143361.3143399
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We have recently seen an increasing number of attacks that are distributed, and span an entire wide area network (WAN). Today, typically, intrusion detection systems (IDSs) are deployed at enterprise scale and cannot handle attacks that cover a WAN. Moreover, such IDSs are implemented at a single entity that expects to look at all packets to determine an intrusion. Transferring copies of raw packets to centralized engines for analysis in a WAN can significantly impact both network performance and detection accuracy. In this paper, we propose Jaal, a framework for achieving accurate network intrusion detection at scale. The key idea in Jaal is to monitor traffic and construct in-network packet summaries. The summaries are then processed centrally to detect attacks with high accuracy. The main challenges that we address are (a) creating summaries that are concise, but sufficient to draw highly accurate inferences and (b) transforming traditional IDS rules to handle summaries instead of raw packets. We implement Jaal on a large scale SDN testbed. We show that on average Jaal yields a detection accuracy of about 98%, which is the highest reported for ISP scale network intrusion detection. At the same time, the overhead associated with transferring summaries to the central inference engine is only about 35% of what is consumed if raw packets are transferred.
引用
收藏
页码:134 / 146
页数:13
相关论文
共 51 条
[1]   Online algorithms: a survey [J].
Albers, S .
MATHEMATICAL PROGRAMMING, 2003, 97 (1-2) :3-26
[2]   NP-hardness of Euclidean sum-of-squares clustering [J].
Aloise, Daniel ;
Deshpande, Amit ;
Hansen, Pierre ;
Popat, Preyas .
MACHINE LEARNING, 2009, 75 (02) :245-248
[3]  
[Anonymous], 2016, The biggest data breaches in 2016, so far
[4]  
[Anonymous], 2016, Lessons from the dyn ddos attack
[5]  
[Anonymous], 2002, Principal components analysis
[6]  
[Anonymous], 2016, Top 7 types of network attacks
[7]  
[Anonymous], 2017, Ryu SDN Framework
[8]  
[Anonymous], 2016, Mirai: What you need to know about the botnet behind recent major DDoS attacks, Symantec
[9]  
[Anonymous], 2016, Mirai iot botnet description and ddos attack mitigation
[10]  
[Anonymous], 2017, CYBER HUNTING SCALE