The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Diagnosing network-wide traffic anomalies
Open accessAbstract
Anomalies are unusual and significant changes in a network's traffic levels, which can often span multiple links. Diagnosing anomalies is critical for both network operators and end users. It is a difficult problem because one must extract and interpret anomalous patterns from large amounts of high-dimensional, noisy data.In this paper we propose a general method to diagnose anomalies. This method is based on a separation of the high-dimensional space occupied by a set of network traffic measurements into disjoint subspaces corresponding to normal and anomalous network conditions. We show that this separation can be performed effectively by Principal Component Analysis.Using only simple traffic measurements from links, we study volume anomalies and show that the method can: (1) accurately detect when a volume anomaly is occurring; (2) correctly identify the underlying origin-destination (OD) flow which is the source of the anomaly; and (3) accurately estimate the amount of traffic involved in the anomalous OD flow.We evaluate the method's ability to diagnose (i.e., detect, identify, and quantify) both existing and synthetically injected volume anomalies in real traffic from two backbone networks. Our method consistently diagnoses the largest volume anomalies, and does so with a very low false alarm rate.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Analysis of a complex of statistical variables into principal components.
Hotelling, H. (1933) · Journal of Educational Psychology · doi:10.1037/h0071325 · Cited by 9,633
Introduction to Time Series and Forecasting
(2002) · Springer Texts in Statistics · doi:10.1007/b97391 · Cited by 3,807
Control Procedures for Residuals Associated With Principal Component Analysis
Jackson, J. E., & Mudholkar, G. S. (1979) · Technometrics · doi:10.1080/00401706.1979.10489779 · Cited by 1,237
Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
Vardi, Y. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476697 · Cited by 794
A signal analysis of network traffic anomalies
Barford, P., Kline, J., Plonka, D., & Ron, A. (2002) · Proceedings of the second ACM SIGCOMM Workshop on Internet measurment - IMW '02 · doi:10.1145/637201.637210 · Cited by 787
Sketch-based change detection: methods, evaluation, and applications
Krishnamurthy, B., Sen, S., Zhang, Y., & Chen, Y. (2003) · Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03 · doi:10.1145/948205.948236 · Cited by 528
Fast accurate computation of large-scale IP traffic matrices from link loads
Zhang, Y., Roughan, M., Duffield, N., & Greenberg, A. (2003) · Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/781027.781053 · Cited by 505
Traffic matrix estimation: existing techniques and new directions
Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., & Diot, C. (2002) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/633025.633041 · Cited by 488
Self-citationStructural analysis of network traffic flows
Lakhina, A., Papagiannaki, K., Crovella, M., Diot, C., Kolaczyk, E. D., & Taft, N. (2004) · Proceedings of the joint international conference on Measurement and modeling of computer systems · doi:10.1145/1005686.1005697 · Cited by 451
Self-citationDeriving traffic demands for operational IP networks: methodology and experience
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., & True, F. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929850 · Cited by 430
Characterization of network-wide anomalies in traffic flows
Lakhina, A., Crovella, M., & Diot, C. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028813 · Cited by 421
Self-citationSubspace approach to multidimensional fault identification and reconstruction
Dunia, R. H., & Qin, S. J. (1998) · AIChE Journal · doi:10.1002/aic.690440812 · Cited by 382
Multivariate process monitoring and fault diagnosis by multi-scale PCA
Misra, M., Yue, H. H., Qin, S. J., & Ling, C. (2002) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00093-5 · Cited by 325
1984 American Control Conference
(1983) · IEEE Power Engineering Review · doi:10.1109/mper.1983.5518918 · Cited by 304
An information-theoretic approach to traffic matrix estimation
Zhang, Y., Roughan, M., Lund, C., & Donoho, D. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863990 · Cited by 303
Aberrant Behavior Detection in Time Series for Network Monitoring
Brutlag, J. D. (2000) · USENIX Large Installation Systems Administration Conference · Cited by 296
Schemes for fault identification in communication networks
Katzela, I., & Schwartz, M. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.477721 · Cited by 268
A Markov Chain Model of Temporal Behavior for Anomaly Detection
Ye, N. (2000) · Cited by 256
Characteristics of network traffic flow anomalies
Barford, P., & Plonka, D. (2001) · Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement - IMW '01 · doi:10.1145/505202.505211 · Cited by 200
A Singular Value Decomposition Updating Algorithm for Subspace Tracking
Moonen, M., Van Dooren, P., & Vandewalle, J. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613061 · Cited by 176
Long-term forecasting of Internet backbone traffic: observations and initial models
Papagiannaki, K., Taft, N., Zhang, Z.-L., & Diot, C. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1208954 · Cited by 174
Self-citationProactive network fault detection
Hood, C. S., & Ji, C. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1997.631137 · Cited by 158
Downdating the Singular Value Decomposition
Gu, M., & Eisenstat, S. C. (1995) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479893251472 · Cited by 57
Cited by
Detecting large-scale system problems by mining console logs
Xu, W., Huang, L., Fox, A., Patterson, D., & Jordan, M. I. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629587 · Cited by 1,332
Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011) · Proceedings of the 4th ACM workshop on Security and artificial intelligence · doi:10.1145/2046684.2046692 · Cited by 1,194
“This assumption is empirically validated [36], but can be violated by a clever adversary as discussed below.”
BackgroundMethodInfluentialMining anomalies using traffic feature distributions
Lakhina, A., Crovella, M., & Diot, C. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080118 · Cited by 1,054
Self-citationUnsupervised real-time anomaly detection for streaming data
Ahmad, S., Lavin, A., Purdy, S., & Agha, Z. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.04.070 · Cited by 995
An empirical comparison of botnet detection methods
García, S., Grill, M., Stiborek, J., & Zunino, A. (2014) · Computers & Security · doi:10.1016/j.cose.2014.05.011 · Cited by 962
Metadata
- Authors
- Lakhina, A., Crovella, M., & Diot, C.
- Venue
- Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2004-08-30
- Pages
- 219-230
- OpenAlex
- W2157578436
- Cited by
- 1,039
- References
- 24
- FWCI
- 17.92
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.