Sensitivity of PCA for traffic anomaly detection

✍ Scribed by Ringberg, Haakon; Soule, Augustin; Rexford, Jennifer; Diot, Christophe

• Book ID: 115519433
• Publisher: Association for Computing Machinery
• Year: 2007
• Tongue: English
• Weight: 503 KB
• Volume: 35
• Category: Article
• ISSN: 0163-5999
• DOI: 10.1145/1269899.1254895

✦ Synopsis

Detecting anomalous traffic is a crucial part of managing IP networks. In recent years, network-wide anomaly detection based on Principal Component Analysis (PCA) has emerged as a powerful method for detecting a wide variety of anomalies. We show that tuning PCA to operate effectively in practice is difficult and requires more robust techniques than have been presented thus far. We analyze a week of network-wide traffic measurements from two IP backbones (Abilene and Geant) across three different traffic aggregations (ingress routers, OD flows, and input links), and conduct a detailed inspection of the feature time series for each suspected anomaly. Our study identifies and evaluates four main challenges of using PCA to detect traffic anomalies: (i) the false positive rate is very sensitive to small differences in the number of principal components in the normal subspace, (ii) the effectiveness of PCA is sensitive to the level of aggregation of the traffic measurements, (iii) a large anomaly may in advertently pollute the normal subspace, (iv) correctly identifying which flow triggered the anomaly detector is an inherently challenging problem.