Ficara D, Giordano S, Procissi G, et al.An improved DFA for fast regular expression matching[J].ACM SIGCOMM Computer Communication Review, 2008, 38(5):29-40.
[2]
Becchi M, Cadambi S.Memory-efficient regular expression search using state merging[A].Proceedings of IEEE INFOCOM 2007[C].Anchorage:IEEE Press, 2007.1064-1072.
[3]
Qi Y, Wang K, Fong J, et al.Feacan:Front-end acceleration for content-aware network processing[A].INFOCOM, 2011 Proceedings IEEE[C].Shanghai:IEEE Press, 2011.2114-2122.
[4]
Liu Tingwen.An efficient regular expressions compression algorithm from a new perspective[A].INFOCOM, 2011 Proceedings IEEE[C].Shanghai:IEEE Press, 2011.2129-2137.
[5]
Yu F, et al.Fast and memory-efficient regular expression matching for deep packet inspection[A].Proceedings of ACM/IEEE ANCS 2006[C].San Jose:ACM Press, 2006.93-102.
[6]
Becchi M, Crowley P.A hybrid finite automaton for practical deep packet inspection[A].Proceedings of ACM CoNEXT Conference[C].New York:ACM Press, 2007.1-12.
[7]
Kumar S, et al.Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia[A].Proceedings of ACM/IEE ANCS 2007[C].Orlando:IEEE Press, 2007.155-164.
[8]
Smith R, Estan C, Jha S, et al.Fast signature matching using extended finite automaton(XFA)[A].ICISS''08[C].Heidelberg:Springer-Verlag, 2008.158-172.
[9]
徐乾, 等.深度包检测中一种高效的正则表达式压缩算法[J].软件学报, 2009, 20(8):2214-2226. Xu Qian, et al.Efficient regular expression compression algorithm for deep packet inspection[J].Journal of Software, 2009, 20(8):2214-2226.(in Chinese)
Hopcroft J E, Ullman J D.Introduction to Automata Theory, Languages and Computation[M].2nd Edition.US:Addison Wesley, 2001.201-203.
[12]
张树壮, 罗浩, 方滨兴.面向网络安全的正则表达式匹配技术[J].软件学报, 2011, 22(8):1838-1853. Zhang Shu-zhuang, Luo Hao, Fang Bin-xing.Regular expression matching for network security[J].Journal of Software, 2011, 22(8):1838-1853.(in Chinese)
[13]
Kumar S, et al.Algorithms to accelerate multiple regular expressions matching for deep packet inspection[A].Proceedings of ACM SIGCOMM 2006[C].Pisa:ACM Press, 2006.339-350.
