The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Statistical approaches to DDoS attack detection and response
Abstract
The nature of the threats posed by distributed denial of service (DDoS) attacks on large networks, such as the Internet, demands effective detection and response methods. These methods must be deployed not only at the edge but also at the core of the network This paper presents methods to identify DDoS attacks by computing entropy and frequency-sorted distributions of selected packet attributes. The DDoS attacks show anomalies in the characteristics of the selected packet attributes. The detection accuracy and performance are analyzed using live traffic traces from a variety of network environments ranging from points in the core of the Internet to those inside an edge network The results indicate that these methods can be effective against current attacks and suggest directions for improving detection of more stealthy attacks. We also describe our detection-response prototype and how the detectors can be extended to make effective response decisions.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Snort - Lightweight Intrusion Detection for Networks
Roesch, M. (1999) · Cited by 3,163
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Mathematical Theory of Communication
(2009) · Encyclopedia of Neuroscience · doi:10.1007/978-3-540-29678-2_3338 · Cited by 2,297
Inferring Internet Denial-of-Service Activity
Moore, D., Voelker, G. M., & Savage, S. (2001) · doi:10.21236/ada400003 · Cited by 863
Inferring Internet denial-of-service activity
Moore, D., Shannon, C., Brown, D. J., Voelker, G. M., & Savage, S. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1132026.1132027 · Cited by 781
Controlling high bandwidth aggregates in the network
Mahajan, R., Bellovin, S. M., Floyd, S., Ioannidis, J., Paxson, V., & Shenker, S. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571724 · Cited by 742
EMERALD: Event Monitoring Enabling Responses to Anomalous Live Disturbances
Porras, P. A., Neumann, P. G., & Avenue, R. (2002) · Cited by 699
Learning nonstationary models of normal network traffic for detecting novel attacks
Mahoney, M. V., & Chan, P. K. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775102 · Cited by 321
Infrastructure for intrusion detection and response
Schnackenberg, D., Djahandari, K., & Sterne, D. (2002) · DARPA Information Survivability Conference and Exposition · doi:10.1109/discex.2000.821505 · Cited by 143
Self-citationLearning nonstationary models of normal network traffic for detecting novel attacks
Mahoney, M. V., & Chan, P. K. (2002) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775094.775102 · Cited by 123
Cited by
Mining 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
A Survey on Machine Learning Techniques for Cyber Security in the Last Decade
Shaukat, K., Luo, S., Varadharajan, V., Hameed, I. A., & Xu, M. (2020) · IEEE Access · doi:10.1109/access.2020.3041951 · Cited by 530
Denial-of-service attack-detection techniques
Carl, G., Kesidis, G., Brooks, R. R., & Rai, S. (2006) · IEEE Internet Computing · doi:10.1109/mic.2006.5 · Cited by 467
Mining anomalies using traffic feature distributions
Lakhina, A., Crovella, M., & Diot, C. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1090191.1080118 · Cited by 446
Eviction of Misbehaving and Faulty Nodes in Vehicular Networks
Raya, M., Papadimitratos, P., Aad, I., Jungels, D., & Hubaux, J.-P. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.071006 · Cited by 406
Metadata
- Authors
- Feinstein, L., Schnackenberg, D., Balupari, R., & Kindred, D.
- Venue
- Proceedings DARPA Information Survivability Conference and Exposition
- Publisher
- IEEE Comput. Soc
- Published
- 2004-03-01
- Pages
- 303-314
- OpenAlex
- W2146189323
- Cited by
- 504
- References
- 14
- FWCI
- 13.48
- 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
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.