Feasibility of Longest Prefix Matching using Learned Index Structures
Published: 17 May 2021
ACM SIGMETRICS Performance Evaluation Review , Volume 48, pp 45-48; https://doi.org/10.1145/3466826.3466842
Abstract: 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.
Keywords: longest prefix matching / packet forwarding / forwarding information base
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Click here to see the statistics on "ACM SIGMETRICS Performance Evaluation Review" .