Bloom Filter Accelerator for String Matching

Author

Nourani, M. ; Katta, P.

Author_Institution

Univ. of Texas at Dallas, Richardson

fYear

2007

fDate

13-16 Aug. 2007

Firstpage

185

Lastpage

190

Abstract

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).

Keywords

string matching; telecommunication security; bloom filter based preprocessor; network intrusion detection; parallelized hashing engine; string matching; wire line speed; Computer security; Costs; Engines; Hardware; Intrusion detection; Matched filters; Pattern matching; Payloads; Throughput; Wire; Bloom filter accelerator; Computer network security; Pattern matching; Security monitoring; String matching;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 2007. ICCCN 2007. Proceedings of 16th International Conference on

Conference_Location

Honolulu, HI

ISSN

1095-2055

Print_ISBN

978-1-4244-1251-8

Electronic_ISBN

1095-2055

Type

conf

DOI

10.1109/ICCCN.2007.4317817

Filename

4317817