Feasibility of Longest Prefix Matching using Learned Index Structures
2021 ◽
Vol 48
(4)
◽
pp. 45-48
Keyword(s):
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.
2016 ◽
Vol 3
(2)
◽
pp. 261-269
◽
2016 ◽
Vol IV-2/W1
◽
pp. 119-127
◽
Keyword(s):
2021 ◽
2020 ◽
2007 ◽
Vol 21
(1-3)
◽
pp. 87-95
◽
Keyword(s):