pith. sign in

arxiv: 0909.5524 · v2 · pith:TD2D3KMDnew · submitted 2009-09-30 · 📊 stat.AP · cs.NI· math.ST· stat.TH

Distributed detection/localization of change-points in high-dimensional network traffic data

classification 📊 stat.AP cs.NImath.STstat.TH
keywords networkdistributeddatadetectiontrafficalgorithmapproachchange-points
0
0 comments X
read the original abstract

We propose a novel approach for distributed statistical detection of change-points in high-volume network traffic. We consider more specifically the task of detecting and identifying the targets of Distributed Denial of Service (DDoS) attacks. The proposed algorithm, called DTopRank, performs distributed network anomaly detection by aggregating the partial information gathered in a set of network monitors. In order to address massive data while limiting the communication overhead within the network, the approach combines record filtering at the monitor level and a nonparametric rank test for doubly censored time series at the central decision site. The performance of the DTopRank algorithm is illustrated both on synthetic data as well as from a traffic trace provided by a major Internet service provider.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.