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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A&B: AI and Block-Based TCAM Entries Replacement Scheme for Routers;IEEE Journal on Selected Areas in Communications;2022-09
2. Memory Network Architecture for Packet Processing in Functions Virtualization;IEEE Transactions on Network and Service Management;2022-09
3. A survey on AI for storage;CCF Transactions on High Performance Computing;2022-05-23
4. Learned FIB: Fast IP Forwarding without Longest Prefix Matching;2021 IEEE 29th International Conference on Network Protocols (ICNP);2021-11-01
5. Towards instance-optimized data systems;Proceedings of the VLDB Endowment;2021-07