{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:08:14Z","timestamp":1729674494123,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icccn.2003.1284179","type":"proceedings-article","created":{"date-parts":[[2004,6,3]],"date-time":"2004-06-03T16:14:56Z","timestamp":1086279296000},"page":"257-263","source":"Crossref","is-referenced-by-count":3,"title":["Scalable, memory efficient, high-speed lookup and update algorithms for IP routing"],"prefix":"10.1109","author":[{"given":"N.","family":"Futamura","sequence":"first","affiliation":[]},{"given":"R.","family":"Sangireddy","sequence":"additional","affiliation":[]},{"given":"S.","family":"Aluru","sequence":"additional","affiliation":[]},{"given":"A.K.","family":"Somani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/INFCOM.1998.662939"},{"key":"ref11","first-page":"1","article-title":"Fast Address Lookups using Controlled Prefix Expansion","author":"srinivasan","year":"1998","journal-title":"Proc ACM SIGMETRICS '98"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/LCN.2000.891104"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/49.772439"},{"year":"1995","author":"mcauley","article-title":"Fast multilevel hierarchical routing table using content-addressable memory","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/INFCOM.1998.662938"},{"key":"ref16","first-page":"1140","article-title":"A fast IP routing lookup scheme","volume":"2","author":"wang","year":"2000","journal-title":"Proc IEEE International Conference on Communications ICC 2000"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/INFCOM.1999.752162"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/ICCCN.2001.956213"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/INFCOM.2002.1019300"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/321479.321481"},{"key":"ref3","first-page":"93","article-title":"A Tree-Based Packet Routing Table for Berkeley Unix","author":"sklower","year":"1991","journal-title":"Proc Winter USENIX Conference"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/49.772436"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/GLOCOM.1999.830044"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/263109.263136","article-title":"Scalable High Speed IP Routing Lookups","volume":"27","author":"waldvogel","year":"1997","journal-title":"Proc ACM SIGCOMM '97"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/HPSR.2000.856650"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/65.912716"},{"year":"0","journal-title":"Routing-Analysis Internet Performance Measurement and Analysis (IPMA) Project","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/502912.502914"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/INFCOM.2002.1019301"}],"event":{"acronym":"ICCCN-03","name":". 12th International Conference on Computer Communications and Networks","location":"Dallas, TX, USA"},"container-title":["Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9031\/28660\/01284179.pdf?arnumber=1284179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T03:47:12Z","timestamp":1497584832000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1284179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/icccn.2003.1284179","relation":{},"subject":[]}}