Regular expression matching technology with two-stage memory
To solve the contradiction between the memory requirement and the inspection performance, a matching en-gine with two-stage memory was proposed for the first time. To deploy the state table to two-stage memory, theories of Markov chain was applied to the FSA. By computing the steady vector, the rand...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-06-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.06.007/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539716163305472 |
|---|---|
| author | Shu-hui CHEN Cheng-cheng XU |
| author_facet | Shu-hui CHEN Cheng-cheng XU |
| author_sort | Shu-hui CHEN |
| collection | DOAJ |
| description | To solve the contradiction between the memory requirement and the inspection performance, a matching en-gine with two-stage memory was proposed for the first time. To deploy the state table to two-stage memory, theories of Markov chain was applied to the FSA. By computing the steady vector, the random access probabilities of each state could be obtained. Further, the states with higher probabilities were deployed in the embedded memory of FPGA, and the states with lower probabilities were deployed in SRAM. Rules in L7-filter were tested in simulation experiments, and the results show that our method can reach a throughput of 33 Gbit/s in large scale FSA, which is 50 times than that of ar-ranging the whole state table in SRAM. |
| format | Article |
| id | doaj-art-2a6ec55409bb459da96f51892c74ee40 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2014-06-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-2a6ec55409bb459da96f51892c74ee402025-01-14T06:43:30ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-06-0135475559681974Regular expression matching technology with two-stage memoryShu-hui CHENCheng-cheng XUTo solve the contradiction between the memory requirement and the inspection performance, a matching en-gine with two-stage memory was proposed for the first time. To deploy the state table to two-stage memory, theories of Markov chain was applied to the FSA. By computing the steady vector, the random access probabilities of each state could be obtained. Further, the states with higher probabilities were deployed in the embedded memory of FPGA, and the states with lower probabilities were deployed in SRAM. Rules in L7-filter were tested in simulation experiments, and the results show that our method can reach a throughput of 33 Gbit/s in large scale FSA, which is 50 times than that of ar-ranging the whole state table in SRAM.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.06.007/regular expressionMarkov chaintwo-stage memoryhybrid FA |
| spellingShingle | Shu-hui CHEN Cheng-cheng XU Regular expression matching technology with two-stage memory Tongxin xuebao regular expression Markov chain two-stage memory hybrid FA |
| title | Regular expression matching technology with two-stage memory |
| title_full | Regular expression matching technology with two-stage memory |
| title_fullStr | Regular expression matching technology with two-stage memory |
| title_full_unstemmed | Regular expression matching technology with two-stage memory |
| title_short | Regular expression matching technology with two-stage memory |
| title_sort | regular expression matching technology with two stage memory |
| topic | regular expression Markov chain two-stage memory hybrid FA |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.06.007/ |
| work_keys_str_mv | AT shuhuichen regularexpressionmatchingtechnologywithtwostagememory AT chengchengxu regularexpressionmatchingtechnologywithtwostagememory |