乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:40:37Z","timestamp":1648618837790},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1016\/j.comnet.2011.09.004","type":"journal-article","created":{"date-parts":[[2011,9,13]],"date-time":"2011-09-13T14:45:51Z","timestamp":1315925151000},"page":"231-243","source":"Crossref","is-referenced-by-count":4,"title":["An efficient IP address lookup algorithm based on a small balanced tree using entry reduction"],"prefix":"10.1016","volume":"56","author":[{"given":"Hyuntae","family":"Park","sequence":"first","affiliation":[]},{"given":"Hyejeong","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Sungho","family":"Kang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/j.comnet.2011.09.004_b0005","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1109\/JPROC.2002.802001","article-title":"Next generation routers","volume":"90","author":"Chao","year":"2002","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"10.1016\/j.comnet.2011.09.004_b0010","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/65.912716","article-title":"Survey and taxonomy of IP address lookup algorithms","volume":"15","author":"Ruiz-Sanchez","year":"2001","journal-title":"IEEE Network"},{"issue":"5","key":"10.1016\/j.comnet.2011.09.004_b0015","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/TC.2005.78","article-title":"EaseCAM: an energy and storage efficient TCAM-based router architecture for IP lookup","volume":"54","author":"Ravikumar","year":"2005","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/j.comnet.2011.09.004_b0020","series-title":"Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices","author":"Varghese","year":"2005"},{"issue":"5","key":"10.1016\/j.comnet.2011.09.004_b0025","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/90.731185","article-title":"Internet routing instability","volume":"6","author":"Labovitz","year":"1999","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"10.1016\/j.comnet.2011.09.004_b0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/296502.296503","article-title":"Fast address lookups using controlled prefix expansion","volume":"17","author":"Srinivasan","year":"1999","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"10.1016\/j.comnet.2011.09.004_b0035","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1109\/TNET.2003.815288","article-title":"Efficient construction of multibit tries for IP address lookup","volume":"11","author":"Sahni","year":"2003","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"10.1016\/j.comnet.2011.09.004_b0040","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/49.772439","article-title":"IP address lookup using LC-tries","volume":"17","author":"Nilsson","year":"1999","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/j.comnet.2011.09.004_b0045","doi-asserted-by":"crossref","unstructured":"M. Degermark, A. Brodnik, S. Carlsson, S. Pink, Small forwarding tables for fast routing lookups, in: Proc. ACM SIGCOMM, 1997, pp. 3\u201314.","DOI":"10.1145\/263109.263133"},{"issue":"2","key":"10.1016\/j.comnet.2011.09.004_b0050","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/997150.997160","article-title":"Tree bitmap: hardware\/software IP lookups with incremental updates","volume":"34","author":"Eatherton","year":"2004","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"10.1016\/j.comnet.2011.09.004_b0055","doi-asserted-by":"crossref","unstructured":"S. Sahni, L. haibin, Dynamic Tree Bitmap for IP Lookup and Update, in: Proc. International Conference on Networking (ICN), 2007, pp. 79\u201384.","DOI":"10.1109\/ICN.2007.38"},{"issue":"6","key":"10.1016\/j.comnet.2011.09.004_b0060","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TC.2010.38","article-title":"Priority tries for IP address lookup","volume":"59","author":"Lim","year":"2010","journal-title":"IEEE Transactions on Computers"},{"issue":"12","key":"10.1016\/j.comnet.2011.09.004_b0065","doi-asserted-by":"crossref","first-page":"3354","DOI":"10.1016\/j.comnet.2007.01.023","article-title":"A longest prefix first search tree for IP lookup","volume":"51","author":"Wuu","year":"2007","journal-title":"Computer Networks"},{"key":"10.1016\/j.comnet.2011.09.004_b0070","unstructured":"N. Yazdani, P.S. Min, Fast and scalable schemes for the IP address lookup problem, in: Proc. IEEE HPSR, 2000, pp. 83\u201392."},{"issue":"7","key":"10.1016\/j.comnet.2011.09.004_b0075","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/LCOMM.2005.1461694","article-title":"Efficient binary search for IP address lookup","volume":"9","author":"Yim","year":"2005","journal-title":"IEEE Communications Letters"},{"issue":"4","key":"10.1016\/j.comnet.2011.09.004_b0080","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TNET.2005.852885","article-title":"Hardware-based IP routing using partitioned lookup table","volume":"13","author":"Akhbarizadeh","year":"2005","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"10.1016\/j.comnet.2011.09.004_b0085","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/LCOMM.2005.1375247","article-title":"Binary searches on multiple small trees for IP address lookup","volume":"9","author":"Lim","year":"2005","journal-title":"IEEE Communications Letters"},{"issue":"4","key":"10.1016\/j.comnet.2011.09.004_b0090","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1587\/transcom.E93.B.1009","article-title":"A fast IP address lookup algorithm based on search space reduction","volume":"E93-B","author":"Park","year":"2010","journal-title":"IEICE Transactions on Communications"},{"issue":"3","key":"10.1016\/j.comnet.2011.09.004_b0095","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1109\/TCOMM.2009.03.070146","article-title":"IP address lookup for internet routers using balanced binary search with prefix vector","volume":"57","author":"Lim","year":"2009","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"10.1016\/j.comnet.2011.09.004_b0100","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/90.779199","article-title":"IP lookups using multiway and multicolumn search","volume":"7","author":"Lampson","year":"1999","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"7","key":"10.1016\/j.comnet.2011.09.004_b0105","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/TC.2005.107","article-title":"An on-chip IP address lookup algorithm","volume":"54","author":"Sun","year":"2005","journal-title":"IEEE Transactions on Computers"},{"issue":"12","key":"10.1016\/j.comnet.2011.09.004_b0110","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1109\/TC.2004.116","article-title":"Enhanced interval trees for dynamic IP router-tables","volume":"53","author":"Lu","year":"2004","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/j.comnet.2011.09.004_b0115","unstructured":"H. Lim, W. Kim, B. Lee, Binary Search in a Balanced Tree for IP Address Lookup, in: Proc. IEEE HPSR, 2005, pp. 490\u2013494."},{"issue":"3","key":"10.1016\/j.comnet.2011.09.004_b0120","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1016\/j.comnet.2006.05.005","article-title":"Fast binary and multiway prefix searches for packet forwarding","volume":"51","author":"Chang","year":"2007","journal-title":"Computer Networks"},{"key":"10.1016\/j.comnet.2011.09.004_b0125","unstructured":"BGP Table obtained from ."},{"key":"10.1016\/j.comnet.2011.09.004_b0130","doi-asserted-by":"crossref","unstructured":"K. Zheng, B. Liu, V6Gene: a scalable IPv6 prefix generator for route lookup algorithm benchmark, in: Proc. IEEE AINA, 2006, pp. 147\u2013152.","DOI":"10.1109\/AINA.2006.344"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128611003379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128611003379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T08:54:01Z","timestamp":1560588841000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128611003379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["S1389128611003379"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2011.09.004","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}