Access the full text.
Sign up today, get DeepDyve free for 14 days.
Sarang Dharmapurikar, P. Krishnamurthy, T. Sproull, J. Lockwood (2004)
Deep packet inspection using parallel bloom filtersIEEE Micro, 24
Wei You, B. Mathieu, Patrick Truong, Jean-François Peltier, G. Simon (2012)
DiPIT: A Distributed Bloom-Filter Based PIT Table for CCN Nodes2012 21st International Conference on Computer Communications and Networks (ICCCN)
W. So, A. Narayanan, D. Oran, Yaogong Wang (2012)
Toward fast NDN software forwarding lookup engine based on hash tables2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)
Junxiao Shi, Davide Pesavento, L. Benmohamed (2020)
NDN-DPDK: NDN Forwarding at 100 Gbps on Commodity HardwareProceedings of the 7th ACM Conference on Information-Centric Networking
W. So, A. Narayanan, D. Oran (2013)
Named data networking on a router: Fast and DoS-resistant forwarding with hash tablesArchitectures for Networking and Communications Systems
DE Knuth (1997)
The art of computer programmingFundamental Algorithms
Minseok Kwon, P. Reviriego, S. Pontarelli (2016)
A length-aware cuckoo filter for faster IP lookup2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Weiwen Yu, D. Pao (2016)
Hardware accelerator to speed up packet processing in NDN routerComput. Commun., 91-92
G. Whitesides (1970)
The Art of Computer ProgrammingNuclear Science and Engineering, 40
Zhuo Li, Yaping Xu, Beichuan Zhang, Liu Yan, Kaihua Liu (2019)
Packet Forwarding in Named Data Networking Requirements and Survey of SolutionsIEEE Communications Surveys & Tutorials, 21
P. Reviriego, Jorge Martínez, S. Pontarelli (2019)
CFBF: Reducing the Insertion Time of Cuckoo Filters With an Integrated Bloom FilterIEEE Communications Letters, 23
J. Mun, Hyesook Lim (2016)
New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based AlgorithmsIEEE Transactions on Computers, 65
Elham Safi, Andreas Moshovos, A. Veneris (2006)
L-CBF: A Low-Power, Fast Counting Bloom Filter ArchitectureIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 16
Zhuo Li, Kaihua Liu, Yang Zhao, Yongtao Ma (2014)
MaPIT: An Enhanced Pending Interest Table for NDN With Mapping Bloom FilterIEEE Communications Letters, 18
Haowei Yuan, P. Crowley (2014)
Scalable Pending Interest Table design: From principles to practiceIEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Kosuke Taniguchi, Junji Takemasa, Y. Koizumi, T. Hasegawa (2016)
A Method for Designing High-speed Software NDN RoutersProceedings of the 3rd ACM Conference on Information-Centric Networking
Divya Saxena, V. Raychoudhury (2016)
Radient: Scalable, memory efficient name lookup algorithm for named data networkingJ. Netw. Comput. Appl., 63
Raaid Alubady, S. Hassan, Adib Habbal (2017)
Pending interest table control management in Named Data NetworkJ. Netw. Comput. Appl., 111
Roaa Shubbar, M. Ahmadi (2019)
A Filter-Based Design of Pending Interest Table in Named Data NetworkingJournal of Network and Systems Management
Paulo Almeida, Carlos Baquero, Nuno Preguiça, D. Hutchison (2007)
Scalable Bloom FiltersInf. Process. Lett., 101
Matteo Varvello, Diego Perino, Leonardo Linguaglossa (2013)
On the design and implementation of a wire-speed pending interest table2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Yalei Tan, Qing Li, Yong Jiang, Shutao Xia (2015)
RAPIT: RTT-Aware Pending Interest Table for Content Centric Networking2015 IEEE 34th International Performance Computing and Communications Conference (IPCCC)
Puming Fang, T. Wolf (2021)
Enabling Virtual Network Functions in Named Data NetworkingIEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
V. Sivaraman, D. Guha, B. Sikdar (2020)
Optimal Pending Interest Table Size for ICN With Mobile ProducersIEEE/ACM Transactions on Networking, 28
Huichen Dai, B. Liu, Yan Chen, Yi Wang (2012)
On Pending Interest Table in Named Data Networking2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)
A. Azgin, R. Ravindran, Guoqiang Wang (2016)
pit/LESS: Stateless Forwarding in Content Centric Networks2016 IEEE Global Communications Conference (GLOBECOM)
Bin Fan, D. Andersen, M. Kaminsky, M. Mitzenmacher (2014)
Cuckoo Filter: Practically Better Than BloomProceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies
Madhurima Buragohain, Sukumar Nandi (2020)
Quality of Service provisioning in Named Data Networking via PIT entry reservation and PIT replacement policyComput. Commun., 155
D. Mansour, Haidar Osman, C. Tschudin (2019)
Load Balancing in the Presence of Services in Named-Data NetworkingJournal of Network and Systems Management, 28
V. Jacobson, D. Smetters, J. Thornton, M. Plass, Nicholas Briggs, R. Braynard (2012)
Networking named contentCommunications of the ACM, 55
Named data networking is one of the proposed architectures for the future Internet. In this architecture, names play an essential role. Packets in named data networking have names that are used instead of IP addresses, and based on these names, packets are forwarded through the network routers. For this purpose, named data network routers have three data structures content store, pending interest table (PIT), and forwarding information base. In named data networking, the PIT table plays an important role. In this table, the information of all Interest packets waiting for Data packets is stored. The PIT should be able to search, delete, update information quickly, and in turn, take up little memory space. In this paper, a new variant of the Cuckoo filter to improve the performance of the PIT table called two-dimensional neighbor-based Cuckoo filter (2DNCF) is proposed. The proposed 2DNCF uses the physical neighbor of the selected bucket by the Cuckoo filter that increases the utilization of the neighbor buckets, as well as the performance of the proposed 2DNCF filter. In this data structure, which is essentially a two-dimensional Cuckoo filter, an attempt has been made to use the second hashing function less than the first one in the Cuckoo filter. Due to less use of the second hashing function in this filter, it is more efficient in inserting, deleting, and searching than the standard Cuckoo filter. The simulation results show that this filter has a lower false positive rate than the standard Cuckoo filter. Accordingly, it improves the insertion, deletion and lookup performance of the PIT table compared to the other solutions.
Journal of Network and Systems Management – Springer Journals
Published: Jul 1, 2022
Keywords: PIT; Pending interest table; Cuckoo filter; Two-dimensional neighbor-based Cuckoo filter; 2DNCF
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.