CompactDFA: Scalable Pattern Matching Using Longest Prefix Match Solutions

@article{BremlerBarr2014CompactDFASP,
  title={CompactDFA: Scalable Pattern Matching Using Longest Prefix Match Solutions},
  author={Anat Bremler-Barr and David Hay and Yaron Koral},
  journal={IEEE/ACM Transactions on Networking},
  year={2014},
  volume={22},
  pages={415-428}
}
A central component in all contemporary intrusion detection systems (IDSs) is their pattern matching algorithms, which are often based on constructing and traversing a deterministic finite automaton (DFA) that represents the patterns. While this approach ensures deterministic time guarantees, modern IDSs need to deal with hundreds of patterns, thus requiring to store very large DFAs, which usually do not fit in fast memory. This results in a major bottleneck on the throughput of the IDS, as… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS
13 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

CompactDFA: Scalable pattern matching using longest prefix match solutions

  • A. Bremler-Barr, D. Hay, Y. Koral
  • The Hebrew University, Jerusalem, Israel, Tech…
  • 2012
Highly Influential
4 Excerpts

TCAMimic

  • A. Bremler-Barr, D. Hay, A. Mor
  • 2012 [Online]. Available: http://www.faculty.idc…
  • 2012
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…