2DNCF-PIT: Two-Dimensional Neighbor-Based Cuckoo Filter for Pending Interest Table Lookup in Named Data Networking

Abstract

Named data networking is one of the recommended architectures for the future of the Internet. In this communication architecture, the content name is used instead of the IP address. To achieve this purpose, a new data structure is added to the nodes of named data networking which is called Pending Interest Table (PIT). Scalability, memory consumption, and integration are the significant challenges in PIT design as it needs to be updated for each packet, and it saves the name of the packet. This paper introduces a new data structure for PIT called DiCuPIT. DiCuPIT is a distributed data structure for the PIT table, that works based on the Cuckoo filter and can cover the three features as above-mentioned. By implementing this PIT, the lookup time shows a 36% reduction compared to the methods based on the Bloom filter and 40% based on hash tables. Moreover, the memory consumption is reduced by 68% compared to the hash tables-based mechanisms and 31% compared to the methods based on the Bloom filter.

RFID Batch Authentication—A Usable Scheme Providing Anonymity

“…Cuckoo filter is a data structure that supports approximate set membership tests and can replace Bloom filters. Cuckoo filter has been applied in, e.g., vehicular ad-hoc networks (VANETs) for more efficient authentication protocols [SGA + 20], [SMM22], Software Defined Networking (SDN) use-cases like network caching, multicast, and firewalls [KE20], and Named Data Networking (NDN) [MA22]. • Finally we implement our propositions based on: regular Bloom filters, double hashing, and cuckoo filters.…”