MaPIT: An Enhanced Pending Interest Table for NDN With Mapping Bloom Filter

Named Data Networking (NDN) is a recent paradigm conceived for future Internet architectures, where communications are driven by contents instead of host addresses. To realize this paradigm, a novel data structure for forwarding processes, namely Pending Interest Table (PIT), is utilized in NDN node. Designing and evaluating a quick enough PIT with high capacity is a major challenge within the overall NDN research area. In this letter, based on our proposed Mapping Bloom filter, which is a modified data structure of Bloom filter, we present an enhanced implementation of PIT called MaPIT. Our evaluations indicate that MaPIT can minimize the on-chip memory consumption to 2.097 MB. And the probability of false positive is under 1% for 2 million names. It allows MaPIT to use SRAM as on-chip memory and satisfy the current network requirements.