BF-PDT: A New Name Lookup Mechanism in Content-Centric Networking

Content-Centric Networking (CCN) as a promising architecture of Information-Centric Networking (ICN) relies upon variable-length hierarchical names instead of fixed-length host addresses. The problem of name lookup mechanism in CCN is a research hotspot. However, the existing mechanism with the longest prefix matching (LMP) method cannot meet the requirements of CCN because of the variable length and the large size of CCN names. To solve this problem, in this paper, we propose a novel name lookup mechanism (named by BF-PDT), which combines with Bloom Filter, the Popularity table and the Degraded Tire. In BF-PDT, bloom filter can help us determine whether the element is in set. Meanwhile, the popularity table is according to the access features of the CCN network and the degraded tire is proposed to improve tire. Finally, we experiment with BF-PDT and the results show that the BF-PDT can obtain high lookup speed at the cost of small memory.