{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T22:44:05Z","timestamp":1792968245594,"version":"4.5.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5935158","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"311-315","source":"Crossref","is-referenced-by-count":11,"title":["Approximately-perfect hashing: Improving network throughput through efficient off-chip routing table lookup"],"prefix":"10.1109","author":[{"given":"Zhuo","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jih-Kwon","family":"Peir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shigang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261567"},{"key":"ref11","article-title":"Simple and space-efficient minimal perfect hash functions","author":"botelho","year":"2007","journal-title":"WADS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646108"},{"key":"ref13","article-title":"Balanced Allocations","author":"azar","year":"1994","journal-title":"Proc of ACM STOC"},{"key":"ref14","article-title":"A performance study of hashing functions for hardware applications","author":"ramakrishna","year":"1994","journal-title":"Proceedings of International conference on computing and information"},{"key":"ref15","article-title":"Peacock Hash: Fast and Updatable Hashing for High Performance Packet Processing Algorithms","author":"kumar","year":"2008","journal-title":"Proc of IEEE INFOCOM"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2010.5762752"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159950"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.241"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/296502.296503"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062180"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916641"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/863977.863979"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2004.1347890"},{"key":"ref1","year":"2009","journal-title":"Routing information service"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2008.27"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","location":"Shanghai, China","start":{"date-parts":[[2011,4,10]]},"end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05935158.pdf?arnumber=5935158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T07:07:09Z","timestamp":1490080029000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5935158\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5935158","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}