{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T23:40:00Z","timestamp":1758843600648,"version":"3.44.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"15-16","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2001,9,14]],"date-time":"2001-09-14T00:00:00Z","timestamp":1000425600000},"content-version":"vor","delay-in-days":744,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1016\/s0140-3664(99)00099-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:03:07Z","timestamp":1027609387000},"page":"1415-1422","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast IP routing lookups for high performance routers"],"prefix":"10.1016","volume":"22","author":[{"given":"T.","family":"Kijkanjanarat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.J.","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0140-3664(99)00099-7_BIB1","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/69.506713","article-title":"A trie compaction algorithm for a large set of keys","volume":"8","author":"Aoe","year":"1996","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"10.1016\/S0140-3664(99)00099-7_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/263109.263133","article-title":"Small forwarding tables for fast routing lookups","author":"Degermark","year":"1997","journal-title":"ACM SIGCOMM"},{"issue":"1","key":"10.1016\/S0140-3664(99)00099-7_BIB3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/90.503764","article-title":"Routing on longest-matching prefixes","volume":"4","author":"Doeringer","year":"1996","journal-title":"IEEE\/ACM Transaction on Networking"},{"key":"10.1016\/S0140-3664(99)00099-7_BIB4","doi-asserted-by":"crossref","unstructured":"V. Fuller, T. Li, J. Yu, K. Varadhan, Classless inter-domain routing (CIDR): an address assignment and aggregation strategy, RFC 1519, September 1993.","DOI":"10.17487\/rfc1519"},{"key":"10.1016\/S0140-3664(99)00099-7_BIB5","first-page":"1240","article-title":"Routing lookups in hardware at memory access speeds","author":"Gupta","year":"1998","journal-title":"IEEE INFOCOM"},{"year":"1973","series-title":"Fundamental Algorithms. Vol. 3: Sorting and Searching","author":"Knuth","key":"10.1016\/S0140-3664(99)00099-7_BIB6"},{"key":"10.1016\/S0140-3664(99)00099-7_BIB7","first-page":"1248","article-title":"Lookups using multiway and multicolumn search","author":"Lampson","year":"1998","journal-title":"IEEE INFOCOM"},{"key":"10.1016\/S0140-3664(99)00099-7_BIB8","unstructured":"Merit Network, Inc., Routing Snapshot on October 30, 1997 at the Mae-East NAP. URL: http:\/\/www.merit.edu\/ipma."},{"key":"10.1016\/S0140-3664(99)00099-7_BIB9","doi-asserted-by":"crossref","unstructured":"S. Nilsson, G. Karlsson, Fast address lookup for internet routers, IFIP Fourth International Conference on Broadband Communication, 1998, pp. 11\u201312.","DOI":"10.1007\/978-0-387-35378-4_2"},{"key":"10.1016\/S0140-3664(99)00099-7_BIB10","first-page":"1","article-title":"Faster IP lookups using controlled prefix expansion","author":"Srinivasan","year":"1998","journal-title":"ACM SIGMATICS"},{"key":"10.1016\/S0140-3664(99)00099-7_BIB11","article-title":"Longest prefix search using compressed trees","author":"Tzeng","year":"1998","journal-title":"IEEE GLOBECOM"},{"key":"10.1016\/S0140-3664(99)00099-7_BIB12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/263109.263136","article-title":"Scalable high-speed IP routing lookups","author":"Waldvogel","year":"1997","journal-title":"ACM SIGCOMM"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499000997?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499000997?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T23:17:11Z","timestamp":1758842231000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366499000997"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":12,"journal-issue":{"issue":"15-16","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0140366499000997"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(99)00099-7","relation":{},"ISSN":["0140-3664"],"issn-type":[{"type":"print","value":"0140-3664"}],"subject":[],"published":{"date-parts":[[1999,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast IP routing lookups for high performance routers","name":"articletitle","label":"Article Title"},{"value":"Computer Communications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0140-3664(99)00099-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}