Deep packet inspection using parallel bloom filters

By Sarang Dharmapurikar, Praveen Krishnamurthy, Todd S. Sproull, John W. Lockwood. IEEE Micro, 2004

694 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/342f198fd93c31344d8634d2792fa71bfd5243b2

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

In Computer Networks and Communications

In Hardware and Architecture

Citations in the corpus

Securing web application code by static analysis and runtime protection (2004, methodology): “Categories and Subject Descriptors D.2.4 [Software Engineering]: Software / Program Verification class invariants, formal methods; D.4.6 [Operating Systems]: Security and Protection information flow controls, correctness proofs, formal methods; K.6.5 [Computing Milieux]: Security and Protection…”
A high throughput string matching architecture for intrusion detection and prevention (2005, background): “FPGA-based: The area that has seen the most amount of string matching research is in the reconfigurable computing community [11, 17, 24, 15, 5, 6, 10, 13, 4, 9, 3].”
Theory and Practice of Bloom Filters for Distributed Systems (2012, background): “One advantage of Bloom filters is that they can be efficiently implemented in hardware and parallelized [87], [45], [88], which can result in high-performance and energyefficient operation.”
An Improved Construction for Counting Bloom Filters (2006, methodology): “Counting Bloom filters have been explicitly used in several papers, including for example [7, 8, 9, 10, 12, 18, 19].”
Deterministic memory-efficient string matching algorithms for intrusion detection (2004, result): “There has also been even more recent work in imprecise string matching algorithms using hashing and signaturebased techniques [13], [ 9 ].”
Algorithms to accelerate multiple regular expressions matching for deep packet inspection (2006, background): “Other work [25] [26] [27] [28] [29] presents several efficient string matching architectures; their performance and space efficiency are well summarized in [14].”
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.”