Implementation results of bloom filters for string matching

被引:29
作者
Attig, M [1 ]
Dharmapurikar, S [1 ]
Lockwood, J [1 ]
机构
[1] Washington Univ, Appl Res Lab, St Louis, MO 63130 USA
来源
12TH ANNUAL IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS | 2004年
关键词
D O I
10.1109/FCCM.2004.41
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Network Intrusion Detection and Prevention Systems (IDPS) use string matching to scan Internet packets for malicious content. Bloom filters offer a mechanism to search for a large number of strings efficiently and concurrently when implemented with Field Programmable Gate Array (FPGA) technology. A string matching circuit has been implemented within the FPX platform using Bloom filters. Using 155 block RAMs on a single Xilinx VirtexE 2000 FPGA, the circuit scans for 35,475 unique signatures.
引用
收藏
页码:322 / 323
页数:2
相关论文
共 3 条
[1]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[2]  
Dharmapurikar S, 2003, HOT INTERCONNECTS 11, P44
[3]  
Roesch Martin, 1999, LISA 99