{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:58:02Z","timestamp":1755838682292,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Horizon 2020 project 5G-PICTURE","award":["#762057"],"award-info":[{"award-number":["#762057"]}]},{"name":"Elastic Networks","award":["TEC2015-71932-REDT"],"award-info":[{"award-number":["TEC2015-71932-REDT"]}]},{"name":"US National Science Foundation","award":["CNS-1228598","CCF-1320231","CCF-1535795","CCF-1563710"],"award-info":[{"award-number":["CNS-1228598","CCF-1320231","CCF-1535795","CCF-1563710"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,11,1]]},"DOI":"10.1109\/tkde.2018.2818716","type":"journal-article","created":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T18:19:01Z","timestamp":1521829141000},"page":"2120-2133","source":"Crossref","is-referenced-by-count":18,"title":["EMOMA: Exact Match in One Memory Access"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3626-6404","authenticated-orcid":false,"given":"Salvatore","family":"Pontarelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2540-5234","authenticated-orcid":false,"given":"Pedro","family":"Reviriego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2011","key":"ref33"},{"key":"ref32","first-page":"259","article-title":"Bloomier filters: A second look","author":"charles","year":"2008","journal-title":"Proc 16th European Symp Algorithms"},{"key":"ref31","first-page":"30","article-title":"The bloomier filter: An efficient data\n structure for static support lookup tables","author":"chazelle","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref30","article-title":"On the\n scalability of BGP: The roles of topology growth and update rate-limiting","author":"elmokashfi","year":"2008","journal-title":"Proc ACM CoNext Conf"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/12.641938"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098824"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2314683"},{"key":"ref11","first-page":"437","article-title":"The role of\n optics in future high radix switch design","author":"binkert","year":"2011","journal-title":"Proc 38th IEEE Int Symp Comput Archit"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872576"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491204"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"2:1","DOI":"10.1147\/JRD.2014.2376112","article-title":"IBM POWER8 processor core microarchitecture","volume":"59","author":"sinharoy","year":"2015","journal-title":"IBM J Res Develop"},{"year":"2011","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.810315"},{"year":"2016","key":"ref17"},{"year":"2017","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080114"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00032-8"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-1-84882-765-3_9","article-title":"Hash-based techniques for high-speed packet processing","author":"kirsch","year":"2010","journal-title":"Algorithms for Next Generation Networks"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2005.8"},{"key":"ref6","first-page":"25","article-title":"Scalable high speed IP routing lookups","author":"waldvogel","year":"1997","journal-title":"Proc Conf Appl Technol Archit Protocols Comput Commun"},{"key":"ref29","first-page":"189","article-title":"Projecting future IPv4 router requirements from trends in dynamic BGP behaviour","author":"huston","year":"2006","journal-title":"Proc Australian Telecommun Netw Appl Conf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref8","first-page":"99","article-title":"Forwarding metamorphosis: Fast\n programmable match-action processing in hardware for SDN","author":"bosshart","year":"2013","journal-title":"Proc Conf Appl Technol Archit Protocols Comput Commun"},{"key":"ref7","first-page":"1786","article-title":"Beyond\n TCAMs: An SRAM based parallel multi-pipeline architecture for terabit IP lookup","author":"jiang","year":"2008","journal-title":"Proc 27th Conf Comput Commun"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2005.864128"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2014.61"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/65.912717"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2417524"},{"key":"ref22","first-page":"469","article-title":"The random\n graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation","author":"cain","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref21","first-page":"213","article-title":"Tight thresholds for cuckoo hashing via XORSAT","author":"dietzfelbinger","year":"2010","journal-title":"Proc Int Colloq Automata Languages Program"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/080728743"},{"key":"ref23","first-page":"459","article-title":"The k-orientability thresholds for \n$G_{n,p}$","author":"fernholz","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref25","first-page":"751","article-title":"Using a queue to de-amortize Cuckoo hashing in hardware","author":"kirsch","year":"2007","journal-title":"Proc 45th Annu Allerton Conf Commun Control Comput"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/69\/8482267\/8323198-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8482267\/08323198.pdf?arnumber=8323198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:07Z","timestamp":1649443747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8323198\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,1]]},"references-count":35,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2818716","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2018,11,1]]}}}