Fast and scalable pattern matching for content filtering

2005 Symposium on Architectures for Networking and Communications Systems, ANCS 2005

Volumn , Issue , 2005, Pages 183-192

  Dharmapurikar, Sarang ^a   Lockwood, John ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

Bloom filters; Content filtering; Network intrusion detection; Pattern matching

Indexed keywords

AHO-CORASICK ALGORITHMS; ANALYSIS AND SIMULATION; BLOOM FILTERS; CONTENT FILTERING; EMBEDDED MEMORIES; HIGH-SPEED; MEMORY ACCESS; MULTI-PATTERN MATCHING; NETWORK INTRUSION DETECTION; ON CHIP MEMORY; PACKET CONTENTS; PACKET PROCESSING; PATTERN LENGTH; PATTERN MATCHING ALGORITHMS; PERFORMANCE BOTTLENECKS; SCALABILITY ISSUE; SPECIALIZED HARDWARE;

ALGORITHMS; BLOOMS (METAL); INTERNET; INTRUSION DETECTION;

PATTERN MATCHING;

EID: 34548370404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ANCS.2005.4675278     Document Type: Conference Paper

References (13)

1. http://www.snort.org.
2. A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Commun. ACM, 18(6):333-340, 1975.
3. Z. K. Baker and V. K. Prasanna. Time and area efficient pattern matching on FPGAs. In Proceeding of the 2004 ACM/SIGDA 12th International Symposium on Field Programmable Gate Arrays, pages 223-232. ACM Press, 2004.
4. B. Bloom. Space/time trade-offs in hash coding with allowable errors. ACM, 13(7):422-426, May 1970.
5. Y. Cho and W. Mangione-Smith. Fast reconfiguring deep packet filter for 1+ Gigabit network. In IEEE Symposium on Field-Programmable Custom Computing Machines, (FCCM), Napa, CA, Apr. 2005.
6. C. R. Clark and D. E. Schimmel. Scalable multi-pattern matching on high-speed networks. In IEEE Symposium on Field-Programmable Custom Computing Machines, (FCCM), Napa, CA, Apr. 2004.
7. D. L. Stephen. String Searching Algorithms. In Lectures Notes Series on Computing, volume 3, 1994.
8. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. W. Lockwood. Deep packet inspection using parallel Bloom filters. In IEEE Symposium on High Performance Interconnects (HotI), Stanford, CA, Aug. 2003.
9. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281-293, 2000. (Pubitemid 30893632)
10. I. Sourdis and D. Pnevmatikatos. Pre-decoded CAMs for efficient and high-speed NIDS pattern matching. In IEEE Symposium on Field-Programmable Custom Computing Machines, (FCCM), Napa, CA, Apr. 2004.
11. Y. Sugawara, M. Inaba, and K. Hiraki. Over 10 Gbps string matching mechanism for multi-stream packet scanning systems. In Field Programmable Logic and Application: 14th International Conference, FPL, Antwerp, Belgium, Aug. 2004. Springer-Verlag.
12. N. Tuck, T. Sherwood, B. Calder, and G. Varghese. Deterministic memory-efficient string matching algorithms for intrusion detection. In IEEE Infocom, Hong Kong, China, Mar. 2004.
13. F. Yu, R. Katz, and T. V. Lakshman. Gigabit rate packet pattern-matching using TCAM. In IEEE International Conference on Network Protocols (ICNP), Berlin, Germany, Oct. 2004.