乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:22:55Z","timestamp":1725452575565},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF)","doi-asserted-by":"crossref","award":["NRF-2014R1A2A1A11051762","NRF-2015R1A2A1A15054081"],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ministry of Science, ICT and Future Planning (MSIP), Korea, under the Information Technology Research Center (ITRC)","award":["IITP-2015-H8501-15-1007"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Network and Computer Applications"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1016\/j.jnca.2016.02.008","type":"journal-article","created":{"date-parts":[[2016,2,24]],"date-time":"2016-02-24T21:55:00Z","timestamp":1456350900000},"page":"36-47","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":34,"special_numbering":"C","title":["Name prefix matching using bloom filter pre-searching for content centric network"],"prefix":"10.1016","volume":"65","author":[{"given":"Jungwon","family":"Lee","sequence":"first","affiliation":[]},{"given":"Miran","family":"Shim","sequence":"additional","affiliation":[]},{"given":"Hyesook","family":"Lim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"June (10)","key":"10.1016\/j.jnca.2016.02.008_bib1","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/j.comcom.2010.03.009","article-title":"Hierarchical packet classification using a bloom filter and rule-priority tries","volume":"33","author":"Alagu Priya","year":"2010","journal-title":"Comput. Commun."},{"key":"10.1016\/j.jnca.2016.02.008_bib2","unstructured":"Alexa the Web Information Company. \u3008http:\/\/www.alexa.com\/\u3009"},{"issue":"December","key":"10.1016\/j.jnca.2016.02.008_bib3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MCOM.2012.6384450","article-title":"A survey of naming and routing in information-centric networks","author":"Bari","year":"2012","journal-title":"IEEE Commun. Mag."},{"issue":"7","key":"10.1016\/j.jnca.2016.02.008_bib4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/time tradeoffs in hash coding with allowable errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jnca.2016.02.008_bib5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TNET.2006.872576","article-title":"Longest prefix matching using Bloom filters","volume":"14","author":"Dharmapurikar","year":"2006","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.jnca.2016.02.008_bib6","doi-asserted-by":"crossref","unstructured":"Esteve C, Verdi FL, Magalhaes MF, 2008. Towards a new generation of information-oriented Internet working architectures. In: ACM CoNEXT.","DOI":"10.1145\/1544012.1544077"},{"key":"10.1016\/j.jnca.2016.02.008_bib7","doi-asserted-by":"crossref","unstructured":"Jacobson V, Smetters DK, Thornton JD, Plass M, Briggs N, Braynard R, 2009. Networking named content. In: ACM CoNEXT.","DOI":"10.1145\/1658939.1658941"},{"issue":"July (4)","key":"10.1016\/j.jnca.2016.02.008_bib8","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.12785\/amis\/080445","article-title":"Reducing false positives of a bloom filter using cross-checking bloom filters","volume":"8","author":"Lim","year":"2014","journal-title":"Appl. Math. Inf. Sci."},{"issue":"February (2)","key":"10.1016\/j.jnca.2016.02.008_bib9","first-page":"411","article-title":"On adding bloom filters to longest prefix matching algorithms","volume":"63","author":"Lim","year":"2014","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.jnca.2016.02.008_bib10","doi-asserted-by":"crossref","unstructured":"Lim H, Shim M, Lee J, 2015. Name prefix matching using bloom filter pre-searching. In: IEEE\/ACM ANCS, May, pp. 203\u2013204.","DOI":"10.1109\/ANCS.2015.7110141"},{"key":"10.1016\/j.jnca.2016.02.008_bib11","article-title":"New approach for efficient ip address lookup using a bloom filter in trie-based algorithms","author":"Mun","year":"2015","journal-title":"IEEE Trans. Comput."},{"issue":"July (3)","key":"10.1016\/j.jnca.2016.02.008_bib12","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1145\/348019.348570","article-title":"On-chip vs. off-chip memory","volume":"5","author":"Panda","year":"2000","journal-title":"IEEE Trans. Design Autom. Electron. Syst."},{"key":"10.1016\/j.jnca.2016.02.008_bib13","doi-asserted-by":"crossref","unstructured":"Perino D, Varvello M, 2011. A reality check for content centric networking. In: Proceedings of ACM, August, pp. 44\u201349.","DOI":"10.1145\/2018584.2018596"},{"issue":"April","key":"10.1016\/j.jnca.2016.02.008_bib14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.jnca.2014.06.009","article-title":"NDNBrowser","volume":"50","author":"Qiao","year":"2015","journal-title":"J. Netw. Comput. Appl."},{"issue":"January (1)","key":"10.1016\/j.jnca.2016.02.008_bib15","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/LCOMM.2013.112413.132231","article-title":"Scalable name lookup with adaptive prefix bloom filter for named data networking","volume":"18","author":"Quan","year":"2014","journal-title":"IEEE Commun. Lett."},{"key":"10.1016\/j.jnca.2016.02.008_bib16","doi-asserted-by":"crossref","unstructured":"Song H, Dharmapurikar S, Turner J, Lockwood J, 2005. Fast hash table lookup using extended bloom filter: an aid to network processing. In: ACM SIGCOMM, pp. 181\u2013192.","DOI":"10.1145\/1080091.1080114"},{"issue":"March","key":"10.1016\/j.jnca.2016.02.008_bib17","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jnca.2013.04.002","article-title":"Bloom filter-based workflow management to enable QoS guarantee in wireless sensor networks","volume":"39","author":"Tong","year":"2014","journal-title":"J. Netw. Comput. Appl."},{"issue":"June","key":"10.1016\/j.jnca.2016.02.008_bib18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jnca.2015.02.001","article-title":"Information centric network","volume":"52","author":"Vasilakos","year":"2015","journal-title":"J. Netw. Comput. Appl."},{"key":"10.1016\/j.jnca.2016.02.008_bib19","doi-asserted-by":"crossref","unstructured":"Wang Y, Dai H, Jiang J, He K, Meng W, Liu B, 2011. Parallel name lookup for named data networking. In: IEEE GLOBECOM, December, pp. 1\u20135","DOI":"10.1109\/GLOCOM.2011.6134161"},{"key":"10.1016\/j.jnca.2016.02.008_bib20","doi-asserted-by":"crossref","unstructured":"Wang Y, He K, Dai H, Meng W, Jiang J, Liu B, Chen Y, 2012. Scalable name lookup in NDN using effective name component encoding. In: IEEE ICDCS, 2012.","DOI":"10.1109\/ICDCS.2012.35"},{"key":"10.1016\/j.jnca.2016.02.008_bib21","doi-asserted-by":"crossref","unstructured":"Wang Y, Pan T, Mi Z, Dai H, Guo X, Zhang T, Liu B, 2013. NameFilter: achieving fast name lookup with low memory cost via applying two-stage Bloom filters. In: IEEE INFOCOM, pp. 95\u201399.","DOI":"10.1109\/INFCOM.2013.6566742"},{"key":"10.1016\/j.jnca.2016.02.008_bib22","doi-asserted-by":"crossref","first-page":"3165","DOI":"10.1016\/j.comnet.2013.07.006","article-title":"GPU-accelerated name lookup with component encoding","volume":"57","author":"Wang","year":"2013","journal-title":"Comput. Netw."},{"key":"10.1016\/j.jnca.2016.02.008_bib23","doi-asserted-by":"crossref","unstructured":"So W, Narayanan A, Oran D, 2013. Named data networking on a router: fast and DoS-resistant forwarding with hash tables. In: ACM\/IEEE Symposium on Architectures for Networking and Communications Systems, 2013.","DOI":"10.1109\/ANCS.2013.6665203"},{"issue":"January","key":"10.1016\/j.jnca.2016.02.008_bib24","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.jnca.2013.03.002","article-title":"A novel cache size optimization scheme based on manifold learning in content centric networking","volume":"37","author":"Xu","year":"2014","journal-title":"J. Netw. Comput. Appl."}],"container-title":["Journal of Network and Computer Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1084804516000916?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1084804516000916?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T23:21:23Z","timestamp":1567639283000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1084804516000916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":24,"alternative-id":["S1084804516000916"],"URL":"https:\/\/doi.org\/10.1016\/j.jnca.2016.02.008","relation":{},"ISSN":["1084-8045"],"issn-type":[{"value":"1084-8045","type":"print"}],"subject":[],"published":{"date-parts":[[2016,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Name prefix matching using bloom filter pre-searching for content centric network","name":"articletitle","label":"Article Title"},{"value":"Journal of Network and Computer Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jnca.2016.02.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}