The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
A novel approach to detection of intrusions in computer networks via adaptive sequential and batch-sequential change-point detection methods
Abstract
Large-scale computer network attacks in their final stages can readily be identified by observing very abrupt changes in the network traffic. In the early stage of an attack, however, these changes are hard to detect and difficult to distinguish from usual traffic fluctuations. Rapid response, a minimal false-alarm rate, and the capability to detect a wide spectrum of attacks are the crucial features of intrusion detection systems. In this paper, we develop efficient adaptive sequential and batch-sequential methods for an early detection of attacks that lead to changes in network traffic, such as denial-of-service attacks, worm-based attacks, port-scanning, and man-in-the-middle attacks. These methods employ a statistical analysis of data from multiple layers of the network protocol to detect very subtle traffic changes. The algorithms are based on change-point detection theory and utilize a thresholding of test statistics to achieve a fixed rate of false alarms while allowing us to detect changes in statistical models as soon as possible. There are three attractive features of the proposed approach. First, the developed algorithms are self-learning, which enables them to adapt to various network loads and usage patterns. Secondly, they allow for the detection of attacks with a small average delay for a given false-alarm rate. Thirdly, they are computationally simple and thus can be implemented online. Theoretical frameworks for detection procedures are presented. We also give the results of the experimental study with the use of a network simulator testbed as well as real-life testing for TCP SYN flooding attacks.
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
Mathematical Methods of Statistics.
Geary, R. C., & Cramer, H. (1947) · The Economic Journal · doi:10.2307/2226151 · Cited by 5,927
PAGE, E. S. (1954) · Biometrika · doi:10.1093/biomet/41.1-2.100 · Cited by 5,739
Detection of Abrupt Changes: Theory and Application
Riedel, K. S. (1994) · Technometrics · doi:10.1080/00401706.1994.10485821 · Cited by 3,518
Snort - Lightweight Intrusion Detection for Networks
Roesch, M. (1999) · Cited by 3,163
Bro: a system for detecting network intruders in real-time
Paxson, V. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00112-7 · Cited by 2,636
Procedures for Reacting to a Change in Distribution
Lorden, G. (1971) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177693055 · Cited by 1,351
Detection of Abrupt Changes: Theory and Applications.
Peach, N., Basseville, M., & Nikiforov, I. V. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983416 · Cited by 1,031
Inferring Internet Denial-of-Service Activity
Moore, D., Voelker, G. M., & Savage, S. (2001) · doi:10.21236/ada400003 · Cited by 863
On Optimum Methods in Quickest Detection Problems
Shiryaev, A. N. (1963) · Theory of Probability & Its Applications · doi:10.1137/1108002 · Cited by 839
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
Nonparametric Methods in Change-Point Problems
Brodsky, B. E., & Darkhovsky, B. S. (1993) · Springer eBooks · doi:10.1007/978-94-015-8163-9 · Cited by 625
Optimal Detection of a Change in Distribution
Pollak, M. (1985) · The Annals of Statistics · doi:10.1214/aos/1176346587 · Cited by 581
Sequential Changepoint Detection in Quality Control and Dynamical Systems
Lai, T. L. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02052.x · Cited by 580
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
A framework for classifying denial of service attacks
Hussain, A., Heidemann, J., & Papadopoulos, C. (2003) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/863955.863968 · Cited by 507
Mirković, J., Prier, G., & Reiher, P. L. (2003) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2002.1181418 · Cited by 450
MULTOPS: A Data-Structure for Bandwidth Attack Detection
Gil, T. M., & Poletto, M. (2001) · Defense Technical Information Center (DTIC) · doi:10.21236/ada401819 · Cited by 365
The Expected Sample Size of Some Tests of Power One
Robbins, H. E., & Siegmund, D. (1974) · The Annals of Statistics · doi:10.1214/aos/1176342704 · Cited by 82
Cited by
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
Quickest Detection of False Data Injection Attack in Wide-Area Smart Grids
Li, S., Yilmaz, Y., & Wang, X. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2014.2374577 · Cited by 272
Banerjee, S., Bhandary, P., Woodhouse, M., Sen, T. Z., Wise, R. P., & Andorf, C. M. (2021) · BMC Bioinformatics · doi:10.1186/s12859-021-04120-9 · Cited by 35
A hypergraph based Kohonen map for detecting intrusions over cyber–physical systems traffic
Jagtap, S. S., V. S., S. S., & V., S. (2021) · Future Generation Computer Systems · doi:10.1016/j.future.2021.02.001 · Cited by 29
Metadata
- Authors
- Tartakovsky, A. G., Rozovskii, B. L., Blazek, R. B., & Kim, H.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2006-09
- Volume
- 54
- Issue
- 9
- Pages
- 3372-3382
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2142851111
- Cited by
- 290
- References
- 19
- FWCI
- 13.67
- Type
- journal article
- 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.