loading...
Scalable Pattern Matching for High Speed Networks
Napa, California April 20-April 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FCCM.2004.5012th Annual IEEE Symposium on Field-P ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Christopher R. Clark, Georgia Institute of Technology, Atlanta, GA
David E. Schimmel, Georgia Institute of Technology, Atlanta, GA
In this paper, we present a scalable FPGA design methodology for searching network packet payloads for a large number of patterns, including complex regular expressions. The efficiency of the technique enables a current-generation FPGA device to support pattern-matching at network rates from 1 Gbps to 100 Gbps and beyond. It offers flexible trade-offs between character capacity, throughput, and data bus width and rate. This allows the approach to be used in a wide range of devices from low-end home network appliances to high-end backbone routers. Suitable network applications for the FPGA pattern-matcher include firewalls, network intrusion detection, email virus scanning, and junk-email identification. In this work, we use a standard set of patterns from an intrusion detection system to demonstrate the performance and scalability of our design with a real-world application.
Citation:
Christopher R. Clark, David E. Schimmel, "Scalable Pattern Matching for High Speed Networks," fccm, pp.249-257, 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.