{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:05:43Z","timestamp":1725732343524},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1109\/icc.2005.1494497","type":"proceedings-article","created":{"date-parts":[[2005,8,16]],"date-time":"2005-08-16T15:17:27Z","timestamp":1124205447000},"page":"989-993 Vol. 2","source":"Crossref","is-referenced-by-count":0,"title":["A longest prefix first search tree for IP lookup"],"prefix":"10.1109","author":[{"family":"Lih-Chyau Wuu","sequence":"first","affiliation":[{"name":"Inst. of Comput. Sci., Nat. Yunlin Univ. of Sci. & Technol., Taiwan"}]},{"family":"Kuo-Ming Chen","sequence":"additional","affiliation":[{"name":"Inst. of Comput. Sci., Nat. Yunlin Univ. of Sci. & Technol., Taiwan"}]},{"family":"Tzong-Jye Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"An Architecture for IP Address Allocation with CIDR","author":"rekhter","year":"1993","journal-title":"RFC 1518"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2003.1226720"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/49.772440"},{"journal-title":"BGP Table","year":"0","key":"ref6"},{"key":"ref11","first-page":"407","article-title":"A fast IP lookup scheme for longest-matching prefix","author":"wuu","year":"2001","journal-title":"Proceedings of IEEE Computer Networks and Mobile Computing"},{"key":"ref5","article-title":"Classless Inter-Domain Routing (CIDR): An Address Assignment and Aggregation Strategy","author":"fuller","year":"1993","journal-title":"RFC 1519"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662938"},{"journal-title":"The Routing Arbiter Project Internet routing and network statistic","year":"0","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/49.772439"},{"key":"ref9","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":"Proc of ACM SIG on Data Communications"},{"key":"ref1","first-page":"93","article-title":"A Tree-Based Routing Table for Berkeley Unix","author":"sklower","year":"1991","journal-title":"Proc of USENIX Conf"}],"event":{"name":"2005 IEEE International Conference on Communications","start":{"date-parts":[[2005,5,16]]},"location":"Seoul, Korea (South)","end":{"date-parts":[[2005,5,20]]}},"container-title":["IEEE International Conference on Communications, 2005. ICC 2005. 2005"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9996\/32110\/01494497.pdf?arnumber=1494497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T18:47:53Z","timestamp":1709923673000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1494497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/icc.2005.1494497","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}