{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:16:46Z","timestamp":1780355806438,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,8,11]],"date-time":"2006-08-11T00:00:00Z","timestamp":1155254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,8,11]]},"DOI":"10.1145\/1159913.1159952","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:04:00Z","timestamp":1161194640000},"page":"339-350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":182,"title":["Algorithms to accelerate multiple regular expressions matching for deep packet inspection"],"prefix":"10.1145","author":[{"given":"Sailesh","family":"Kumar","sequence":"first","affiliation":[{"name":"Washington University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sarang","family":"Dharmapurikar","sequence":"additional","affiliation":[{"name":"Washington University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fang","family":"Yu","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Crowley","sequence":"additional","affiliation":[{"name":"Washington University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Turner","sequence":"additional","affiliation":[{"name":"Washington University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948145"},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Automata Theory, Languages, and Computation,\" Addison Wesley","author":"Hopcroft J. E.","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman , \" Introduction to Automata Theory, Languages, and Computation,\" Addison Wesley , 1979 . J. E. Hopcroft and J. D. Ullman, \"Introduction to Automata Theory, Languages, and Computation,\" Addison Wesley, 1979."},{"key":"e_1_3_2_1_3_1","first-page":"189","article-title":"An nlogn algorithm for minimizing states in a finite automaton,\" in Theory of Machines and Computation, J. Kohavi","author":"Hopcroft J.","year":"1971","unstructured":"J. Hopcroft , \" An nlogn algorithm for minimizing states in a finite automaton,\" in Theory of Machines and Computation, J. Kohavi , Ed. New York: Academic , 1971 , pp. 189 -- 196 . J. Hopcroft, \"An nlogn algorithm for minimizing states in a finite automaton,\" in Theory of Machines and Computation, J. Kohavi, Ed. New York: Academic, 1971, pp. 189--196.","journal-title":"Ed. New York: Academic"},{"key":"e_1_3_2_1_4_1","unstructured":"Bro: A System for Detecting Network Intruders in Real-Time. http:\/\/www.icir.org\/vern\/bro-info.html  Bro: A System for Detecting Network Intruders in Real-Time. http:\/\/www.icir.org\/vern\/bro-info.html"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1039834.1039864"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/974044.974078"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_3_2_1_8_1","first-page":"118","volume-title":"of ICALP","author":"Commentz-Walter B.","year":"1979","unstructured":"B. Commentz-Walter , \" A string matching algorithm fast on the average,\" Proc. of ICALP , pages 118 -- 132 , July 1979 . B. Commentz-Walter, \"A string matching algorithm fast on the average,\" Proc. of ICALP, pages 118--132, July 1979."},{"key":"e_1_3_2_1_9_1","volume-title":"Univ of Arizona","author":"Wu S.","year":"1994","unstructured":"S. Wu , U. Manber ,\" A fast algorithm for multi-pattern searching,\" Tech. R. TR-94-17, Dept. of Comp. Science , Univ of Arizona , 1994 . S. Wu, U. Manber,\" A fast algorithm for multi-pattern searching,\" Tech. R. TR-94-17, Dept. of Comp. Science, Univ of Arizona, 1994."},{"key":"e_1_3_2_1_10_1","unstructured":"Fang Yu etal \"Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection\" UCB tech. report EECS-2005-8.  Fang Yu et al. \"Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection\" UCB tech. report EECS-2005-8."},{"key":"e_1_3_2_1_11_1","first-page":"333","article-title":"Deterministic memory-efficient string matching algorithms for intrusion detection","author":"Tuck N.","year":"2004","unstructured":"N. Tuck , T. Sherwood , B. Calder , and G. Varghese , \" Deterministic memory-efficient string matching algorithms for intrusion detection ,\" IEEE Infocom 2004 , pp. 333 -- 340 . N. Tuck, T. Sherwood, B. Calder, and G. Varghese, \"Deterministic memory-efficient string matching algorithms for intrusion detection,\" IEEE Infocom 2004, pp. 333--340.","journal-title":"IEEE Infocom"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.5"},{"key":"e_1_3_2_1_13_1","first-page":"258","volume-title":"IEEE Symp. on Field-Prog. Custom Computing Machines","author":"Sourdis I.","year":"2004","unstructured":"I. Sourdis and D. Pnevmatikatos , \" Pre-decoded CAMs for Efficient and High-Speed NIDS Pattern Matching,\" Proc . IEEE Symp. on Field-Prog. Custom Computing Machines , Apr. 2004 , pp. 258 -- 267 . I. Sourdis and D. Pnevmatikatos, \"Pre-decoded CAMs for Efficient and High-Speed NIDS Pattern Matching,\" Proc. IEEE Symp. on Field-Prog. Custom Computing Machines, Apr. 2004, pp. 258--267."},{"key":"e_1_3_2_1_14_1","volume-title":"Bitwise Optimised CAM for Network Intrusion Detection Systems,\" IEEE FPL","author":"Yusuf S.","year":"2005","unstructured":"S. Yusuf and W. Luk , \" Bitwise Optimised CAM for Network Intrusion Detection Systems,\" IEEE FPL 2005 . S. Yusuf and W. Luk, \"Bitwise Optimised CAM for Network Intrusion Detection Systems,\" IEEE FPL 2005."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1058426.1058885"},{"key":"e_1_3_2_1_16_1","volume-title":"Efficient reconfigurable logic circuit for matching complex network intrusion detection patterns,\" In Proceedings of 13th International Conference on Field Program","author":"Clark C. R.","unstructured":"C. R. Clark and D. E. Schimmel , \" Efficient reconfigurable logic circuit for matching complex network intrusion detection patterns,\" In Proceedings of 13th International Conference on Field Program . C. R. Clark and D. E. Schimmel, \"Efficient reconfigurable logic circuit for matching complex network intrusion detection patterns,\" In Proceedings of 13th International Conference on Field Program."},{"key":"e_1_3_2_1_17_1","volume-title":"Machines","author":"Moscola J.","year":"2003","unstructured":"J. Moscola , et. al, \"Implementation of a content-scanning module for an internet firewall,\" IEEE Workshop on FPGAs for Custom Comp . Machines , Napa, USA , April 2003 . J. Moscola, et. al, \"Implementation of a content-scanning module for an internet firewall,\" IEEE Workshop on FPGAs for Custom Comp. Machines, Napa, USA, April 2003."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322327"},{"key":"e_1_3_2_1_19_1","unstructured":"Scott Tyler Shafer Mark Jones \"Network edge courts apps \" http:\/\/infoworld.com\/article\/02\/05\/27\/020527newebdev_1.html  Scott Tyler Shafer Mark Jones \"Network edge courts apps \" http:\/\/infoworld.com\/article\/02\/05\/27\/020527newebdev_1.html"},{"key":"e_1_3_2_1_20_1","unstructured":"TippingPoint X505 www.tippingpoint.com\/products_ips.html  TippingPoint X505 www.tippingpoint.com\/products_ips.html"},{"key":"e_1_3_2_1_21_1","unstructured":"Cisco IOS IPS Deployment Guide www.cisco.com  Cisco IOS IPS Deployment Guide www.cisco.com"},{"key":"e_1_3_2_1_22_1","unstructured":"Tarari RegEx www. tarari.com\/PDF\/RegEx_FACT_SHEET.pdf  Tarari RegEx www. tarari.com\/PDF\/RegEx_FACT_SHEET.pdf"},{"key":"e_1_3_2_1_23_1","unstructured":"Cu-11 standard cell\/gate array ASIC IBM. www.ibm.com  Cu-11 standard cell\/gate array ASIC IBM. www.ibm.com"},{"key":"e_1_3_2_1_24_1","unstructured":"Virtex-4 FPGA Xilinx. www.xilinx.com  Virtex-4 FPGA Xilinx. www.xilinx.com"},{"key":"e_1_3_2_1_25_1","volume-title":"of Computer Science","author":"Larsson N.J.","year":"1999","unstructured":"N.J. Larsson , \"Structures of string matching and data compression,\" Ph D thesis, Dept. of Computer Science , Lund University , 1999 . N.J. Larsson, \"Structures of string matching and data compression,\" PhD thesis, Dept. of Computer Science, Lund University, 1999 ."},{"key":"e_1_3_2_1_26_1","volume-title":"Deep Packet Inspection using Parallel Bloom Filters,\" IEEE Hot Interconnects","author":"Dharmapurikar S.","year":"2003","unstructured":"S. Dharmapurikar , P. Krishnamurthy , T. Sproull , and J. Lockwood , \" Deep Packet Inspection using Parallel Bloom Filters,\" IEEE Hot Interconnects 12, August 2003 . IEEE Computer Society Press . S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood, \"Deep Packet Inspection using Parallel Bloom Filters,\" IEEE Hot Interconnects 12, August 2003. IEEE Computer Society Press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30117-2_33"},{"key":"e_1_3_2_1_28_1","first-page":"125","article-title":"Deep Packet Filter with Dedicated Logic and Read Only Memories","author":"Cho Y. H.","year":"2004","unstructured":"Y. H. Cho , W. H. Mangione-Smith , \" Deep Packet Filter with Dedicated Logic and Read Only Memories ,\" Field Prog. Logic and Applications , Aug. 2004 , pp. 125 -- 134 . Y. H. Cho, W. H. Mangione-Smith, \"Deep Packet Filter with Dedicated Logic and Read Only Memories,\" Field Prog. Logic and Applications, Aug. 2004, pp. 125--134.","journal-title":"Field Prog. Logic and Applications"},{"key":"e_1_3_2_1_29_1","first-page":"404","article-title":"Granidt: Towards Gigabit Rate Network Intrusion Detection Technology","author":"Gokhale M.","year":"2002","unstructured":"M. Gokhale , , \" Granidt: Towards Gigabit Rate Network Intrusion Detection Technology ,\" Field Programmable Logic and Applications , Sept. 2002 , pp. 404 -- 413 . M. Gokhale, et al., \"Granidt: Towards Gigabit Rate Network Intrusion Detection Technology,\" Field Programmable Logic and Applications, Sept. 2002, pp. 404--413.","journal-title":"Field Programmable Logic and Applications"},{"key":"e_1_3_2_1_30_1","unstructured":"J. Levandoski E. Sommer and M. Strait \"Application Layer Packet Classifier for Linux\". http:\/\/l7-filter.sourceforge.net\/.  J. Levandoski E. Sommer and M. Strait \"Application Layer Packet Classifier for Linux\". http:\/\/l7-filter.sourceforge.net\/."},{"key":"e_1_3_2_1_31_1","unstructured":"\"MIT DARPA Intrusion Detection Data Sets \" http:\/\/www.ll.mit.edu\/IST\/ideval\/data\/2000\/2000_data_index.html.  \"MIT DARPA Intrusion Detection Data Sets \" http:\/\/www.ll.mit.edu\/IST\/ideval\/data\/2000\/2000_data_index.html."},{"key":"e_1_3_2_1_32_1","unstructured":"Vern Paxson etal \"Flex: A fast scanner generator \"http:\/\/www.gnu.org\/software\/flex\/  Vern Paxson et al. \"Flex: A fast scanner generator \"http:\/\/www.gnu.org\/software\/flex\/"},{"key":"e_1_3_2_1_33_1","unstructured":"SafeXcel Content Inspection Engine hardware regex acceleration IP.  SafeXcel Content Inspection Engine hardware regex acceleration IP."},{"key":"e_1_3_2_1_34_1","unstructured":"Network Services Processor OCTEON CN31XX CN30XX Family.  Network Services Processor OCTEON CN31XX CN30XX Family."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_3_2_1_37_1","first-page":"76","volume-title":"Information Processing letters","author":"Liang F. M.","year":"1980","unstructured":"F. M. Liang . A lower bound for on-line bin packing. In Information Processing letters , pages 76 -- 79 , 1980 . F. M. Liang. A lower bound for on-line bin packing. In Information Processing letters, pages 76--79, 1980."},{"key":"e_1_3_2_1_38_1","unstructured":"Will Eatherton John Williams \"An encoded version of reg-ex database from cisco systems provided for research purposes\".  Will Eatherton John Williams \"An encoded version of reg-ex database from cisco systems provided for research purposes\"."},{"key":"e_1_3_2_1_39_1","first-page":"208","volume-title":"Bounded Component Spanning Forest","author":"Johnson M. R.","year":"1979","unstructured":"Garey, M. R. , and Johnson , D. S. , \" Bounded Component Spanning Forest \", pp 208 , Computers and Intractability: A Guide to the Theory of NP-Completeness , 1979 . Garey, M. R., and Johnson, D. S., \"Bounded Component Spanning Forest\", pp 208, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979."}],"event":{"name":"SIGCOMM06: ACM SIGCOMM 2006 Conference","location":"Pisa Italy","acronym":"SIGCOMM06","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1159913.1159952","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1159913.1159952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:14:15Z","timestamp":1750245255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1159913.1159952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,11]]},"references-count":39,"alternative-id":["10.1145\/1159913.1159952","10.1145\/1159913"],"URL":"https:\/\/doi.org\/10.1145\/1159913.1159952","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1151659.1159952","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2006,8,11]]},"assertion":[{"value":"2006-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}