DiCuPIT: Distributed Cuckoo Filter-based Pending Interest Table

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Mahmoudi Arman; Ahmadi Mahmood

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF COMPUTING AND SECURITY Year:2022 | Volume:9 | Issue:1 Page(s): 85-96

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

DiCuPIT: Distributed Cuckoo Filter-based Pending Interest Table

Author(s)

Mahmoudi Arman | Ahmadi Mahmood | Issue Writer Certificate

Keywords

Cuckoo filter

Named data networking (NDN)

Bloom filter

Pending interest table

DiCuPIT

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 the Pending Interest Table (PIT). Scalability, memory consumption, and integration are 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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans