Cumulative Sum Algorithm for Detecting SYN Flooding Attacks
Tongguang Zhang

TL;DR
This paper introduces a lightweight, non-parametric cumulative sum algorithm to effectively detect SYN flooding attacks, demonstrating high detection accuracy through experiments with real attack data.
Contribution
The paper presents a novel non-parametric cumulative sum method specifically designed for efficient SYN flooding attack detection.
Findings
High detection accuracy on real attack data
Effective in real-time detection scenarios
Lightweight computational requirements
Abstract
SYN flooding attacks generate enormous packets by a large number of agents and can easily exhaust the computing and communication resources of a victim within a short period of time. In this paper, we propose a lightweight method for detecting SYN flooding attack by non-parametric cumulative sum algorithm. We experiment with real SYN flooding attack data set in order to evaluate our method. The results show that our method can detect SYN flooding attack very well.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Security and Intrusion Detection · Advanced Malware Detection Techniques · Internet Traffic Analysis and Secure E-voting
