{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T21:00:26Z","timestamp":1762376426447,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T00:00:00Z","timestamp":1533600000000},"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":[[2018,8,7]]},"DOI":"10.1145\/3229538.3229542","type":"proceedings-article","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T19:07:07Z","timestamp":1533150427000},"page":"22-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Hash Table Design and Optimization for Software Virtual Switches"],"prefix":"10.1145","author":[{"given":"Yipeng","family":"Wang","sequence":"first","affiliation":[{"name":"Intel Labs, Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameh","family":"Gobriel","sequence":"additional","affiliation":[{"name":"Intel Labs, Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren","family":"Wang","sequence":"additional","affiliation":[{"name":"Intel Labs, Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsung-Yuan Charlie","family":"Tai","sequence":"additional","affiliation":[{"name":"Intel Labs, Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Dumitrescu","sequence":"additional","affiliation":[{"name":"Network Platforms Group, Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,8,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"dpdk.org. online. DPDK main page. dpdk.org. (online). {accessed 16-March-2018}.  dpdk.org. online. DPDK main page. dpdk.org. (online). {accessed 16-March-2018}."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation (nsdi'13)","author":"Fan Bin","year":"2013","unstructured":"Bin Fan , David G. Andersen , and Michael Kaminsky . 2013 . MemC3: Compact and Concurrent MemCache with Dumber Caching and Smarter Hashing . In Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation (nsdi'13) . 371--384. Bin Fan, David G. Andersen, and Michael Kaminsky. 2013. MemC3: Compact and Concurrent MemCache with Dumber Caching and Smarter Hashing. In Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation (nsdi'13). 371--384."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"volume-title":"online. VPP main page. https:\/\/wiki.fd.io\/view\/VPP. (online). {Online","year":"2018","key":"e_1_3_2_1_4_1","unstructured":"fd.io. online. VPP main page. https:\/\/wiki.fd.io\/view\/VPP. (online). {Online ; accessed 16- March - 2018 }. fd.io. online. VPP main page. https:\/\/wiki.fd.io\/view\/VPP. (online). {Online; accessed 16-March-2018}."},{"key":"e_1_3_2_1_5_1","volume-title":"Space Efficient Hash Tables with Worst Case Constant Access Time. Theory of Computing Systems 38, 2 (01","author":"Fotakis Dimitris","year":"2005","unstructured":"Dimitris Fotakis , Rasmus Pagh , Peter Sanders , and Paul Spirakis . 2005. Space Efficient Hash Tables with Worst Case Constant Access Time. Theory of Computing Systems 38, 2 (01 Feb 2005 ), 229--248. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, and Paul Spirakis. 2005. Space Efficient Hash Tables with Worst Case Constant Access Time. Theory of Computing Systems 38, 2 (01 Feb 2005), 229--248."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_24"},{"key":"e_1_3_2_1_8_1","unstructured":"https:\/\/tungstenfabric.io\/. online. Tungsten Fabric main page. https:\/\/tungstenfabric.io\/. (online). {accessed 6-June-2018}.  https:\/\/tungstenfabric.io\/. online. Tungsten Fabric main page. https:\/\/tungstenfabric.io\/. (online). {accessed 6-June-2018}."},{"volume-title":"Raising the Bar for Using GPUs in Software Packet Processing. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15)","author":"Kalia Anuj","key":"e_1_3_2_1_9_1","unstructured":"Anuj Kalia , Dong Zhou , Michael Kaminsky , and David G. Andersen . 2015 . Raising the Bar for Using GPUs in Software Packet Processing. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15) . Anuj Kalia, Dong Zhou, Michael Kaminsky, and David G. Andersen. 2015. Raising the Bar for Using GPUs in Software Packet Processing. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15)."},{"key":"e_1_3_2_1_10_1","volume-title":"The Art of Computer Programming","author":"Knuth Donald E.","unstructured":"Donald E. Knuth . 1997. The Art of Computer Programming , Volume 1 ( 3 rd Ed.): Fundamental Algorithms . Donald E. Knuth. 1997. The Art of Computer Programming, Volume 1 (3rd Ed.): Fundamental Algorithms.","edition":"3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/42404.42410"},{"key":"e_1_3_2_1_12_1","volume-title":"High-Performance Hash Tables for Networking Applications. ArXiv e-prints (Dec","author":"Scouarnec N. Le","year":"2017","unstructured":"N. Le Scouarnec . 2017. Cuckoo++ Hash Tables : High-Performance Hash Tables for Networking Applications. ArXiv e-prints (Dec . 2017 ). arXiv:cs.NI\/1712.09624 N. Le Scouarnec. 2017. Cuckoo++ Hash Tables: High-Performance Hash Tables for Networking Applications. ArXiv e-prints (Dec. 2017). arXiv:cs.NI\/1712.09624"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592820"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Rasmus Pagh and Flemming Friche Rodler. 2001. Cuckoo hashing. In Journal of Algorithms.  Rasmus Pagh and Flemming Friche Rodler. 2001. Cuckoo hashing. In Journal of Algorithms.","DOI":"10.1007\/3-540-44676-1_10"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070549"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789770.2789779"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747645"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254754"},{"key":"e_1_3_2_1_19_1","unstructured":"WIKIPEDIA. online. Wiki page on pseudo LRU. https:\/\/en.wikipedia.org\/wiki\/Pseudo-LRU. (online). {accessed 16-March-2018}.  WIKIPEDIA. online. Wiki page on pseudo LRU. https:\/\/en.wikipedia.org\/wiki\/Pseudo-LRU. (online). {accessed 16-March-2018}."},{"key":"e_1_3_2_1_20_1","unstructured":"www.opencontrail.org. online. OpenContrail main page. www.opencontrail.org. (online). {accessed 16-March-2018}.  www.opencontrail.org. online. OpenContrail main page. www.opencontrail.org. (online). {accessed 16-March-2018}."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535379"}],"event":{"name":"SIGCOMM '18: ACM SIGCOMM 2018 Conference","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Budapest Hungary","acronym":"SIGCOMM '18"},"container-title":["Proceedings of the 2018 Afternoon Workshop on Kernel Bypassing Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3229538.3229542","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3229538.3229542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:43Z","timestamp":1750210783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3229538.3229542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,7]]},"references-count":20,"alternative-id":["10.1145\/3229538.3229542","10.1145\/3229538"],"URL":"https:\/\/doi.org\/10.1145\/3229538.3229542","relation":{},"subject":[],"published":{"date-parts":[[2018,8,7]]},"assertion":[{"value":"2018-08-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}