#9980. Feasibility of Longest Prefix Matching using Learned Index Structures

September 2026publication date
Proposal available till 25-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Social Sciences (all);
Arts and Humanities (miscellaneous);
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №9980.1 Contract №9980.2 Contract №9980.3 Contract №9980.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

More details about the manuscript: Science Citation Index Expanded or/and Social Sciences Citation Index
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.
Keywords:
forwarding information base; longest prefix matching; packet forwarding

Contacts :
0