.png){kind=icon}
.png){kind=icon}
Return
Speculative Parallel Pattern Matching
.png){kind=icon}
OA
AI
DOI：10.1109/TIFS.2011.2112647.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Intrusion prevention systems (IPSs) determine whether incoming traffic matches a database of signatures, where each signature is a regular expression and represents an attack or a vulnerability. IPSs need to keep up with ever-increasing line speeds, which has lead 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 to search for arbitrary regular expressions by 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.
Keywords:
Low latency
multibyte
multibyte matching
parallel pattern matching
parallel regular expression matching
regular expressions
speculative pattern matching
Journal
IF:
8
Papers:
5.2K
Citations:
2.3W
