Sciweavers

Share
ICCCN
2007
IEEE

Bloom Filter Accelerator for String Matching

11 years 7 months ago
Bloom Filter Accelerator for String Matching
— In this paper we present a hardware architecture for string matching. Our solution based on using a Bloom filter based pre-processor and a parallelized hashing engine is capable of handling wire line speeds with zero false-positive probability. String matching modules are extensively used in the network security domain especially in network intrusion detection systems where they are required to operate at wire line speeds. Our analysis shows that our system is capable of matching 16000 strings and achieves throughput in excess of 100Gbps (i.e. capable of handling 10 OC −192 links comfortably).
M. Nourani, P. Katta
Added 03 Jun 2010
Updated 03 Jun 2010
Type Conference
Year 2007
Where ICCCN
Authors M. Nourani, P. Katta
Comments (0)
books