A fast regular expression matching algorithm for Deep Packet Inspection
暂无分享,去创建一个
Qing Yao | Shuqiao Chen | Lei Guo | Yadi Wang | Yuxian Jian
[1] T. V. Lakshman,et al. Variable-Stride Multi-Pattern Matching For Scalable Deep Packet Inspection , 2009, IEEE INFOCOM 2009.
[2] Srihari Cadambi,et al. Memory-Efficient Regular Expression Search Using State Merging , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[3] H. Jonathan Chao,et al. Boundary Hash for Memory-Efficient Deep Packet Inspection , 2008, 2008 IEEE International Conference on Communications.
[4] H. Jonathan Chao,et al. Highly Memory-Efficient LogLog Hash for Deep Packet Inspection , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[5] George Varghese,et al. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia , 2007, ANCS '07.
[6] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..
[7] H. Jonathan Chao,et al. TriBiCa: Trie Bitmap Content Analyzer for High-Speed Network Intrusion Detection , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[8] Stamatis Vassiliadis,et al. Scalable Multigigabit Pattern Matching for Packet Inspection , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[9] John W. Lockwood,et al. Deep packet inspection using parallel bloom filters , 2004, IEEE Micro.
[10] Wei Zhang,et al. A Memory Efficient Multiple Pattern Matching Architecture for Network Security , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[11] Ralph C. Merkle,et al. Protocols for Public Key Cryptosystems , 1980, 1980 IEEE Symposium on Security and Privacy.
[12] Dafang Zhang,et al. A Regular Expression Matching Algorithm Using Transition Merging , 2009, 2009 15th IEEE Pacific Rim International Symposium on Dependable Computing.
[13] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[14] Stefano Giordano,et al. Faster DFAs through Simple and Efficient Inverse Homomorphisms , 2009, IEEE INFOCOM 2009.