FEACAN: Front-end acceleration for content-aware network processing
暂无分享,去创建一个
Viktor K. Prasanna | Kai Wang | Yibo Xue | Yaxuan Qi | Weirong Jiang | Jun Li | Jeffrey Fong | V. Prasanna | Y. Xue | Yaxuan Qi | Jun Li | Kai Wang | Weirong Jiang | Jeffrey Fong
[1] Viktor K. Prasanna,et al. Fast Regular Expression Matching Using FPGAs , 2001, The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'01).
[2] Ron K. Cytron,et al. A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching , 2006, 33rd International Symposium on Computer Architecture (ISCA'06).
[3] George Varghese,et al. Deterministic memory-efficient string matching algorithms for intrusion detection , 2004, IEEE INFOCOM 2004.
[4] Michela Becchi,et al. Evaluating regular expression matching engines on network and general purpose processors , 2009, ANCS '09.
[5] Jeffrey D. Ullman,et al. The compilation of regular expressions into integrated circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[6] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.
[7] Patrick Crowley,et al. A hybrid finite automaton for practical deep packet inspection , 2007, CoNEXT '07.
[8] Jonathan S. Turner,et al. Advanced algorithms for fast and scalable deep packet inspection , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.
[9] Baohua Yang,et al. Towards high-performance flow-level packet processing on multi-core network processors , 2007, ANCS '07.
[10] Vern Paxson,et al. Enhancing byte-level network intrusion detection signatures with context , 2003, CCS '03.
[11] Patrick Crowley,et al. An improved algorithm to accelerate regular expression evaluation , 2007, ANCS '07.
[12] Somesh Jha,et al. Deflating the big bang: fast and scalable deep packet inspection with extended finite automata , 2008, SIGCOMM '08.
[13] Viktor K. Prasanna,et al. Multi-Core Architecture on FPGA for Large Dictionary String Matching , 2009, 2009 17th IEEE Symposium on Field Programmable Custom Computing Machines.
[14] Christopher R. Clark,et al. Efficient Reconfigurable Logic Circuits for Matching Complex Network Intrusion Detection Patterns , 2003, FPL.
[15] Patrick Crowley,et al. Algorithms to accelerate multiple regular expressions matching for deep packet inspection , 2006, SIGCOMM.
[16] T. V. Lakshman,et al. Fast and memory-efficient regular expression matching for deep packet inspection , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.
[17] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[18] Somesh Jha,et al. XFA: Faster Signature Matching with Extended Automata , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[19] George Varghese,et al. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia , 2007, ANCS '07.
[20] Girija J. Narlikar,et al. Fast incremental updates for pipelined forwarding engines , 2005, IEEE/ACM Transactions on Networking.
[21] M. W. Shields. An Introduction to Automata Theory , 1988 .
[22] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .