Title: Bloom Filter Array: A Novel Data Structure

 

Abstract: 

In recent years, Distributed Denial-of-Service (DDoS) 
attacks have become a major security threat to Internet 
services. How to detect and defend against DDoS attacks 
is currently a hot topic in both industry and academia. 
We developed an anti-DDoS system which uses a feature 
residing in per-flow traffic. We proposed a novel data 
structure to efficiently maintain and process the extracted 
features. Originating from Bloom Filter, the data structure 
is suitable for high speed, large volume network traffic 
processing. The key philosophy is to trade a small amount 
of accuracy for much better space and time complexity. The 
topic of the talk is composed of 1) description of DDoS 
attack and the feature we use; 2) the novel data structure 
and the algorithms to operate the data structure; 3) its 
performance. Specifically, one case study shows that, for 
a fixed time complexity, the conventional algorithm requires 
1.36G memory and our data structure requires only 51.2M memory, 
at the cost of losing 1% detection accuracy.

 

Biography:

Jieyan Fan received B.S. and M.S. in Electrical Engineering 
from Shanghai Jiaotong University, Shanghai, China, in 2001 
and 2004, respectively. He is pursuing Ph.D. in Electrical 
and Computer Engineering in University of Florida, Gainesville, 
FL. His research interests are in the areas of information and 
network security.