{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T21:07:25Z","timestamp":1774732045044,"version":"3.50.1"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100007431","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007431","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004085","name":"Korea government","doi-asserted-by":"publisher","award":["2014R1A2A1A11051762"],"award-info":[{"award-number":["2014R1A2A1A11051762"]}],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"MSIP","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008122","name":"ITRC","doi-asserted-by":"crossref","award":["IITP-2015-H8501-15-1007"],"award-info":[{"award-number":["IITP-2015-H8501-15-1007"]}],"id":[{"id":"10.13039\/501100008122","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010418","name":"IITP","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2016,5,1]]},"DOI":"10.1109\/tc.2015.2444850","type":"journal-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T22:36:26Z","timestamp":1434148586000},"page":"1558-1565","source":"Crossref","is-referenced-by-count":52,"title":["New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms"],"prefix":"10.1109","volume":"65","author":[{"given":"Ju Hyoung","family":"Mun","sequence":"first","affiliation":[]},{"given":"Hyesook","family":"Lim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.193"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2014.6900879"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2658260.2661765"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1882486.1882534"},{"key":"ref14","first-page":"784","article-title":"Tuple pruning using Bloom filters for packet classification","volume":"30","author":"lim","year":"2010","journal-title":"IEEE Micro"},{"key":"ref15","first-page":"1215-1226","article-title":"Hierarchical packet classification using a Bloom filter and rule-priority Tries","volume":"33","author":"priya","year":"2010","journal-title":"Computer Comm"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080114"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263136"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.1638626"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/65.912716"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2002.802001"},{"key":"ref6","first-page":"681","article-title":"Survey and proposal on binary search algorithms for longest prefix match","volume":"14","author":"lim","year":"2012","journal-title":"IEEE Commun Surveys Tuts"},{"key":"ref5","first-page":"39","article-title":"Guarantee IP lookup performance with FIB explosion","author":"yand","year":"0","journal-title":"Proc ACM Sigcomm"},{"key":"ref8","first-page":"422-426","article-title":"Space\/time trade-offs in hash coding with allowable errors","volume":"13","author":"h","year":"1970","journal-title":"Commun ACM"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/348019.348570"},{"key":"ref2","article-title":"Classless Inter-domain routing (CIDR): An address assignment and aggregation strategy","author":"fuller","year":"1993","journal-title":"RFC 1519"},{"key":"ref1","author":"varghese","year":"2005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872576"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/296502.296503","article-title":"Fast address lookups using controlled prefix expansion","volume":"17","author":"varghese","year":"1999","journal-title":"ACM Trans Comput Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062180"},{"key":"ref21","year":"0"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7447853\/7122873.pdf?arnumber=7122873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:34:30Z","timestamp":1633919670000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7122873\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,1]]},"references-count":22,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.2015.2444850","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2016,5,1]]}}}