A Scalable Hybrid Regular Expression Pattern Matcher

  • Authors:
  • James Moscola;Young H. Cho;John W. Lockwood

  • Affiliations:
  • Washington University, St. Louis, Missouri;Washington University, St. Louis, Missouri;Washington University, St. Louis, Missouri

  • Venue:
  • FCCM '06 Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

As new Internet technologies emerge, the ability to do full regular expression pattern matching on network packets to support these new technologies is becoming increasingly important. Current technologies that can benefit from high-speed pattern matching are firewalls, network intrusion detection systems, virus scanners, spam filters, and content-based routers. All of these technologies are ruled-based scanners which have rule sets that are continually increasing in size. In combination with increasing network speeds, it is becoming difficult for software based approaches to maintain the required network throughput. Thus is it important to develop high-speed hardware-based pattern matchers. We present a reconfigurable hardware architecture for searching for regular expression patterns in streaming data. This new architecture is created by combining two popular pattern matching techniques: a pipelined character grid architecture [1], and a regular expression NFA architecture [2, 3, 4]. The resulting hybrid architecture can scale the number of input characters while still maintaining the ability to scan for regular expression patterns.