{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:40:37Z","timestamp":1771702837281,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/icnp.2009.5339697","type":"proceedings-article","created":{"date-parts":[[2009,11,30]],"date-time":"2009-11-30T14:36:24Z","timestamp":1259591784000},"page":"73-82","source":"Crossref","is-referenced-by-count":26,"title":["Scalable IP lookups using shape graphs"],"prefix":"10.1109","author":[{"given":"Haoyu","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murali","family":"Kodialam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.V.","family":"Lakshman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","DOI":"10.1145\/1090191.1080114","article-title":"fast hash table lookup using extended bloom filter: an aid to network processing","author":"song","year":"2005","journal-title":"ACM SIGCOMM"},{"key":"17","article-title":"searching very large routing tables in wide embedded memory","author":"lunteren","year":"2001","journal-title":"IEEE GLOBECOM"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/49.772439"},{"key":"15","article-title":"peacock hash: fast and updatable hashing for high performance packet processing algorithms","author":"kumar","year":"2008","journal-title":"IEEE INFOCOM"},{"key":"16","article-title":"bloom filters: design innovations and novel applications","author":"lu","year":"2005","journal-title":"Allerton Conference"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185355"},{"key":"14","doi-asserted-by":"crossref","DOI":"10.1145\/1151659.1159952","article-title":"algorithms to accelerate multiple regular expressions matching for deep packet inspection","author":"kumar","year":"2006","journal-title":"ACM SIGCOMM"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1145\/1090191.1080116","article-title":"dynamic pipelining: making ip lookup truly scalable","author":"hasan","year":"2005","journal-title":"ACM SIGCOMM"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.241"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461960"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062180"},{"key":"22","article-title":"shape shifting tries for faster ip lookup","author":"song","year":"2005","journal-title":"IEEE ICNP"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/296502.296503"},{"key":"24","doi-asserted-by":"crossref","DOI":"10.1145\/263105.263136","article-title":"scalable high speed ip routing lookups","author":"waldvogel","year":"1997","journal-title":"ACM SIGCOMM"},{"key":"25","article-title":"non-random generator for ipv6 tables","author":"wang","year":"2004","journal-title":"12th IEEE HotInterconnects"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916641"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061957"},{"key":"1","article-title":"a tree based router search engine architecture with single port","author":"baboescu","year":"2005","journal-title":"ISCA"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872576"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.1145\/263105.263133","article-title":"small forwarding tables for fast routing lookups","author":"degermark","year":"1997","journal-title":"ACM SIGCOMM"},{"key":"5","article-title":"the bloomier filter: an efficient data structure for static support lookup tables","author":"chazelle","year":"2004","journal-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354643"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1544012.1544033"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1145\/997150.997160","article-title":"tree bitmap: hardware\/software ip lookups with incremental updates","author":"eatherton","year":"2004","journal-title":"ACM SIGCOMM Computer Communication Review"}],"event":{"name":"2009 17th IEEE International Conference on Network Protocols (ICNP)","location":"Plainsboro, NJ, USA","start":{"date-parts":[[2009,10,13]]},"end":{"date-parts":[[2009,10,16]]}},"container-title":["2009 17th IEEE International Conference on Network Protocols"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5335585\/5339659\/05339697.pdf?arnumber=5339697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T22:13:29Z","timestamp":1497824009000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5339697\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icnp.2009.5339697","relation":{},"subject":[],"published":{"date-parts":[[2009,10]]}}}