The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Detecting anomalies in network traffic using maximum entropy estimation
Abstract
We develop a behavior-based anomaly detection method that detects network anomalies by comparing the current network traffic against a baseline distribution. The Maximum Entropy technique provides a flexible and fast approach to estimate the baseline distribution, which also gives the network administrator a multi-dimensional view of the network traffic. By computing a measure related to the relative entropy of the network traffic under observation with respect to the baseline distribution, we are able to distinguish anomalies that change the traffic either abruptly or slowly. In addition, our method provides information revealing the type of the anomaly detected. It requires a constant memory and a computation time proportional to the traffic rate. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Inducing features of random fields
Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.588021 · Cited by 1,036
A comparison of algorithms for maximum entropy parameter estimation
Malouf, R. (2002) · proceeding of the 6th conference on Natural language learning - COLING-02 · doi:10.3115/1118853.1118871 · Cited by 655
Detecting SYN flooding attacks
Wang, H., Zhang, D., & Shin, K. G. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019404 · Cited by 568
Anomaly detection in IP networks
Thottan, M., & Ji, C. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814797 · Cited by 541
Information-theoretic measures for anomaly detection
Lee, W., & Xiang, D. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924294 · Cited by 537
Efficiently Inducing Features of Conditional Random Fields
McCallum, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.2504 · Cited by 363
Self-citationA system for detecting network intruders in real-time
Dhivya, J. J., & Saritha, A. (2016) · International Journal of Computer Science and Engineering · doi:10.14445/23488387/ijcse-v3i5p106 · Cited by 73
Cited by
Machine Learning for Anomaly Detection: A Systematic Review
Nassif, A. B., Talib, M. A., Nasir, Q., & Dakalbab, F. M. (2021) · IEEE Access · doi:10.1109/access.2021.3083060 · Cited by 748
Bayesian Neural Networks for Internet Traffic Classification
Auld, T., Moore, A. W., & Gull, S. F. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.883010 · Cited by 494
DDoS Attack Detection and Mitigation Using SDN: Methods, Practices, and Solutions
Bawany, N. Z., Shamsi, J. A., & Salah, K. (2017) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-017-2414-5 · Cited by 387
Low-Rate DDoS Attacks Detection and Traceback by Using New Information Metrics
Xiang, Y., Li, K., & Zhou, W. (2011) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2107320 · Cited by 375
Software Defined Networking Architecture, Security and Energy Efficiency: A Survey
Rawat, D. B., & Reddy, S. R. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2618874 · Cited by 372
Metadata
- Authors
- Gu, Y., McCallum, A., & Towsley, D.
- Venue
- Proceedings of the 5th ACM SIGCOMM conference on Internet measurement - IMC '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 1
- OpenAlex
- W4239856175
- Cited by
- 253
- References
- 7
- FWCI
- 5.77
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Detecting anomalies in network traffic using maximum entropy estimation. https://app.cochat.ai/papers/10.1145/1330107.1330148
- The paper
- Gu, Y., McCallum, A., & Towsley, D. (2005). Detecting anomalies in network traffic using maximum entropy estimation. Proceedings of the 5th ACM SIGCOMM conference on Internet measurement - IMC '05. https://doi.org/10.1145/1330107.1330148
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.