Implementation results of Bloom filters for string matching

Proceedings - 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2004

Volumn , Issue , 2004, Pages 322-323

  Attig, Michael ^a   Dharmapurikar, Sarang ^a   Lockwood, John ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM ENGINES; BLOOM FILTERS; STRING MATCHING; XILINX;

COMPUTER SOFTWARE; FIELD PROGRAMMABLE GATE ARRAYS; INTERNET; NETWORKS (CIRCUITS); RANDOM ACCESS STORAGE; TELECOMMUNICATION TRAFFIC; VECTORS;

PACKET NETWORKS;

EID: 18644368071     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FCCM.2004.41     Document Type: Conference Paper

References (3)

1. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, July 1970.
2. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. W. Lockwood. Deep packet inspection using parallel bloom filters. In Hot Interconnects, pages 44-51, Stanford, CA, Aug. 2003.
3. M. Roesch. SNORT - lightweight intrusion detection for networks. In LISA '99: USENIX 13th Systems Administration Conference, Seattle, Washington, Nov. 1999.