SEARCH

SEARCH BY CITATION

REFERENCES

  • 1
    Wall L, et al. The perl programming language, 1994.
  • 2
    Flanagan D, Matsumoto Y. The Ruby Programming Language. O'Reilly Media: Sebastopol, California, 2008.
  • 3
    Robbins AD. The gnu awk users guide, 2001.
  • 4
    Ousterhout JK, Jones K. Tcl and the Tk Toolkit, Vol. 221. Addison-Wesley Reading: Boston, Massachusetts, 1994.
  • 5
    Kernighan BW, Ritchie D, Lippman SB, Lajoie J. C programming. Language 2009, In press.
  • 6
    Stroustrup B, Online S. The C++ Programming Language, Vol. 3. Addison-Wesley Reading: Boston, Massachusetts, 1997.
  • 7
    Gosling J, Joy B, Steele G, Bracha G. Java (TM) Language Specification, The (Java (Addison-Wesley)). Addison-Wesley Professional: Boston, Massachusetts, 2005.
  • 8
    Paxson V. Bro: a system for detecting network intruders in real-time. Computer Networks 1999; 31(23-24): 24352463.
  • 9
    Roesch M, et al. Snort-lightweight intrusion detection for networks, Proceedings of the 13th Usenix Conference on System Administration, Seattle, Washington, 1999; 229238.
  • 10
    Baeza-Yates RA, Gonnet GH. Fast text searching for regular expressions or automaton searching on tries. Journal of the ACM (JACM) 1996; 43(6): 915936.
  • 11
    Myers G. A four russians algorithm for regular expression pattern matching. Journal of the ACM (JACM) 1992; 39(2): 432448.
  • 12
    Thompson K. Programming techniques: regular expression search algorithm. Communications of the ACM 1968; 11(6): 419422.
  • 13
    Levandoski J, Sommer E, Strait M, et al. Application layer packet classifier for linux, 2008.
  • 14
    Liu T, Yang Y, Liu Y, Sun Y, Guo L. An efficient regular expressions compression algorithm from a new perspective, 2011 Proceedings IEEE on INFOCOM, IEEE, Shanghai, 2011; 21292137.
  • 15
    Kumar S, Dharmapurikar S, Yu F, Crowley P, Turner J. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. ACM SIGCOMM Computer Communication Review 2006; 36(4): 339350.
  • 16
    Ficara D, Giordano S, Procissi G, Vitucci F, Antichi G, Di Pietro A. An improved DFA for fast regular expression matching. ACM SIGCOMM Computer Communication Review 2008; 38(5): 2940.
  • 17
    Ficara D, Di Pietro A, Giordano S, Procissi G, Vitucci F, Antichi G. Differential encoding of DFAs for fast regular expression matching. IEEE/ACM Transactions on Networking (TON) 2011; 19(3): 683694.
  • 18
    Bai Z. Templates for the Solution of Algebraic Eigenvalue Problems, Society for Industrial Mathematics, vol. 11: Philadelphia, PA, 2000.
  • 19
    Saad Y. Krylov subspace methods on supercomputers. SIAM Journal on Scientific and Statistical Computing 1989; 10(6): 12001232.
  • 20
    Dongarra J. Sparse matrix storage formats. Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide. SIAM 2000; 11: 445448.
  • 21
    Liu Y, Guo L, Liu P, Tan J. Compressing regular expressions DFA table by matrix decomposition. Implementation and Application of Automata 2011; 6482: 282289.
  • 22
    Wikipedia. Field-programmable gate array – Wikipedia, the free encyclopedia, 2012. http://en.wikipedia.org/wiki/Field-programmable_gate_array.
  • 23
    Nickolls J, Buck I, Garland M, Skadron K. Scalable parallel programming with CUDA. Queue 2008-03; 6(2): 4053.
  • 24
    Wikipedia. Multi-core processor – Wikipedia, the free encyclopedia, 2012. http://en.wikipedia.org/wiki/Multi-core_processor.
  • 25
    Brüggemann-Klein A. Regular expressions into finite automata. Theoretical Computer Science 1993; 120(2): 197213.
  • 26
    Floyd RW, Ullman JD. The compilation of regular expressions into integrated circuits, 21st Annual Symposium on Foundations of Computer Science, 1980, Syracuse, New York, 1980; 260269.
  • 27
    Sidhu R, Prasanna VK. Fast regular expression matching using fpgas. In IEEE Symposium on Field-Programmable Custom Computing Machines. IEEE: Rohnert Park, California, 2001; 956959.
  • 28
    Clark CR, Schimmel DE. Efficient reconfigurable logic circuits for matching complex network intrusion detection patterns. In Proceedings Of 13Th International Conference on Field Program. IEEE: Lisbon, Portugal, 2003; 956959.
  • 29
    Yu F, Chen Z, Diao Y, Lakshman TV, Katz RH. Fast and memory-efficient regular expression matching for deep packet inspection. In ANCS 2006. ACM/IEEE Symposium on Architecture for Networking and Communications Systems, 2006. IEEE: San Jose, California, 2006; 93102.
  • 30
    Qi Y, Wang K, Fong J, Xue Y, Li J, Jiang W, Prasanna V. Feacan: Front-end acceleration for content-aware network processing. In 2011 Proceedings IEEE on INFOCOM. IEEE: Shanghai, 2011; 21142122.
  • 31
    Becchi M, Crowley P. An improved algorithm to accelerate regular expression evaluation. In Proceedings of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems. ACM: Orlando, Florida, 2007; 145154.
  • 32
    Vassiliadis S, Cotofana S, Stathis P. Block based compression storage expected performance. Kluwer International Series in Engineering and Computer Science 2002; 657: 389406.
  • 33
    Hu J, Wang W. Algorithm research for vector-linked list sparse matrix multiplication. In 2010 Asia-Pacific Conference on Wearable Computing Systems (APWCS). IEEE: Kaohsiung, Taiwan, 2010; 118121.
  • 34
    Smailbegovic F, Gaydadjiev GN, Vassiliadis S. Sparse matrix storage format, Proceedings of the 16th Annual Workshop on Circuits, Systems and Signal Processing, Veldhoven, The Netherlands, 2005; 445448.
  • 35
    Hayes CL, Luo Y. Dpico: a high speed deep packet inspection engine using compact finite automata. In Proceedings of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems. ACM: Orlando, Florida, 2007; 195203.
  • 36
    Lin W, Tang Y, Liu B, Pao D, Wang X. Compact DFA structure for multiple regular expressions matching. In ICC’09. IEEE International Conference on Communications, 2009. IEEE: Dresden, Germany, 2009; 15.