{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:06:36Z","timestamp":1769850396181,"version":"3.49.0"},"reference-count":13,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,8,1]]},"DOI":"10.1587\/transfun.2022eap1062","type":"journal-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T22:10:28Z","timestamp":1674684628000},"page":"1037-1042","source":"Crossref","is-referenced-by-count":1,"title":["Dual Cuckoo Filter with a Low False Positive Rate for Deep Packet Inspection"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Yixuan","family":"ZHANG","sequence":"first","affiliation":[{"name":"College of Cyberspace, Hangzhou Dianzi University"}]},{"given":"Meiting","family":"XUE","sequence":"additional","affiliation":[{"name":"College of Cyberspace, Hangzhou Dianzi University"}]},{"given":"Huan","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Communication Engineering, Hangzhou Dianzi University"}]},{"given":"Shubiao","family":"LIU","sequence":"additional","affiliation":[{"name":"Department of Instrument of Engineering, Zhejiang University"}]},{"given":"Bei","family":"ZHAO","sequence":"additional","affiliation":[{"name":"College of Computer, Hangzhou Dianzi University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] B.H. Bloom, \u201cSpace\/time trade-offs in hash coding with allowable errors,\u201d Commun. ACM, vol.13, no.7, pp.422-426, 1970. 10.1145\/362686.362692","DOI":"10.1145\/362686.362692"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M.A. Bender, M. Farach-Colton, R. Johnson, B.C. Kuszmaul, D. Medjedovic, P. Montes, P. Shetty, R.P. Spillane, and E. Zadok, \u201cDon't thrash: How to cache your hash on flash,\u201d Proc. 38th International Conference on Very Large Data Bases, 2012.","DOI":"10.14778\/2350229.2350275"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] B. Fan, D.G. Andersen, M. Kaminsky, and M.D. Mitzenmacher, \u201cCuckoo filter: Practically better than bloom,\u201d Proc. 10th ACM International on Conference on emerging Networking Experiments and Technologies, pp.75-88, 2014. 10.1145\/2674005.2674994","DOI":"10.1145\/2674005.2674994"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] M. Paynter and T. Kocak, \u201cFully pipelined bloom filter architecture,\u201d IEEE Commun. Lett., vol.12, no.11, pp.855-857, 2008. 10.1109\/lcomm.2008.081176","DOI":"10.1109\/LCOMM.2008.081176"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S. Pontarelli, P. Reviriego, and J.A. Maestro, \u201cParallel d-pipeline: A cuckoo hashing implementation for increased throughput,\u201d IEEE Trans. Comput., vol.65, no.1, pp.326-331, 2015. 10.1109\/tc.2015.2417524","DOI":"10.1109\/TC.2015.2417524"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] P. Reviriego, J. Mart\u00ednez, and S. Pontarelli, \u201cCFBF: Reducing the insertion time of cuckoo filters with an integrated bloom filter,\u201d IEEE Commun. Lett., vol.23, no.10, pp.1857-1861, 2019. 10.1109\/lcomm.2019.2930508","DOI":"10.1109\/LCOMM.2019.2930508"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] P. Reviriego, J. Mart\u00ednez, D. Larrabeiti, and S. Pontarelli, \u201cCuckoo filters and bloom filters: Comparison and application to packet classification,\u201d IEEE Trans. Netw. Service Manag., vol.17, no.4, pp.2690-2701, 2020. 10.1109\/tnsm.2020.3024680","DOI":"10.1109\/TNSM.2020.3024680"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] M. Al-Hisnawi and M. Ahmadi, \u201cQCF for deep packet inspection,\u201d IET Networks, vol.7, no.5, pp.346-352, 2018. 10.1049\/iet-net.2017.0037","DOI":"10.1049\/iet-net.2017.0037"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] R. Shubbar and M. Ahmadi, \u201cFast 2D filter with low false positive for network packet inspection,\u201d IET Networks, vol.6, no.6, pp.224-231, 2017. 10.1049\/iet-net.2017.0055","DOI":"10.1049\/iet-net.2017.0055"},{"key":"10","unstructured":"[10] S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood, \u201cDeep packet inspection using parallel bloom filters,\u201d 11th Symposium on High Performance Interconnects, 2003. Proceedings., IEEE, pp.44-51, 2003. 10.1109\/conect.2003.1231477"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] M. Al-Hisnawi and M. Ahmadi, \u201cDeep packet inspection using cuckoo filter,\u201d 2017 Annual Conference on New Trends in Information & Communications Technology Applications (NTICT), IEEE, pp.197-202, 2017. 10.1109\/ntict.2017.7976111","DOI":"10.1109\/NTICT.2017.7976111"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] M. Al-Hisnawi and M. Ahmadi, \u201cDeep packet inspection using quotient filter,\u201d IEEE Commun. Lett., vol.20, no.11, pp.2217-2220, 2016. 10.1109\/lcomm.2016.2601898","DOI":"10.1109\/LCOMM.2016.2601898"},{"key":"13","unstructured":"[13] https:\/\/www.unb.ca\/cic\/datasets\/vpn.html"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/8\/E106.A_2022EAP1062\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T04:04:10Z","timestamp":1691208250000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/8\/E106.A_2022EAP1062\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,1]]},"references-count":13,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022eap1062","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,1]]},"article-number":"2022EAP1062"}}