poster

ParaRegex: Towards Fast Regular Expression Matching in Parallel

Authors:

Zhe Fu,

Zhi Liu, and

Jun LiAuthors Info & Claims

ANCS '16: Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems

March 2016

Pages 113 - 114

https://doi.org/10.1145/2881025.2889478

Published: 17 March 2016 Publication History

Get Access

Abstract

In this paper, we propose ParaRegex, a novel approach for fast parallel regular expression matching. ParaRegex is a framework that implements data-parallel regular expression matching for deterministic finite automaton based methods. Experimental evaluation shows that ParaRegex produces a fast matching engine with speeds of up to 6 times compared to sequential implementations on a commodity 8-thread workstation.

References

[1]

J. Holub and S. Stekr. On parallel implementations of deterministic finite automata. In Implementation and Application of Automata, pages 54--64, 2009.

Digital Library

Google Scholar

[2]

Y. Ko, M. Jung, Y.-S. Han, and B. Burgstaller. A speculative parallel dfa membership test for multicore, simd and cloud computing environments. International Journal of Parallel Programming, 42(3):456--489, 2014.

Digital Library

Google Scholar

[3]

R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the ACM (JACM), 27(4):831--838, 1980.

Digital Library

Google Scholar

[4]

Regular expression processor. http://regex.wustl.edu/.

Google Scholar

[5]

M. Becchi and P. Crowley. An improved algorithm to accelerate regular expression evaluation. In Proceedings of the 3rd ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), pages 145--154, 2007.

Digital Library

Google Scholar

Index Terms

ParaRegex: Towards Fast Regular Expression Matching in Parallel
1. Networks
  1. Network algorithms
    1. Data path algorithms
      1. Deep packet inspection

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 ...
Read More
Spectral clustering based regular expression grouping
ANCS '14: Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systems

Regular 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, ...
Read More
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 Systems

Regular 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 ...
Read More

Comments

Information & Contributors

Information

Published In

ANCS '16: Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems

March 2016

148 pages

ISBN:9781450341837

DOI:10.1145/2881025

General Chair:
Patrick Crowley
Washington University in St. Louis, USA
,
Program Chairs:
Luigi Rizzo
Università di Pisa, Italy
,
Laurent Mathy
Université de Liège, Belgium

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 March 2016

Check for updates

Author Tags

Qualifiers

Poster

Conference

ANCS '16

Sponsor:

ANCS '16: Symposium on Architectures for Networking and Communications Systems

March 17 - 18, 2016

California, Santa Clara, USA

Acceptance Rates

ANCS '16 Paper Acceptance Rate 12 of 58 submissions, 21%;

Overall Acceptance Rate 88 of 314 submissions, 28%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
131
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author 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.

Index Terms

Recommendations

Regex matching with counting-set automata

Spectral clustering based regular expression grouping

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

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Login options

Full Access

PDF

eReader

Abstract

References

Index Terms

Recommendations

Regex matching with counting-set automata

Spectral clustering based regular expression grouping

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

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations