Name
Abstract | ||
|---|---|---|
Finite state automata are widely used in firewalls, data detection and content audit systems to match complex sets of regular expressions in network packets. However, with the continuous increase in the types of network contents and network traffics in recent years, the deep packet inspection systems based on finite state automata also require regular engines for less memory consumption and higher operating speed. This paper analyzes the feature and problem of finite state automata and improves non-deterministic finite automata by reducing the conversion edge to reduce the memory usage. The experiment results which are made by real-world dataset show that the memory usage is reduced more than half. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s11227-018-2685-y | The Journal of Supercomputing |
Keywords | Field | DocType |
Regular expression, NFA, Conversion edges, Deep packet inspection | Deep packet inspection,Regular expression,Data stream,Data detection,Computer science,Parallel computing,Network packet,Operating speed,Finite-state machine,Computer engineering,Content audit | Journal |
Volume | Issue | ISSN |
75.0 | SP8.0 | 1573-0484 |
Citations | PageRank | References |
0 | 0.34 | 20 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chunyong Yin | 1 | 32 | 2.93 |
| Hong-Yi Wang | 2 | 12 | 9.53 |
| Xiang Yin | 3 | 0 | 0.34 |
| Ruxia Sun | 4 | 31 | 4.24 |
| jin wang | 5 | 243 | 36.79 |