Name
Title | ||
|---|---|---|
FREME: A pattern partition based engine for fast and scalable regular expression matching in practice |
Abstract | ||
|---|---|---|
Regular expression matching has been widely used in modern content-aware network devices, where the content of interest (i.e., patterns) is often specified by regular expressions. Due to the ever-increasing number of patterns, implementing fast and scalable regular expression matching becomes a big challenge. Practical solutions rely mainly on a variety of deterministic finite automata (DFA) deflation techniques, but cannot guarantee both high speed and linear scalability simultaneously. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jnca.2015.05.012 | Journal of Network and Computer Applications |
Keywords | Field | DocType |
Regular expression matching,Deep inspection,Pattern partition,Deterministic finite automata (DFA) | Regular expression,Deterministic finite automaton,Computer science,Correctness,Networking hardware,Syntagmatic analysis,Algorithm,Theoretical computer science,DFA minimization,Partition (number theory),Scalability | Journal |
Volume | ISSN | Citations |
55 | 1084-8045 | 1 |
PageRank | References | Authors |
0.36 | 26 | 2 |