The contents of this legacy page are no longer maintained nor supported, and are made available only for historical purposes.

Bibliography Details

A. Lakhina, M. Crovella, and C. Diot, "Mining Anomalies Using Traffic Feature Distributions", in ACM SIGCOMM 2005, Aug 2005.

Mining Anomalies Using Traffic Feature Distributions
Authors: A. Lakhina
M. Crovella
C. Diot
Published: ACM SIGCOMM, 2005
URL: http://conferences.sigcomm.org/sigcomm/2005/paper-LakCro.pdf
Entry Dates: 2009-02-11
Abstract: The increasing practicality of large-scale flow capture makes it possible to conceive of traffic analysis methods that detect and identify a large and diverse set of anomalies. However the challenge of effectively analyzing this massive data source for anomaly diagnosis is as yet unmet. We argue that the distributions of packet features (IP addresses and ports) observed in flow traces reveals both the presence and the structure of a wide range of anomalies. Using entropy as a summarization tool, we show that the analysis of feature distributions leads to significant advances on two fronts: (1) it enables highly sensitive detection of a wide range of anomalies, augmenting detections by volume-based methods, and (2) it enables automatic classification of anomalies via unsupervised learning. We show that using feature distributions, anomalies naturally fall into distinct and meaningful clusters. These clusters can be used to automatically classify anomalies and to uncover new anomaly types. We validate our claims on data from two backbone networks (Abilene and G'eant) and conclude that feature distributions show promise as a key element of a fairly general network anomaly diagnosis framework.