The DOI matches its Crossref record.
Entropy Based Worm and Anomaly Detection in Fast IP Networks
Open accessAbstract
Detecting massive network events like worm outbreaks in fast IP networks such as Internet backbones, is hard. One problem is that the amount of traffic data does not allow real-time analysis of details. Another problem is that the specific characteristics of these events are not known in advance. There is a need for analysis methods that are real-time capable and can handle large amounts of traffic data. We have developed an entropy-based approach that determines and reports entropy contents of traffic parameters such as IP addresses. Changes in the entropy content indicate a massive network event. We give analyses on two Internet worms as proof-of-concept. While our primary focus is detection of fast worms, our approach should also be able to detect other network events. We discuss implementation alternatives and give benchmark results. We also show that our approach scales very well.
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
Cited by
An Overview of IP Flow-Based Intrusion Detection
Sperotto, A., Schaffrath, G., Sadre, R., Morariu, C., Pras, A., & Stiller, B. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.032210.00054 · Cited by 466
Giotis, K., Argyropoulos, C., Androulidakis, G., Kalogeras, D., & Maglaris, V. (2014) · Computer Networks · doi:10.1016/j.bjp.2013.10.014 · Cited by 461
An empirical evaluation of entropy-based traffic anomaly detection
Nychis, G., Sekar, V., Andersen, D. G., Kim, H., & Zhang, H. (2008) · Proceedings of the 8th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1452520.1452539 · Cited by 300
Beehive: large-scale log analysis for detecting suspicious activity in enterprise networks
Yen, T.-F., Oprea, A., Onarlioglu, K., Leetham, T., Robertson, W., Juels, A., & Kirda, E. (2013) · Proceedings of the 29th Annual Computer Security Applications Conference · doi:10.1145/2523649.2523670 · Cited by 270
Mandal, S., Khan, D. A., & Jain, S. (2021) · New Generation Computing · doi:10.1007/s00354-021-00130-6 · Cited by 66
“Entropy is zero where all distribution values are identical and highest when all the values are different [47].”
Background
Metadata
- Authors
- Wagner, A., Wagner, A., Plattner, B., & Plattner, B.
- Venue
- 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (WETICE'05)
- Publisher
- IEEE
- Published
- 2006-01-05
- Pages
- 172-177
- OpenAlex
- W2113061123
- Cited by
- 235
- References
- 0
- FWCI
- 16.32
- 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.