4.5 Article

On-Line Anomaly Detection With High Accuracy

Journal

IEEE-ACM TRANSACTIONS ON NETWORKING
Volume 26, Issue 3, Pages 1222-1235

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNET.2018.2819507

Keywords

Anomaly detection; on-line algorithm; bilateral PCA

Funding

  1. National Natural Science Foundation of China [61572184, 61725206, 61472130, 61472131, 61772191]
  2. Hunan Provincial Natural Science Foundation of China [2017JJ1010]
  3. Science and Technology Key Projects of Hunan Province [2015TP1004, 2016JC2012]
  4. U.S. ONR [N00014-17-1-2730]
  5. NSF [ECCS 1408247, CNS 1526843, ECCS 1731238]
  6. Open Project Funding of the CAS Key Laboratory of Network Data Science and Technology, Institute of Computing Technology, Chinese Academy of Sciences [CASNDST201704]
  7. Division Of Computer and Network Systems
  8. Direct For Computer & Info Scie & Enginr [1526843] Funding Source: National Science Foundation

Ask authors/readers for more resources

Traffic anomaly detection is critical for advanced Internet management. Existing detection algorithms generally convert the high-dimensional data to a long vector, which compromises the detection accuracy due to the loss of spatial information of data. Moreover, they are generally designed based on the separation of normal and anomalous data in a time period, which not only introduces high storage and computation cost but also prevents timely detection of anomalies. Online and accurate traffic anomaly detection is critical but difficult to support. To address the challenge, this paper directly models the monitoring data in each time slot as a 2-D matrix, and detects anomalies in the new time slot based on bilateral principal component analysis (B-PCA). We propose several novel techniques in OnlineBPCA to support quick and accurate anomaly detection in real time, including a novel BPCA-based anomaly detection principle that jointly considers the variation of both row and column principal directions for more accurate anomaly detection, an approximate algorithm to avoid using iteration procedure to calculate the principal directions in a close-form, and a sequential anomaly algorithm to quickly update principal directions with low computation and storage cost when receiving a new data matrix at a time slot. To the best of our knowledge, this is the first work that exploits 2-D PCA for anomaly detection. We have conducted extensive simulations to compare our OnlineBPCA with the state-of-art anomaly detection algorithms using real traffic traces Abilene and GEANT. Our simulation results demonstrate that, compared with other algorithms, our OnlineBPCA can achieve significantly better detection performance with low false positive rate, high true positive rate, and low computation cost.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available