A Comparison of SYN Flood Detection Algorithms

  • Authors:
  • Matt Beaumont-Gay

  • Affiliations:
  • UCLA

  • Venue:
  • ICIMP '07 Proceedings of the Second International Conference on Internet Monitoring and Protection
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of detecting distributed denial of ser- vice (DDoS) attacks, and particularly SYN flood at- tacks, has received much attention in current literature. A variety of algorithms for detecting such attacks have been published. Researchers have tested their own algorithms using traces containing real or synthetic attacks, and have reported good results based on those tests. However, the traces used and parameters of the attacks seen or generated vary greatly between published works. This paper compares three published SYN flood detection algorithms using traces collected from the UCLA Computer Science Department network and synthetic attacks in an Emulab network. The algorithms vary significantly in the speed at which they detect the start and end of attacks, their false positive and false negative rates, the types of non- DDoS activity they detect, and other properties. Their qualitative strengths and weaknesses are discussed, and suggestions are made for enhancements.