Communication-efficient online detection of network-wide anomalies
(EN)
Γαροφαλακης Μινως
(EL)
Huang Ling
(EN)
Hellerstein Joseph M.
(EN)
Garofalakis Minos
(EN)
Jordan Michael I.
(EN)
Joseph Anthony D.
(EN)
Nguyen XuanLong
(EN)
Taft Nina
(EN)
Πολυτεχνείο Κρήτης
(EL)
Technical University of Crete
(EN)
There has been growing interest in building large-scale distributed monitoring systems for sensor, enterprise, and ISP networks. Recent work has proposed using principal component analysis (PCA) over global traffic matrix statistics to effectively isolate network-wide anomalies. To allow such a PCA-based anomaly detection scheme to scale, we propose a novel approximation scheme that dramatically reduces the burden on the production network. Our scheme avoids the expensive step of centralizing all the data by performing intelligent filtering at the distributed monitors. This filtering reduces monitoring bandwidth overheads, but can result in the anomaly detector making incorrect decisions based on a perturbed view of the global data set. We employ stochastic matrix perturbation theory to bound such errors. Our algorithm selects the filtering parameters at local monitors such that the errors made by the detector are guaranteed to lie below a user-specified upper bound. Our algorithm thus allows network operators to explicitly balance the tradeoff between detection accuracy and the amount of data communicated over the network. In addition, our approach enables real-time detection because we exploit continuous monitoring at the distributed monitors. Experiments with traffic data from Abilene backbone network demonstrate that our methods yield significant communication benefits while simultaneously achieving high detection accuracy.
(EN)
