Efficient Lookup Schemes Based on Splitting Name for NDN

Abstract

Named Data Networking (NDN) is a novel networking architecture which retrieves the content by using its variable-length names. Name-based forwarding is a typical feature of NDN. Therefore, it has necessitated the design of fast forwarding lookup algorithms. In this paper, we propose an efficient name lookup scheme called SNBS (Split the Name into Basis and Suffix). In this scheme, we decompose Basis into many components. Each component of Basis is stored in a Counting Bloom Filter (CBF). In addition, we also introduce a correlation verification method to ensure inherent correlation of all components of Basis. Furthermore, Suffix is processed by tree bitmap. By simulation, we show that our proposed lookup scheme can improve the lookup rate. Moreover, our scheme also reduces the bound of false positive probability.