  Named data networking is one of the recommended {\color{red}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 {\color{red} 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, {\color{red} that works} based on
the Cuckoo filter and can cover the three features as above-mentioned.
{\color{red} By} implementing this PIT, {\color{red} the lookup} time shows
{\color{red} 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.
