High-speed Regular Expression Matching with Pipelined Memory-based Automata

The paper proposes an architecture of a highspeed regular expression (RE) matching system with fast updates of an RE set. The architecture uses highly memoryefficient Delayed Input DFAs ((DFAs)-F-2), which are organized to a processing pipeline. The architecture is designed so that it communicates only locally among its components in order to achieve high frequency even for a large number of parallel matching engines (MEs), which allows scaling throughput to hundreds of gigabits per second (Gbps). The architecture is able to achieve processing throughput of up to 400 Gbps on current FPGA chips.