Sciweavers

Share
RAID
2009
Springer

Multi-byte Regular Expression Matching with Speculation

12 years 4 months ago
Multi-byte Regular Expression Matching with Speculation
Intrusion prevention systems determine whether incoming traffic matches a database of signatures, where each signature in the database represents an attack or a vulnerability. IPSs need to keep up with ever-increasing line speeds, which leads to the use of custom hardware. A major bottleneck that IPSs face is that they scan incoming packets one byte at a time, which limits their throughput and latency. In this paper, we present a method for scanning multiple bytes in parallel using speculation. We break the packet in several chunks, opportunistically scan them in parallel and if the speculation is wrong, correct it later. We present algorithms that apply speculation in single-threaded software running on commodity processors as well as algorithms for parallel hardware. Experimental results show that speculation leads to improvements in latency and throughput in both cases. Key words: low latency, parallel pattern matching, regular expressions, speculative pattern matching, multi-byte, ...
Daniel Luchaup, Randy Smith, Cristian Estan, Somes
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where RAID
Authors Daniel Luchaup, Randy Smith, Cristian Estan, Somesh Jha
Comments (0)
books