{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T10:02:18Z","timestamp":1771236138373,"version":"3.50.1"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T00:00:00Z","timestamp":1621209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2021,5,17]]},"abstract":"<jats:p>This paper revisits longest prefix matching in IP packet forwarding because an emerging data structure, learned index, is recently presented. A learned index uses machine learning to associate key-value pairs in a key-value store. The fundamental idea to apply a learned index to an FIB is to simplify the complex longest prefix matching operation to a nearest address search operation. The size of the proposed FIB is less than half of an existing trie-based FIB while it achieves the computation speed nearly equal to the trie-based FIB. Moreover, the computation speed of the proposal is independent of the length of IP prefixes, unlike trie-based FIBs.<\/jats:p>","DOI":"10.1145\/3466826.3466842","type":"journal-article","created":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T16:09:27Z","timestamp":1621440567000},"page":"45-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Feasibility of Longest Prefix Matching using Learned Index Structures"],"prefix":"10.1145","volume":"48","author":[{"given":"Shunsuke","family":"Higuchi","sequence":"first","affiliation":[{"name":"Osaka University"}]},{"given":"Junji","family":"Takemasa","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}]},{"given":"Yuki","family":"Koizumi","sequence":"additional","affiliation":[{"name":"Osaka University"}]},{"given":"Atsushi","family":"Tagami","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}]},{"given":"Toru","family":"Hasegawa","sequence":"additional","affiliation":[{"name":"Osaka University"}]}],"member":"320","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787474"},{"key":"e_1_2_1_2_1","unstructured":"CAIDA. https:\/\/www.caida.org\/home\/.  CAIDA. https:\/\/www.caida.org\/home\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1202844"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/263109.263133"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872576"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.772439"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.700888"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405886"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/40.903060"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/NetSoft48620.2020.9165306"},{"key":"e_1_2_1_13_1","unstructured":"University of Oregon Route Views Project. http:\/\/www.routeviews.org\/routeviews\/.  University of Oregon Route Views Project. http:\/\/www.routeviews.org\/routeviews\/."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378961"},{"key":"e_1_2_1_15_1","volume-title":"Internet Engineering Task Force","author":"Zhang B.","year":"2009","unstructured":"B. Zhang FIB aggregation. Internet-Draft draft-zhang-fibaggregation-02 , Internet Engineering Task Force , Oct. 2009 . Work in Progress. B. Zhang et al. FIB aggregation. Internet-Draft draft-zhang-fibaggregation-02, Internet Engineering Task Force, Oct. 2009. Work in Progress."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3466826.3466842","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3466826.3466842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3466826.3466842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,17]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,5,17]]}},"alternative-id":["10.1145\/3466826.3466842"],"URL":"https:\/\/doi.org\/10.1145\/3466826.3466842","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2021,5,17]]},"assertion":[{"value":"2021-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}