{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T23:24:52Z","timestamp":1785367492314,"version":"3.55.0"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. VLSI Syst."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/tvlsi.2010.2042826","type":"journal-article","created":{"date-parts":[[2010,3,19]],"date-time":"2010-03-19T12:32:25Z","timestamp":1269001945000},"page":"963-972","source":"Crossref","is-referenced-by-count":51,"title":["A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing"],"prefix":"10.1109","volume":"19","author":[{"given":"Satendra Kumar","family":"Maurya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lawrence T.","family":"Clark","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2003.816338"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.29"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/263109.263133"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752163"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2005.864128"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1993.253403"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1999.830045"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2006.871760"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2007.914330"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2006.872719"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2004.824298"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2006.878476"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662938"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/4.871331"},{"key":"ref3","author":"sklower","year":"1993","journal-title":"A tree-based routing table for Berkeley Unix"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2003.1253210"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4.34085"},{"key":"ref5","first-page":"407","article-title":"A fast IP lookup scheme for longest-matching prefix","author":"wuu","year":"2001","journal-title":"Proc IEEE Int Conf Comput Netw Mobile Comput"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/92.273153"},{"key":"ref8","year":"1990","journal-title":"Content addressable memory array with priority encoder (Patent Style)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.1985.1156820"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1594233.1594333"},{"key":"ref1","author":"baker","year":"1995","journal-title":"2 2 5 2 Classless interdomain routing (CIDR)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/65.120723"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/4.726560"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CONECT.2002.1039265"},{"key":"ref21","author":"weste","year":"0","journal-title":"CMOS VLSI Design A Circuits and Systems Perspective"},{"key":"ref24","first-page":"1984","article-title":"An ultra high throughput and power efficient TCAM-based IP lookup engine","volume":"3","author":"zheng","year":"2004","journal-title":"Proc INFOCOM Conf IEEE Comput Commun Societies"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CICC.2003.1249424"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.1289292"},{"key":"ref25","first-page":"104","author":"kim","year":"2008","journal-title":"An Efficient IP Lookup Architecture With Fast Update Using Single-Match TCAMs"}],"container-title":["IEEE Transactions on Very Large Scale Integration (VLSI) Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/92\/5772207\/05433251.pdf?arnumber=5433251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:37:11Z","timestamp":1633916231000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5433251\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":31,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tvlsi.2010.2042826","relation":{},"ISSN":["1063-8210","1557-9999"],"issn-type":[{"value":"1063-8210","type":"print"},{"value":"1557-9999","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}