TY - GEN
T1 - Towards fast regular expression matching in practice
AU - Wang, Kai
AU - Li, Jun
PY - 2013
Y1 - 2013
N2 - Regular expression matching is popular in today's network devices with deep inspection function, but due to lack of algorithmic scalability, it is still the performance bottleneck in practical network processing. To address this problem, our method first partition regular expression patterns into simple segments to avoid state explosion, and then compile these segments into a compact data structure to achieve fast matching. Preliminary experiments illustrate that our matching engine scales linearly with the size of the real-world pattern set, and outperforms state-of-the-art solutions.
AB - Regular expression matching is popular in today's network devices with deep inspection function, but due to lack of algorithmic scalability, it is still the performance bottleneck in practical network processing. To address this problem, our method first partition regular expression patterns into simple segments to avoid state explosion, and then compile these segments into a compact data structure to achieve fast matching. Preliminary experiments illustrate that our matching engine scales linearly with the size of the real-world pattern set, and outperforms state-of-the-art solutions.
KW - deep inspection
KW - dfa
KW - regular expression matching
UR - https://www.scopus.com/pages/publications/84891609880
U2 - 10.1145/2534169.2491705
DO - 10.1145/2534169.2491705
M3 - 会议稿件
AN - SCOPUS:84891609880
SN - 9781450320566
T3 - Computer Communication Review
SP - 531
EP - 532
BT - Proceedings of the SIGCOMM 2013 and Best Papers of the Co-Located Workshops
T2 - Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM SIGCOMM 2013
Y2 - 12 August 2013 through 16 August 2013
ER -