DocumentCode
1905781
Title
Rule-Based Anomaly Detection on IP Flows
Author
Duffield, Nick ; Haffner, Patrick ; Krishnamurthy, Balachander ; Ringberg, Haakon
Author_Institution
AT&T Labs.-Res., Florham Park, NJ
fYear
2009
fDate
19-25 April 2009
Firstpage
424
Lastpage
432
Abstract
Rule-based packet classification is a powerful method for identifying traffic anomalies, with network security as a key application area. While popular systems like Snort are used in many network locations, comprehensive deployment across Tier-1 service provider networks is costly due to the need for high-speed monitors at many network ingress points. Since ISPs already collect flow statistics ubiquitously, can we use it for detecting the same anomalies as the packet based rules in spite of aggregation and absence of payload information? We exploit correlations between packet and flow level information via a machine learning (ML) approach to associate packet level alarms with a feature vector derived from flow records on the same traffic. We describe a system architecture for network-wide flow- alarming and describe the steps required to establish a proof- of-concept. We evaluate prediction accuracy of candidate ML algorithms on actual packet traces. The duration of prediction effectiveness is an issue for ML approaches and more so in resource intensive network applications. Initial results show little impairment of performance over periods of one or two weeks.
Keywords
IP networks; learning (artificial intelligence); security of data; telecommunication traffic; IP flow; Tier-1 service provider network; machine learning approach; network security; network traffic; network-wide flow-alarming architecture; packet classification; rule-based anomaly detection; Buffer overflow; Communications Society; Computer worms; Costs; Inspection; Intrusion detection; Monitoring; Payloads; Statistics; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM 2009, IEEE
Conference_Location
Rio de Janeiro
ISSN
0743-166X
Print_ISBN
978-1-4244-3512-8
Electronic_ISBN
0743-166X
Type
conf
DOI
10.1109/INFCOM.2009.5061947
Filename
5061947
Link To Document