{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:38:34Z","timestamp":1756993114977},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/tnet.2010.2055243","type":"journal-article","created":{"date-parts":[[2010,8,5]],"date-time":"2010-08-05T00:39:24Z","timestamp":1280968764000},"page":"1977-1987","source":"Crossref","is-referenced-by-count":22,"title":["Enhancing Counting Bloom Filters Through Huffman-Coded Multilayer Structures"],"prefix":"10.1109","volume":"18","author":[{"given":"Domenico","family":"Ficara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Di Pietro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Giordano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregorio","family":"Procissi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Vitucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/872785.872787"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1121995.1122000"},{"key":"ref12","first-page":"684","article-title":"an improved construction for counting bloom filters","volume":"lncs 4168","author":"bonomi","year":"2006","journal-title":"Proc 4th Ann Eur Symp Algor"},{"key":"ref13","first-page":"73","article-title":"rank-indexed hashing: a compact construction of bloom filters and variants","author":"hua","year":"2008","journal-title":"Proc IEEE ICNP"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080114"},{"key":"ref15","author":"johnson","year":"2003","journal-title":"IXP2400\/2800 Programming The Complete Microengine Coding Guide"},{"key":"ref16","year":"2004","journal-title":"Intel IXP2800 Hardware Reference Manual"},{"key":"ref17","first-page":"339","article-title":"algorithms to accelerate multiple regular expressions matching for deep packet inspection","author":"kumar","year":"0","journal-title":"Proc ACM Sigcomm"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1323548.1323573"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.14"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1323548.1323574"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.71"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285287"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159951"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2009.4804321"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.325"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948226"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1452335.1452339"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.1268997"},{"key":"ref21","first-page":"367","article-title":"towards faster string matching for intrusion detection or exceeding the speed of snort","volume":"1","author":"coit","year":"2001","journal-title":"DISCEX"},{"key":"ref24","author":"ptacek","year":"1998","journal-title":"Insertion evasion and denial of service Eluding network intrusion detection"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2007.4317817"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577961"},{"key":"ref25","first-page":"9","article-title":"network intrusion detection: evasion, traffic normalization, and end-to-end protocol semantics","author":"handley","year":"2001","journal-title":"Proc 10th USENIX SSYM"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/5669974\/05535247.pdf?arnumber=5535247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:43:28Z","timestamp":1633913008000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5535247\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":28,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2010.2055243","relation":{},"ISSN":["1063-6692"],"issn-type":[{"value":"1063-6692","type":"print"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}