1Dharmapurikar S,Lockwood J.Fast and scalable pattern matching for content filtering. In:Berenbaum A,ed Proc.of the 2005 Symp.on Architecture for Networking and Communications Systems.New York:ACM Press,2005 183-192.
1AHO A V, CORASICK M J. Efficient string matching: an aid to bibliographie search [ J ]. Communications of the ACM, 1975,18 ( 6 ) : 333- 340.
2TAN Lin, SHERWOOD T. A high throughput string matching architecture for intrusion detection and prevention [ C]//Proc of the 32nd International Symposium on Computer Architecture. 2005 : 112-122.
3DHARMAPURIKAR S, LOCKWOOD J. Fast and scalable pattern matching for network intrusion detection systems[ J ]. IEEE Journal on Selected Areas in Communications, 2006,24 ( 10 ) : 1781- 1792.
4PIYACHON P,LUO Yah. Design of high performance pattern marching engine through compact deterministic finite automata[ C ]//Proc of the 45th Annual Design Automation Conference. New York: ACM Press, 2008 : 852 - 857.
5TUCK N, SHERWOOD T,CALDER T, et al. Deterministic memory- efficient string matching algorithms for intrusion detection [ C ]//Proc of the 23rd Annual Joint Conference of IEEE Computer and Communications Societies. New Jersey:IEEE Press,2004:2628-2639.
