An Efficient Pending Interest Table Content Search In NDN through Stable Bloom Filter

• Published in: Computer journal Vol. 67; no. 3; pp. 941 - 946
• Main Authors: Kaur, Ravneet, Singh, Amrinderpreet, Singh, Aekamjot, Goyal, Amit, Singh, Amritpal, Batra, Shalini
• Format: Journal Article
• Language: English
• Published: Oxford University Press 14.04.2024
• Subjects: Stable Bloom Filter (SBF); Named Data Networking (NDN); Pending Interest Table (PIT)
• ISSN: 0010-4620; 1460-2067
• DOI: 10.1093/comjnl/bxad033

Named Data Networking (NDN) has gained importance in today’s era due to a paradigm shift in the Internet usage pattern which revolves around the content rather than the respective host addresses. Three important data structures in NDN are Content Store (CS), Pending Interest Table (PIT) and Forwarding Information Base (FIB). The search time of PIT is quite high since its size grows with the addition of new content names, and the Interest packets which are not served by CS are searched in millions of existing entries in the PIT. Hence, lookup time can be improved if, instead of checking all the available entries, initial scanning is done to determine whether the required content name exists in the PIT or not. In this paper, we propose a Stable Bloom Filter (SBF) based PIT called S-PIT, to minimize the PIT search time by identifying the existence of query content through SBF. The various experiments performed show that S-PIT outperforms existing data structures in terms of memory consumption, content insertion time, average search time and false positive rate.