Compressing Regular Expression Sets for Deep Packet Inspection
- 1 January 2014
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 394-403
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Fast Regular Expression Matching Using Small TCAMIEEE/ACM Transactions on Networking, 2013
- Reduction of FPGA resources for regular expression matching by relation similarity2011
- Efficient regular expression evaluation2008
- Efficient signature matching with multiple alphabet compression tables2008
- An improved algorithm to accelerate regular expression evaluation2007
- A hybrid finite automaton for practical deep packet inspection2007
- Memory-Efficient Regular Expression Search Using State Merging2007
- Fast and memory-efficient regular expression matching for deep packet inspection2006
- Algorithms to accelerate multiple regular expressions matching for deep packet inspectionACM SIGCOMM Computer Communication Review, 2006
- A Scalable Architecture For High-Throughput Regular-Expression Pattern MatchingACM SIGARCH Computer Architecture News, 2006