TCAM-based DFA deflation: a novel approach to fast and scalable regular expression matching

Authors:
Kunyang Peng;Qunfeng Dong;Min Chen
Affiliations:
University of Science and Technology of China, Hefei, Anhui, China;University of Science and Technology of China, Hefei, Anhui, China;University of Science and Technology of China, Suzhou, Jiangsu, China
Venue:
Proceedings of the Nineteenth International Workshop on Quality of Service
Year:
2011

Citing 4
Cited 4

Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
An improved algorithm to accelerate regular expression evaluation

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
XFA: Faster Signature Matching with Extended Automata

SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Fast regular expression matching using small TCAMs for network intrusion detection and prevention systems

USENIX Security'10 Proceedings of the 19th USENIX conference on Security

Chain-Based DFA Deflation for Fast and Scalable Regular Expression Matching Using TCAM

Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
GPU-based NFA implementation for memory efficient high speed regular expression matching

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
TCAM-based NFA implementation

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Multi-character cost-effective and high throughput architecture for content scanning

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regular expression matching is the foundation of many network functions including intrusion detection, worm detection, traffic analysis and so on, where known patterns such as worm fingerprints are characterized using regular expressions and searched in network traffic for pattern match. As the quantity and diversity of known patterns keep increasing, regular expression pattern sets have rapidly grown in both size and complexity, while having to be matched in network traffic at accelerating wire speeds. Fast and scalable regular expression matching, therefore, is fundamental to the development of practical network systems.