{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:47:24Z","timestamp":1754153244912,"version":"3.41.2"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/tnet.2013.2253119","type":"journal-article","created":{"date-parts":[[2013,4,4]],"date-time":"2013-04-04T15:17:03Z","timestamp":1365088623000},"page":"415-428","source":"Crossref","is-referenced-by-count":17,"title":["CompactDFA: Scalable Pattern Matching Using Longest Prefix Match Solutions"],"prefix":"10.1109","volume":"22","author":[{"given":"Anat","family":"Bremler-Barr","sequence":"first","affiliation":[{"name":"Department of Computer Science, Interdisciplinary Center, Herzliya, Israel"}]},{"given":"David","family":"Hay","sequence":"additional","affiliation":[{"name":"School of Engineering and Computer Science, Hebrew University, Jerusalem, Israel"}]},{"given":"Yaron","family":"Koral","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Tel Aviv University, Tel Aviv, Israel"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.273"},{"key":"ref32","first-page":"174","article-title":"Gigabit rate packet pattern-matching using TCAM","author":"yu","year":"2004","journal-title":"Proc IEEE ICNP"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2006.1709697"},{"key":"ref30","first-page":"1","article-title":"High-performance pattern-matching for intrusion detection","author":"van lunteren","year":"2006","journal-title":"Proc IEEE InfoCom"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462152"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592593"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/1151659.1159951","article-title":"Detecting evasion attacks at high speeds without reassembly","author":"varghese","year":"2006","journal-title":"Proc ACM Sigcomm"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9053-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5426226"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470374"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.241"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159952"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375855"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185355"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31284-7_22"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2006.5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462160"},{"key":"ref27","first-page":"453","article-title":"A multi-gigabit rate deep packet inspection algorithm using TCAM","volume":"1","author":"sung","year":"2005","journal-title":"Proc IEEE Globecom"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1323548.1323573"},{"journal-title":"?TCAMimic ?","year":"2012","author":"bremler-barr","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354682"},{"journal-title":"?CompactDFA Scalable pattern matching using longest prefix match solutions ?","year":"2012","author":"bremler-barr","key":"ref5"},{"journal-title":"?ClamAV ?","year":"2010","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195576"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2006.320212"},{"journal-title":"?DARPA intrusion detection data sets ?","year":"1998","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"ref20","first-page":"8","article-title":"Fast regular expression matching using small TCAMs for network intrusion detection and prevention systems","author":"meiners","year":"2010","journal-title":"Proc Usenix Security"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ANCS.2011.13"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/L-CA.2008.5","article-title":"Pipelined architecture for multi-string matching","volume":"7","author":"pao","year":"2008","journal-title":"Comput Archit Lett"},{"journal-title":"?Snort ?","year":"2010","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/65.912716"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.42"},{"key":"ref25","first-page":"2518","article-title":"IPv6 lookups using distributed and load balanced bloom filters for 100 Gbps core router line cards","author":"song","year":"2009","journal-title":"Proc IEEE InfoCom"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/6799946\/06494357.pdf?arnumber=6494357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T18:09:14Z","timestamp":1753207754000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6494357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":34,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2013.2253119","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2014,4]]}}}