Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking

Authors:
Publisher website
Google Scholar
Abstract
In Named Data Networking (NDN), packet forwarding decisions rely upon lookup operations on variable-length hierarchical names instead of fixed-length host addresses. This pivotal feature introduces new challenges in the deployment of NDN at the Internet scale. In this letter, a novel Name Lookup engine with Adaptive Prefix Bloom filter (NLAPB) is conceived, in which each NDN name/prefix is split into B-prefix followed by T-suffix. B-prefix is matched by Bloom filters whereas T-suffix is processed by the small-scale trie. The length of B-prefixes (and T-suffixes) is dynamically throttled based on their popularity in order to accelerate the lookup. Experimental results show that: (i) NLAPB is able to lower the false positive rate with respect to a lookup entirely based on Bloom filters; (ii) it decreases the memory requirements with respect to a trie-based approach; (iii) it reduces processing time with respect to both them.