[1]Kumar S, Dharmapurikar S, Yu Fang, et al. Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection[C]//Proc. of 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Commu- nications. New York, USA: [s. n.], 2006. [2]Kumar S, Turner J, Williams J. Advanced Algorithms for Fast and Scalable Deep Packet Inspection[C]//Proc. of 2006 ACM/IEEE Symposium on Architectures for Networking and Communications Systems. New York, USA: ACM Press, 2006. [3]Ficara D, Giordana S, Procissig G, et al. An Improved DFA for Fast Regular Expression Matching[J]. Computer Communication Review, 2008, 38(5): 29-40. [4]Becchi M, Crowley P. A Hybrid Finite Automaton for Practical Deep Packet Inspection[C]//Proc. of the International Conference on Emerging Networking Experiments and Technologies. New York, USA: [s. n.], 2007. [5]刘 鹏, 姚 远, 邰 铭, 等. 一种高效匹配PCRE的扩展自动机[J]. 计算机工程, 2010, 36(12): 39-42. [6]Becchi M, Crowley P. An Improved Algorithm to Accelerate Regular Expression Evaluation[C]//Proc. of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems. New York, USA: ACM Press, 2007. [7]Kong S, Smith R, Estan C. Efficient Signature Matching with Multiple Alphabet Compression Tables[C]//Proc. of the 4th International Conference on Security and Privacy in Communication. New York, USA: [s. n.], 2008. [8]Yu Fang, Chen Zhifeng, Diao Yanlei, et al. Fast and Memory-efficient Regular Expression Matching for Deep Packet Inspection[C]//Proc. of 2006 ACM/IEEE Symposium on Architectures for Networking and Communications Systems. San Jose, USA: ACM Press, 2006. [9]Jain S, Swamy C, Balaji K. Greedy Algorithms for k-way Graph Partitioning[C]//Proc. of the 6th International Conference on Advanced Computing. Pune, India: [s. n.], 1998.
|