Detection and localization of change-points in high-dimensional network traffic data
C\'eline L\'evy-Leduc, Fran\c{c}ois Roueff

TL;DR
This paper introduces TopRank, an efficient nonparametric method for detecting and localizing change-points in high-dimensional network traffic data, enabling real-time anomaly detection with low computational cost.
Contribution
The paper presents TopRank, a novel approach combining data filtering and U-statistics for rapid, accurate change-point detection in high-dimensional network streams, suitable for real-time security applications.
Findings
Effective detection and localization of network anomalies
Low computational load suitable for real-time analysis
Outperforms alternative aggregation methods in synthetic tests
Abstract
We propose a novel and efficient method, that we shall call TopRank in the following paper, for detecting change-points in high-dimensional data. This issue is of growing concern to the network security community since network anomalies such as Denial of Service (DoS) attacks lead to changes in Internet traffic. Our method consists of a data reduction stage based on record filtering, followed by a nonparametric change-point detection test based on -statistics. Using this approach, we can address massive data streams and perform anomaly detection and localization on the fly. We show how it applies to some real Internet traffic provided by France-T\'el\'ecom (a French Internet service provider) in the framework of the ANR-RNRT OSCAR project. This approach is very attractive since it benefits from a low computational load and is able to detect and localize several types of network…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
