A high throughput string matching architecture for intrusion detection and prevention

By Lin Tan, Timothy Sherwood. International Symposium on Computer Architecture, 2005

316 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/298200e51b00500b578c7758b8c62091667ee8c9

How researchers see this paper

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

In Artificial Intelligence

1. Jonathan S. Turner
2. P. Crowley
3. S. Sushanth Kumar
4. Fang Yu
5. Sarang Dharmapurikar
6. Z. Chen
7. Tao Qin
8. Xu Tan

In Computer Networks and Communications

1. Jonathan S. Turner
2. T. V. Lakshman
3. P. Crowley
4. Yanlei Diao
5. S. Sushanth Kumar
6. Fang Yu
7. Sarang Dharmapurikar
8. Randy Howard Katz

In Hardware and Architecture

1. Jonathan S. Turner
2. T. V. Lakshman
3. P. Crowley
4. S. Sushanth Kumar
5. Fang Yu
6. Sarang Dharmapurikar
7. Z. Chen
8. Randy Howard Katz

Citations in the corpus

• Algorithms to accelerate multiple regular expressions matching for deep packet inspection (2006, methodology): “In [12] Tan et al. propose an efficient algorithm that converts an Aho-Corasick automaton into multiple binary state machines, thereby reducing the space requirements.”
• Fast and memory-efficient regular expression matching for deep packet inspection (2006, background): “On the other hand, although many schemes for fast string matching [4-11] have been developed recently in intrusion detection systems, they focus on explicit string patterns only and can not be easily extended to fast regular expression matching.”