基于两级存储的正则表达式匹配技术  

Regular expression matching technology with two-stage memory

作　　者：陈曙晖[1] 徐成成[1] 

机构地区：[1]国防科学技术大学计算机学院,湖南长沙410073

出　　处：《通信学报》2014年第6期47-55,63,共10页Journal on Communications

摘　　要：为解决正则表达式匹配中内存需求与检测性能的矛盾,首次提出两级存储的匹配方案。将马尔可夫链理论应用于自动机,通过求解稳态向量,得到各状态被随机访问的概率。将高概率的状态表项配置在FPGA嵌入存储器中,低概率的状态表项配置在SRAM中。使用L7-filter规则集进行实验,吞吐量达到33 Gbit/s,匹配性能比将状态表完全存储在SRAM中提高了50倍。To solve the contradiction between the memory requirement and the inspection performance, a matching engine 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 arranging the whole state table in SRAM.

关 键 词：正则表达式 马尔可夫链 两级存储 混合自动机 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]