A Filter-Based Design of Pending Interest Table in Named Data Networking

Abstract

Named data networking (NDN) is a recently proposed networking model that intends to overcome the restrictions of the current Internet Protocol (IP). Many research works have been attracted to this modern Internet architecture but the pending interest table (PIT), which is one of the most important constituent of NDN node, did not take considerable concern. The PIT plays an essential role in the communication process for NDN nodes and in both directions (i.e. receiving interest packets during upstream way and receiving data packets during downstream way). PIT should be sufficiently large to accommodate a large amount of information. Also, It must be fast adequate to not be a bottleneck in the forwarding process. In this paper, we propose a novel PIT implementation called FTDF-PIT for NDN. This new design depends on employing an approximate data structure that called fast two dimensional filter (FTDF) which has better performance than the other proposed filters (Bloom and Quotient filters). This filter has high performance in terms of: insertion/deletion/query throughput, low memory requirements, and low false positive rate which makes it very suitable for implementing PIT. Our evaluations show that utilizing FTDF-PIT can result in many advantages over the existing solutions in terms of: reducing the memory consumption, minimizing false positive rate, and increasing the building and updating processes which make it very suitable to meet the current network demands.