{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T06:01:47Z","timestamp":1759384907514},"reference-count":15,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T00:00:00Z","timestamp":1680480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,4,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Named Data Networking (NDN) has gained importance in today\u2019s 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,\u00a0lookup 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.<\/jats:p>","DOI":"10.1093\/comjnl\/bxad033","type":"journal-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T07:33:06Z","timestamp":1680766386000},"page":"941-946","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Pending Interest Table Content Search In NDN through Stable Bloom Filter"],"prefix":"10.1093","volume":"67","author":[{"given":"Ravneet","family":"Kaur","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Thapar Institute of Engineering & Technology , Patiala, Punjab, 147004, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amrinderpreet","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Thapar Institute of Engineering & Technology , Patiala, Punjab, 147004, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aekamjot","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Thapar Institute of Engineering & Technology , Patiala, Punjab, 147004, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Goyal","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology , Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amritpal","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, National Institute of Technology , Jalandhar, Punjab, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shalini","family":"Batra","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Thapar Institute of Engineering & Technology , Patiala, Punjab, 147004, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2023,4,3]]},"reference":[{"key":"2024041716571022400_ref1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.cosrev.2016.01.001","article-title":"Named data networking: a survey","volume":"19","author":"Saxena","year":"2016","journal-title":"Comput. Sci. Rev."},{"key":"2024041716571022400_ref2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/2396556.2396600","article-title":"On pending interest table in named data networking","volume-title":"Proceedings of the eighth ACM\/IEEE symposium on Architectures for networking and communications systems","author":"Dai","year":"2012"},{"key":"2024041716571022400_ref3","first-page":"1","article-title":"Named data networking with neural networks for intelligent image processing information systems","author":"Han","year":"2020","journal-title":"Enterp. Inf. Syst."},{"key":"2024041716571022400_ref4","doi-asserted-by":"crossref","first-page":"3453","DOI":"10.1109\/JIOT.2020.2971009","article-title":"An efficient named-data-networking-based iot cloud framework","volume":"7","author":"Wang","year":"2020","journal-title":"IEEE Internet Things J."},{"key":"2024041716571022400_ref5","article-title":"Estimation of soil properties from the eu spectral library using long short-term memory networks","volume":"18","author":"Singh","year":"2019","journal-title":"Geoderma Reg."},{"key":"2024041716571022400_ref6","doi-asserted-by":"crossref","first-page":"1850013","DOI":"10.1142\/S0219691318500133","article-title":"Underwater pipelines panoramic image transmission and refinement using acoustic sensors","volume":"16","author":"Jindal","year":"2018","journal-title":"Int. J. Wavelets, Multiresolution Inf. Process."},{"key":"2024041716571022400_ref7","doi-asserted-by":"crossref","first-page":"108232","DOI":"10.1016\/j.comnet.2021.108232","article-title":"A survey on the roles of bloom filter in implementation of the named data networking","author":"Nayak","year":"2021","journal-title":"Comput. Netw."},{"key":"2024041716571022400_ref8","first-page":"2049","article-title":"Scalable pending interest table design: From principles to practice","volume-title":"INFOCOM, 2014 Proceedings IEEE","author":"Yuan","year":"2014"},{"key":"2024041716571022400_ref9","first-page":"1","article-title":"Dipit: A distributed bloom-filter based pit table for ccn nodes","volume-title":"Computer Communications and Networks (ICCCN), 2012 21st International Conference on","author":"You","year":"2012"},{"key":"2024041716571022400_ref10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/2377310.2377326","article-title":"Compression of pending interest table with bloom filter in content centric network","volume-title":"Proceedings of the 7th International Conference on Future Internet Technologies","author":"Li","year":"2012"},{"key":"2024041716571022400_ref11","doi-asserted-by":"crossref","first-page":"1915","DOI":"10.1109\/LCOMM.2014.2359191","article-title":"Mapit: an enhanced pending interest table for ndn with mapping bloom filter","volume":"18","author":"Li","year":"2014","journal-title":"IEEE Commun. Lett."},{"key":"2024041716571022400_ref12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/356643.356645","article-title":"Hash table methods","volume":"7","author":"Maurer","year":"1975","journal-title":"ACM Comput. Surv."},{"key":"2024041716571022400_ref13","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/69.536247","article-title":"Tries for approximate string matching","volume":"8","author":"Shang","year":"1996","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2024041716571022400_ref14","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1109\/ICDCS.2012.35","article-title":"Scalable name lookup in ndn using effective name component encoding","volume-title":"2012 IEEE 32nd International Conference on Distributed Computing Systems","author":"Wang","year":"2012"},{"key":"2024041716571022400_ref15"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/3\/941\/57231502\/bxad033.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/3\/941\/57231502\/bxad033.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T19:58:53Z","timestamp":1713383933000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/3\/941\/7100602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,3]]},"references-count":15,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,4,3]]},"published-print":{"date-parts":[[2024,4,14]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxad033","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,3]]},"published":{"date-parts":[[2023,4,3]]}}}