ParaRegex: Towards Fast Regular Expression Matching in Parallel
Abstract
References
Index Terms
- ParaRegex: Towards Fast Regular Expression Matching in Parallel
Recommendations
Regex matching with counting-set automata
We propose a solution to the problem of efficient matching regular expressions (regexes) with bounded repetition, such as (ab){1,100}, using deterministic automata. For this, we introduce novel counting-set automata (CsAs), automata with registers that ...
Spectral clustering based regular expression grouping
ANCS '14: Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systemsRegular expression matching has been playing an import role in today's network security systems with deep inspection function. However, compiling a set of regular expressions into one Deterministic Finite Automata (DFA) often leads to state explosion, ...
Chain-Based DFA Deflation for Fast and Scalable Regular Expression Matching Using TCAM
ANCS '11: Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications SystemsRegular expression matching is the core engine of many network functions such as intrusion detection, protocol analysis and so on. In spite of intensive research, we are still in need of a method for fast and scalable regular expression matching, where ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/5868351e-09e9-4457-854a-be61af8dc506/2881025.cover.jpg)
- General Chair:
- Patrick Crowley,
- Program Chairs:
- Luigi Rizzo,
- Laurent Mathy
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 131Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in