{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:03:23Z","timestamp":1725653003418},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/infcom.2009.5062179","type":"proceedings-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T15:10:14Z","timestamp":1244041814000},"page":"2509-2517","source":"Crossref","is-referenced-by-count":14,"title":["Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet"],"prefix":"10.1109","author":[{"given":"M.","family":"Behdadfar","sequence":"first","affiliation":[{"name":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan"}]},{"given":"H.","family":"Saidi","sequence":"additional","affiliation":[{"name":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan"}]},{"given":"H.","family":"Alaei","sequence":"additional","affiliation":[{"name":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan"}]},{"given":"B.","family":"Samari","sequence":"additional","affiliation":[{"name":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan"}]}],"member":"263","reference":[{"year":"1981","journal-title":"RFC 791","article-title":"internet protocol","key":"3"},{"key":"2","article-title":"a longest prefix first search tree for ip lookup","author":"wnn","year":"0","journal-title":"ICC'05 pp 989-993 May 16-20 2005"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1007\/978-3-540-79549-0_49"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/TC.2005.104"},{"key":"7","article-title":"routing lookups in hardw are at memory access speeds","author":"gupta","year":"0","journal-title":"INFOCOM '98 1998"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1145\/277851.277863"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/49.772439"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.17487\/rfc1519"},{"key":"9","article-title":"a scalable exact matching in balance tree scheme for ipv6 lookup","author":"sun","year":"0","journal-title":"ACM SIGCOMM 2007 data communication festival IPv6'07 August 27-31 2007"},{"key":"8","article-title":"ip lookup using multi-way and multicolumn search","author":"lampson","year":"0","journal-title":"INFOCOM '98 1998"},{"year":"1999","author":"cormen","journal-title":"Introduction to Algorithms","key":"11"},{"year":"0","key":"12"}],"event":{"name":"2009 Proceedings IEEE INFOCOM","start":{"date-parts":[[2009,4,19]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2009,4,25]]}},"container-title":["IEEE INFOCOM 2009"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5061887\/5061888\/05062179.pdf?arnumber=5062179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T18:23:21Z","timestamp":1677781401000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5062179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/infcom.2009.5062179","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}