Fast and memory-efficient regular expression matching for deep packet inspection

By Fang Yu, Z. Chen, Yanlei Diao, T. V. Lakshman, Randy Howard Katz. 2006 Symposium on Architecture For Networking And Communications Systems, 2006

509 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/6408891eea6af794dadd16f35485bc1c73473adc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Jonathan S. Turner
2. P. Crowley
3. Yanlei Diao
4. S. Sushanth Kumar
5. Fang Yu
6. Sarang Dharmapurikar
7. Jennifer Rexford
8. Raouf Boutaba

In Hardware and Architecture

1. Jonathan S. Turner
2. P. Crowley
3. S. Sushanth Kumar
4. Fang Yu
5. Sarang Dharmapurikar

Citations in the corpus

• Efficient pattern matching over event streams (2008, background): “However, we did not choose to compare to NIDS because reg­ular expressions can express only a subset of event queries, as stated in §3.3, and most NIDS use deterministic .nite automata (DFA) that would explode to an exponential size when handling non-determinism [35], which abound in event querie”
• Algorithms to accelerate multiple regular expressions matching for deep packet inspection (2006, methodology): “In this context, Yu et al. [10] have proposed an efficient algorithm to partition a large set of regular expressions into multiple groups, such that overall space needed by the automata is reduced dramatically.”