The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Detecting SYN flooding attacks
Abstract
We propose a simple and robust mechanism for detecting SYN flooding attacks. Instead of monitoring the ongoing traffic at the front end (like firewall or proxy) or a victim server itself, we detect the SYN flooding attacks at leaf routers that connect end hosts to the Internet. The simplicity of our detection mechanism lies in its statelessness and low computation overhead, which make the detection mechanism itself immune to flooding attacks. Our detection mechanism is based on the protocol behavior of TCP SYN-FIN (RST) pairs, and is an instance of the Seqnential Change Point Detection [l]. To make the detection mecbanism insensitive to site and access pattern, a non-parametric Cnmnlative Sum (CUSUM) method [4] is applied, thus making the detection mechanism much more generally applicable and its deployment much easier. The efficacy of this detection mechanism is validated by trace-driven simulations. The evaluation results show that the detection mechanism has short detection latency and high detection accuracy. Moreover, due to its proximity to the flooding sources, our mechanism not only sets alarms upon detection of ongoing SYN flooding attacks, but also reveals the location of the flooding sources without resorting to expensive IP traceback.
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
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Detection of Abrupt Changes: Theory and Application
Riedel, K. S. (1994) · Technometrics · doi:10.1080/00401706.1994.10485821 · Cited by 3,518
Ferguson, P., & Senie, D. (2000) · doi:10.17487/rfc2827 · Cited by 1,313
Practical network support for IP traceback
Savage, S., Wetherall, D., Karlin, A., & Anderson, T. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347560 · Cited by 1,127
Wide-area Internet traffic patterns and characteristics
Thompson, K., Miller, G. J., & Wilder, R. (1997) · IEEE Network · doi:10.1109/65.642356 · Cited by 1,074
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
Stevens, W. R. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 766
Advanced and authenticated marking schemes for IP traceback
Song, D. X., & Perrig, A. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916279 · Cited by 750
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
Cited by
Survey of network-based defense mechanisms countering the DoS and DDoS problems
Peng, T., Leckie, C., & Ramamohanarao, K. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216373 · Cited by 759
Anomaly Detection in Streams with Extreme Value Theory
Siffer, A., Fouque, P.-A., Termier, A., & Largouet, C. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098144 · Cited by 553
Anomaly detection in IP networks
Thottan, M., & Ji, C. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814797 · Cited by 541
Hop-count filtering: an effective defense against spoofed DDoS traffic
Jin, C., Wang, H., & Shin, K. G. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948116 · Cited by 468
Self-citationDenial-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
Defense Against Spoofed IP Traffic Using Hop-Count Filtering
Wang, H., Jin, C., & Shin, K. G. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.890133 · Cited by 374
Self-citationDoS and DDoS in Named Data Networking
Gasti, P., Tsudik, G., Uzun, E., & Zhang, L. (2013) · 2013 22nd International Conference on Computer Communication and Networks (ICCCN) · doi:10.1109/icccn.2013.6614127 · Cited by 315
Detecting anomalies in network traffic using maximum entropy estimation
Gu, Y., McCallum, A., & Towsley, D. (2005) · Internet Measurement Conference · doi:10.5555/1251086.1251118 · Cited by 305
Tartakovsky, A. G., Rozovskii, B. L., Blazek, R. B., & Kim, H. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.879308 · Cited by 290
Monitoring the Application-Layer DDoS Attacks for Popular Websites
Xie, Y., & Yu, S.-Z. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.925628 · Cited by 267
Detecting anomalies in network traffic using maximum entropy estimation
Gu, Y., McCallum, A., & Towsley, D. (2005) · Proceedings of the 5th ACM SIGCOMM conference on Internet measurement - IMC '05 · doi:10.1145/1330107.1330148 · Cited by 253
Metadata
- Authors
- Wang, H., Zhang, D., & Shin, K. G.
- Venue
- Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 3
- Pages
- 1530-1539
- OpenAlex
- W2127273221
- Cited by
- 568
- References
- 20
- FWCI
- 23.29
- 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.