A Hash-Free method for FIB and LNPM in ICN programmable data planes

One core component of Named-Data Networking (NDN) is the Forwarding Information Base (FIB). FIB makes the NDN a global network where hierarchical names are routed by performing a Longest Name Prefix Matching (LNPM) at each node. One of the challenges in NDN is how to perform the LNPM so that even up lookup speed and memory consumption. Even though some initiatives speed up the LNPM by using P4 in ...