{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:33:09Z","timestamp":1770975189054,"version":"3.50.1"},"reference-count":93,"publisher":"PeerJ","license":[{"start":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T00:00:00Z","timestamp":1770940800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Research Foundation of Korea (NRF), Korea Government","award":["RS-2022-NR069069"],"award-info":[{"award-number":["RS-2022-NR069069"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Named Data Networking (NDN) has emerged as a promising content-centric paradigm for the future Internet, transitioning from host-based to data-centric communication. This survey presents a comprehensive review of state-of-the-art naming and packet lookup mechanisms in NDN, addressing critical challenges including scalability, memory efficiency, lookup latency, table update complexity, and deployment feasibility. To the best of our knowledge, this is the first survey to jointly examine both naming and packet lookup mechanisms within a unified taxonomy, providing comparative insights across diverse domains, including wired and wireless NDN environments. We classify naming schemes into hierarchical, flat, attribute based, and hybrid approaches, and evaluate packet lookup schemes in the Content Store (CS), Pending Interest Table (PIT), and Forwarding Information Base (FIB) data structures. Here, we defines packet lookup in a specific context, referring exclusively to the name-based search conducted on the CS, PIT, and FIB, as compared to the wider packet processing flow. This survey highlights domain-specific design trade-offs, architectural directions, and the implications of emerging technologies. Finally, we identify open research challenges and propose future directions that involve dynamic naming, distributed PIT designs, integration with emerging technologies, and standardization, aiming to advance the efficiency and adaptability of NDN in real-world scenarios.<\/jats:p>","DOI":"10.7717\/peerj-cs.3551","type":"journal-article","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:13:18Z","timestamp":1770970398000},"page":"e3551","source":"Crossref","is-referenced-by-count":0,"title":["Advancing named data networking: a comprehensive survey on naming and packet lookup mechanisms"],"prefix":"10.7717","volume":"12","author":[{"given":"Rimsha","family":"Asif","sequence":"first","affiliation":[{"name":"FAST School of Computing, National University of Computer and Emerging Sciences, Lahore, Pakistan"}]},{"given":"Rana Asif","family":"Rehman","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Technology, Muscat University, Muscat, Oman"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9406-398X","authenticated-orcid":true,"given":"Ahmad","family":"Arsalan","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology and Computer Science, University of Central Punjab, Lahore, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9824-1950","authenticated-orcid":true,"given":"Byung-Seo","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Software and Communications Engineering, Hongik University, Sejong, Republic of Korea"}]}],"member":"4443","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"10.7717\/peerj-cs.3551\/ref-1","doi-asserted-by":"publisher","first-page":"71827","DOI":"10.1109\/ACCESS.2019.2919534","article-title":"Survey on the incorporation of NDN\/CCN in IoT","volume":"7","author":"Aboodi","year":"2019","journal-title":"IEEE Access"},{"key":"10.7717\/peerj-cs.3551\/ref-2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MCOM.2012.6231276","article-title":"A survey of information-centric networking","volume":"50","author":"Ahlgren","year":"2012","journal-title":"IEEE Communications Magazine"},{"issue":"8","key":"10.7717\/peerj-cs.3551\/ref-3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.3390\/fi16080258","article-title":"Software-defined named data networking in literature: a review","volume":"16","author":"Alhawas","year":"2024","journal-title":"Future Internet"},{"key":"10.7717\/peerj-cs.3551\/ref-4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comnet.2014.07.003","article-title":"Content-centric wireless networking: a survey","volume":"72","author":"Amadeo","year":"2014","journal-title":"Computer Networks"},{"key":"10.7717\/peerj-cs.3551\/ref-5","doi-asserted-by":"publisher","first-page":"103235","DOI":"10.1016\/j.adhoc.2023.103235","article-title":"Reduced network forwarding with controller enabled named software defined internet of mobile things","volume":"149","author":"Ansari","year":"2023","journal-title":"Ad Hoc Networks"},{"key":"10.7717\/peerj-cs.3551\/ref-6","doi-asserted-by":"publisher","first-page":"15315","DOI":"10.1109\/ACCESS.2023.3244247","article-title":"E-DRAFT: an efficient data retrieval and forwarding technique for named data network based wireless multimedia sensor networks","volume":"11","author":"Arsalan","year":"2023","journal-title":"IEEE Access"},{"key":"10.7717\/peerj-cs.3551\/ref-7","doi-asserted-by":"publisher","first-page":"109121","DOI":"10.1016\/j.comnet.2022.109121","article-title":"Interest broadcasting and timing attack in IoV (IBTA-IoV): a novel architecture using named software defined network","volume":"213","author":"Arsalan","year":"2022","journal-title":"Computer Networks"},{"key":"10.7717\/peerj-cs.3551\/ref-8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3102304.3102345","article-title":"Towards Information-Centric Networking (ICN) naming for Internet of Things (IoT): the case of smart campus","volume-title":"Proceedings of the International Conference on Future Networks and Distributed Systems (ICFNDS \u201917)","author":"Arshad","year":"2017"},{"key":"10.7717\/peerj-cs.3551\/ref-9","doi-asserted-by":"crossref","DOI":"10.1109\/ICCVE.2014.7297653","article-title":"Hierarchical and hash-based naming scheme for vehicular information-centric networks","author":"Bouk","year":"2014"},{"key":"10.7717\/peerj-cs.3551\/ref-10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.comcom.2015.09.014","article-title":"Hierarchical and hash-based naming with compact trie name management scheme for vehicular content-centric networks","volume":"71","author":"Bouk","year":"2015","journal-title":"Computer Communications"},{"issue":"2","key":"10.7717\/peerj-cs.3551\/ref-11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.3390\/app9020329","article-title":"A new bloom filter architecture for FIB lookup in named data networking","volume":"9","author":"Byun","year":"2019","journal-title":"Applied Sciences"},{"key":"10.7717\/peerj-cs.3551\/ref-12","doi-asserted-by":"crossref","DOI":"10.1145\/2810156.2810167","article-title":"Pending interest table sizing in named data networking","author":"Carofiglio","year":"2015"},{"key":"10.7717\/peerj-cs.3551\/ref-13","doi-asserted-by":"crossref","DOI":"10.1109\/ISCC.2016.7543915","article-title":"An improved trie-based name lookup scheme for named data networking","author":"Dagang","year":"2016"},{"key":"10.7717\/peerj-cs.3551\/ref-14","doi-asserted-by":"crossref","DOI":"10.1145\/2396556.2396600","article-title":"On pending interest table in named data networking","author":"Dai","year":"2012"},{"key":"10.7717\/peerj-cs.3551\/ref-15","doi-asserted-by":"crossref","DOI":"10.1109\/INFOCOM.2015.7218616","article-title":"BFAST: unified and scalable index for NDN forwarding architecture","author":"Dai","year":"2015"},{"key":"10.7717\/peerj-cs.3551\/ref-16","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOMW.2013.6970713","article-title":"Efficiently looking up non-aggregatable name prefixes by reducing prefix seeking","author":"Fukushima","year":"2013"},{"key":"10.7717\/peerj-cs.3551\/ref-17","doi-asserted-by":"crossref","DOI":"10.1109\/ICNP.2018.00046","article-title":"A fast and memory-efficient trie structure for name-based packet forwarding","author":"Ghasemi","year":"2018"},{"issue":"2","key":"10.7717\/peerj-cs.3551\/ref-18","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/TNET.2019.2901487","article-title":"On the granularity of trie-based data structures for name lookups and updates","volume":"27","author":"Ghasemi","year":"2019","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.7717\/peerj-cs.3551\/ref-19","doi-asserted-by":"crossref","DOI":"10.1109\/WF-IoT58464.2023.10539433","article-title":"BalanceDN: load-balancing allocation of interest for fast discovery in content-centric networks","author":"Gunti","year":"2023"},{"key":"10.7717\/peerj-cs.3551\/ref-20","article-title":"Mobile sources in an information-centric network with hierarchical names: an indirection approach","author":"Hermans","year":"2011"},{"key":"10.7717\/peerj-cs.3551\/ref-21","doi-asserted-by":"crossref","DOI":"10.1109\/ICACT.2015.7224835","article-title":"A flat name-based routing scheme for information-centric networking","author":"Hong","year":"2015"},{"issue":"2","key":"10.7717\/peerj-cs.3551\/ref-22","first-page":"125","article-title":"A CRC-32 name prefix encoding in named data networking","volume":"8","author":"Hsu","year":"2014","journal-title":"International Journal of Advanced Information Technologies (IJAIT)"},{"key":"10.7717\/peerj-cs.3551\/ref-23","doi-asserted-by":"publisher","first-page":"00015","DOI":"10.3389\/fict.2019.00015","article-title":"A composite structure for fast name prefix lookup","volume":"6","author":"Hu","year":"2019","journal-title":"Frontiers in ICT"},{"key":"10.7717\/peerj-cs.3551\/ref-24","doi-asserted-by":"crossref","DOI":"10.1109\/IWQoS.2018.8624182","article-title":"A hybrid approach to scalable name prefix lookup","author":"Huang","year":"2018"},{"issue":"7","key":"10.7717\/peerj-cs.3551\/ref-25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.14257\/ijfgcn.2016.9.7.09","article-title":"Steerable name lookup based on classified prefixes and scalable one memory access bloom filter for named data networking","volume":"9","author":"Huang","year":"2016","journal-title":"International Journal of Future Generation Communication and Networking"},{"key":"10.7717\/peerj-cs.3551\/ref-26","doi-asserted-by":"crossref","DOI":"10.1145\/1658939.1658941","article-title":"Networking named content","author":"Jacobson","year":"2009"},{"key":"10.7717\/peerj-cs.3551\/ref-27","doi-asserted-by":"publisher","first-page":"90254","DOI":"10.1109\/ACCESS.2022.3201083","article-title":"Named data networking: a survey on routing strategies","volume":"10","author":"Karim","year":"2022","journal-title":"IEEE Access"},{"key":"10.7717\/peerj-cs.3551\/ref-28","doi-asserted-by":"crossref","DOI":"10.1109\/BigData59044.2023.10386513","article-title":"A fuzzy optimized route selection framework for autonomous vehicles using V-NDN","author":"Kaushik","year":"2023"},{"key":"10.7717\/peerj-cs.3551\/ref-29","doi-asserted-by":"crossref","DOI":"10.1109\/IWCMC.2019.8766564","article-title":"A name-to-hash encoding scheme for vehicular named data networks","author":"Khelifi","year":"2019"},{"issue":"8","key":"10.7717\/peerj-cs.3551\/ref-30","doi-asserted-by":"publisher","first-page":"4163","DOI":"10.3390\/app15084163","article-title":"A distance-encoded bloom filter for fast NDN name lookup","volume":"15","author":"Kim","year":"2025","journal-title":"Applied Sciences"},{"key":"10.7717\/peerj-cs.3551\/ref-31","first-page":"37","author":"Labbi","year":"2019","journal-title":"CCN context-naming for efficient context-aware service discovery in IoT"},{"key":"10.7717\/peerj-cs.3551\/ref-32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/9684032","article-title":"Preallocated duplicate name prefix detection mechanism using naming pool in CCN-based mobile IoT networks","volume":"2016","author":"Lee","year":"2016","journal-title":"Mobile Information Systems"},{"key":"10.7717\/peerj-cs.3551\/ref-33","doi-asserted-by":"crossref","DOI":"10.1145\/2377310.2377326","article-title":"Compression of pending interest table with bloom filter in content-centric network","author":"Li","year":"2012"},{"key":"10.7717\/peerj-cs.3551\/ref-34","doi-asserted-by":"crossref","DOI":"10.1109\/NAS.2014.36","article-title":"Longest prefix lookup in named data networking: how fast can it be?","author":"Li","year":"2014a"},{"issue":"2","key":"10.7717\/peerj-cs.3551\/ref-35","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TDSC.2016.2550437","article-title":"Attribute-based access control for ICN naming scheme","volume":"15","author":"Li","year":"2018","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"1","key":"10.7717\/peerj-cs.3551\/ref-36","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1186\/s13638-017-0836-0","article-title":"Hybrid wireless networks with FIB-based named data networking","volume":"2017","author":"Li","year":"2017","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"issue":"2","key":"10.7717\/peerj-cs.3551\/ref-37","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/TNET.2021.3119769","article-title":"Smart name lookup for NDN forwarding plane via neural networks","volume":"30","author":"Li","year":"2022","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"11","key":"10.7717\/peerj-cs.3551\/ref-38","doi-asserted-by":"publisher","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":"2014c","journal-title":"IEEE Communications Letters"},{"issue":"2","key":"10.7717\/peerj-cs.3551\/ref-39","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1109\/COMST.2018.2880444","article-title":"Packet forwarding in named data networking: requirements and survey of solutions","volume":"21","author":"Li","year":"2019","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"10.7717\/peerj-cs.3551\/ref-40","doi-asserted-by":"crossref","DOI":"10.1109\/FPL.2014.6927403","article-title":"Accelerate NDN name lookup using FPGA: challenges and a scalable approach","author":"Li","year":"2014b"},{"issue":"19","key":"10.7717\/peerj-cs.3551\/ref-41","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.3390\/electronics11193243","article-title":"A cuckoo filter-based name resolution and routing method in information-centric networking","volume":"11","author":"Lian","year":"2022","journal-title":"Electronics"},{"key":"10.7717\/peerj-cs.3551\/ref-42","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/s42452-024-05903-4","article-title":"A hybrid congestion control scheme for named data networking via SDN","volume":"6","author":"Ma","year":"2024","journal-title":"Discover Applied Sciences"},{"key":"10.7717\/peerj-cs.3551\/ref-43","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.comcom.2023.11.008","article-title":"DINNRS: a distributed in-network name resolution system for information-centric networks","volume":"213","author":"Ma","year":"2024","journal-title":"Computer Communications"},{"issue":"1","key":"10.7717\/peerj-cs.3551\/ref-44","doi-asserted-by":"publisher","first-page":"85","DOI":"10.22108\/jcs.2022.132747.1091","article-title":"DiCuPIT: distributed cuckoo filter-based pending interest table","volume":"9","author":"Mahmoudi","year":"2022","journal-title":"Journal of Computing and Security"},{"issue":"3","key":"10.7717\/peerj-cs.3551\/ref-45","doi-asserted-by":"publisher","first-page":"85","DOI":"10.3390\/info10030085","article-title":"Name lookup in named data networking: a review","volume":"10","author":"Majed","year":"2019","journal-title":"Information"},{"key":"10.7717\/peerj-cs.3551\/ref-46","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1802.03072","article-title":"Experimentation with fuzzy interest forwarding in named data networking","author":"Mastorakis","year":"2018"},{"key":"10.7717\/peerj-cs.3551\/ref-47","doi-asserted-by":"publisher","first-page":"3178","DOI":"10.3390\/app9153178","article-title":"On sharing a FIB table in named data networking","volume":"9","author":"Mun","year":"2019","journal-title":"Applied Science"},{"issue":"1","key":"10.7717\/peerj-cs.3551\/ref-48","first-page":"40","article-title":"NO-DSA: a novel and optimal forwarding protocol for data packet storm avoidance in named data network-based internet of vehicles (NDN-IoVs)","volume":"5","author":"Naseer","year":"2024","journal-title":"Pakistan Journal of Multidisciplinary Research"},{"issue":"12","key":"10.7717\/peerj-cs.3551\/ref-49","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.7840\/kics.2015.40.12.2419","article-title":"A named data networking testbed with global NDN connection","volume":"40","author":"Ni","year":"2015","journal-title":"The Journal of Korean Institute of Communications and Information Sciences"},{"key":"10.7717\/peerj-cs.3551\/ref-50","first-page":"289","article-title":"M2HAV: a standardized ICN naming scheme for wireless devices in internet of things","author":"Nour","year":"2017"},{"key":"10.7717\/peerj-cs.3551\/ref-51","doi-asserted-by":"crossref","DOI":"10.1109\/ICWT55831.2022.9935350","article-title":"Naming scheme on named data networking: a survey","author":"Nurhayati","year":"2022"},{"key":"10.7717\/peerj-cs.3551\/ref-52","first-page":"1387","article-title":"A study on naming and caching in named data networking","author":"Paul","year":"2021"},{"key":"10.7717\/peerj-cs.3551\/ref-53","doi-asserted-by":"crossref","DOI":"10.1145\/2658260.2658267","article-title":"Caesar: a content router for high-speed forwarding on content names","author":"Perino","year":"2014"},{"key":"10.7717\/peerj-cs.3551\/ref-54","article-title":"Uniform information with a hybrid naming (HN) scheme draft-zhang-icnrg-hn-04.txt. Technical report, ICNRG Internet Draft. Expires","author":"Quan","year":"2016"},{"issue":"1","key":"10.7717\/peerj-cs.3551\/ref-55","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/LCOMM.2013.112413.132231","article-title":"Scalable name lookup with adaptive prefix bloom filter for named data networking","volume":"18","author":"Quan","year":"2014","journal-title":"IEEE Communications Letters"},{"key":"10.7717\/peerj-cs.3551\/ref-56","doi-asserted-by":"publisher","first-page":"114319\u2013114337","DOI":"10.1109\/ACCESS.2024.3444903","article-title":"INF-NDN IoT: an intelligent naming and forwarding in name data networking for internet of things","volume":"12","author":"Raza","year":"2024","journal-title":"IEEE Access"},{"issue":"13","key":"10.7717\/peerj-cs.3551\/ref-57","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.3390\/s19132906","article-title":"NINQ: name-integrated query framework for named-data networking of things","volume":"19","author":"Rehman","year":"2019","journal-title":"Sensors"},{"issue":"9","key":"10.7717\/peerj-cs.3551\/ref-58","doi-asserted-by":"publisher","first-page":"7661","DOI":"10.1109\/JIOT.2020.3041096","article-title":"CCIC-WSN: an architecture for single-channel cluster-based information-centric wireless sensor networks","volume":"8","author":"Rehman","year":"2021","journal-title":"IEEE Internet of Things Journal"},{"key":"10.7717\/peerj-cs.3551\/ref-59","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.jnca.2016.09.007","article-title":"N-FIB: scalable, memory efficient name-based forwarding","volume":"76","author":"Saxena","year":"2016a","journal-title":"Journal of Network and Computer Applications"},{"key":"10.7717\/peerj-cs.3551\/ref-60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jnca.2015.12.009","article-title":"Radient: scalable, memory-efficient name lookup algorithm for named data networking","volume":"63","author":"Saxena","year":"2016b","journal-title":"Journal of Network and Computer Applications"},{"key":"10.7717\/peerj-cs.3551\/ref-61","doi-asserted-by":"crossref","DOI":"10.1109\/CSE-EUC-DCABES.2016.160","article-title":"Reliable memory efficient name forwarding in named data networking","author":"Saxena","year":"2016a"},{"key":"10.7717\/peerj-cs.3551\/ref-62","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cosrev.2016.01.001","article-title":"Named data networking: a survey","volume":"19","author":"Saxena","year":"2016b","journal-title":"Computer Science Review"},{"key":"10.7717\/peerj-cs.3551\/ref-63","doi-asserted-by":"publisher","first-page":"19958","DOI":"10.1109\/ACCESS.2022.3151864","article-title":"Hierarchical naming scheme in named data networking for internet of things: a review and future security challenges","volume":"10","author":"Shah","year":"2022","journal-title":"IEEE Access"},{"issue":"2","key":"10.7717\/peerj-cs.3551\/ref-64","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/17445760.2017.1363202","article-title":"Efficient name matching based on a fast two-dimensional filter in named data networking","volume":"34","author":"Shubbar","year":"2019a","journal-title":"International Journal of Parallel, Emergent and Distributed Systems"},{"issue":"4","key":"10.7717\/peerj-cs.3551\/ref-65","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1007\/s10922-019-09495-y","article-title":"A filter-based design of pending interest table in named data networking","volume":"27","author":"Shubbar","year":"2019b","journal-title":"Journal of Network and Systems Management"},{"key":"10.7717\/peerj-cs.3551\/ref-66","doi-asserted-by":"crossref","DOI":"10.1145\/2396556.2396575","article-title":"Toward fast NDN software forwarding lookup engine based on hash tables","author":"So","year":"2012"},{"key":"10.7717\/peerj-cs.3551\/ref-67","doi-asserted-by":"crossref","DOI":"10.1145\/2810156.2810166","article-title":"Scalable name-based packet forwarding","author":"Song","year":"2015"},{"key":"10.7717\/peerj-cs.3551\/ref-68","doi-asserted-by":"crossref","DOI":"10.1109\/WISA.2015.72","article-title":"Efficient name lookup scheme based on hash and character trie in named data networking","author":"Tan","year":"2015"},{"key":"10.7717\/peerj-cs.3551\/ref-69","article-title":"NetInf: network of the future","author":"Team","year":"2012"},{"key":"10.7717\/peerj-cs.3551\/ref-70","article-title":"Named data networking project team publications","author":"Team","year":"2019"},{"key":"10.7717\/peerj-cs.3551\/ref-71","doi-asserted-by":"crossref","DOI":"10.1109\/INFOCOM.2014.6848148","article-title":"Reducing forwarding state in content-centric networks with semi-stateless forwarding","author":"Tsilopoulos","year":"2014"},{"issue":"14","key":"10.7717\/peerj-cs.3551\/ref-72","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.3390\/s19143034","article-title":"Hierarchical name-based mechanism for push-data broadcast control in information-centric multihop wireless networks","volume":"19","author":"Ullah","year":"2019","journal-title":"Sensors"},{"key":"10.7717\/peerj-cs.3551\/ref-73","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOMW.2013.6970719","article-title":"On the design and implementation of a wire-speed pending interest table","author":"Varvello","year":"2013"},{"key":"10.7717\/peerj-cs.3551\/ref-74","doi-asserted-by":"crossref","DOI":"10.1109\/IWQoS.2014.6914320","article-title":"Fast name lookup for named data networking","author":"Wang","year":"2014"},{"issue":"16","key":"10.7717\/peerj-cs.3551\/ref-75","doi-asserted-by":"publisher","first-page":"3165","DOI":"10.1016\/j.comnet.2013.07.006","article-title":"GPU-accelerated name lookup with component encoding","volume":"57","author":"Wang","year":"2013a","journal-title":"Computer Networks"},{"key":"10.7717\/peerj-cs.3551\/ref-76","doi-asserted-by":"crossref","DOI":"10.1109\/ICDCS.2012.35","article-title":"Scalable name lookup in NDN using effective name component encoding","author":"Wang","year":"2012b"},{"key":"10.7717\/peerj-cs.3551\/ref-77","doi-asserted-by":"crossref","DOI":"10.1109\/GLOCOM.2011.6134161","article-title":"Parallel name lookup for named data networking","author":"Wang","year":"2011"},{"key":"10.7717\/peerj-cs.3551\/ref-78","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOM.2013.6566742","article-title":"NameFilter: achieving fast name lookup with low memory cost via applying two-stage bloom filters","author":"Wang","year":"2013b"},{"key":"10.7717\/peerj-cs.3551\/ref-79","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOMW.2012.6193515","article-title":"Data naming in vehicle-to-vehicle communications","author":"Wang","year":"2012a"},{"key":"10.7717\/peerj-cs.3551\/ref-80","article-title":"Wire speed name lookup: a GPU-based approach","author":"Wang","year":"2013c"},{"key":"10.7717\/peerj-cs.3551\/ref-81","article-title":"Efficient lookup schemes based on splitting name for NDN","author":"Wu","year":"2019"},{"key":"10.7717\/peerj-cs.3551\/ref-82","doi-asserted-by":"crossref","DOI":"10.1145\/3125719.3132104","article-title":"Local naming service for named data networking of things","author":"Yang","year":"2017"},{"issue":"12","key":"10.7717\/peerj-cs.3551\/ref-83","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/LCOMM.2018.2877318","article-title":"Local name translation for succinct communication towards named data networking of things","volume":"22","author":"Yang","year":"2018","journal-title":"IEEE Communications Letters"},{"issue":"5","key":"10.7717\/peerj-cs.3551\/ref-84","doi-asserted-by":"publisher","first-page":"e12884","DOI":"10.1002\/eng2.12884","article-title":"A review of SDN-enabled routing protocols for named data networking","volume":"6","author":"Yassine","year":"2024a","journal-title":"Engineering Reports"},{"issue":"1","key":"10.7717\/peerj-cs.3551\/ref-85","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1080\/1206212X.2023.2279811","article-title":"Routing approaches in named data networks: a survey and emerging research challenges","volume":"46","author":"Yassine","year":"2024b","journal-title":"International Journal of Computers and Applications"},{"key":"10.7717\/peerj-cs.3551\/ref-86","doi-asserted-by":"crossref","DOI":"10.1109\/ICCCN.2012.6289282","article-title":"DiPIT: a distributed bloom-filter based pit table for CCN nodes","author":"You","year":"2012"},{"key":"10.7717\/peerj-cs.3551\/ref-87","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.comcom.2016.06.004","article-title":"Hardware accelerator to speed up packet processing in NDN router","volume":"91\u201392","author":"Yu","year":"2016","journal-title":"Computer Communications"},{"key":"10.7717\/peerj-cs.3551\/ref-88","doi-asserted-by":"crossref","DOI":"10.1109\/INFOCOM.2014.6848146","article-title":"Scalable pending interest table design: from principles to practice","author":"Yuan","year":"2014"},{"key":"10.7717\/peerj-cs.3551\/ref-89","doi-asserted-by":"crossref","DOI":"10.1109\/ANCS.2015.7110125","article-title":"Reliably scalable name prefix lookup","author":"Yuan","year":"2015"},{"key":"10.7717\/peerj-cs.3551\/ref-90","doi-asserted-by":"crossref","DOI":"10.1109\/ANCS.2017.16","article-title":"Enhancing scalable name-based forwarding","author":"Yuan","year":"2017"},{"key":"10.7717\/peerj-cs.3551\/ref-91","doi-asserted-by":"crossref","DOI":"10.1109\/ICCCN.2012.6289305","article-title":"Scalable NDN forwarding: concepts, issues, and principles","author":"Yuan","year":"2012"},{"issue":"3","key":"10.7717\/peerj-cs.3551\/ref-92","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/2656877.2656887","article-title":"Named data networking","volume":"44","author":"Zhang","year":"2014","journal-title":"SIGCOMM Computer Communication Review"},{"key":"10.7717\/peerj-cs.3551\/ref-93","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1049\/cmu2.12621","article-title":"Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management","volume":"17","author":"Zhang","year":"2023","journal-title":"IET Communications"}],"container-title":["PeerJ Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/peerj.com\/articles\/cs-3551.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3551.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3551.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3551.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:13:26Z","timestamp":1770970406000},"score":1,"resource":{"primary":{"URL":"https:\/\/peerj.com\/articles\/cs-3551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,13]]},"references-count":93,"alternative-id":["10.7717\/peerj-cs.3551"],"URL":"https:\/\/doi.org\/10.7717\/peerj-cs.3551","archive":["CLOCKSS","LOCKSS","Portico"],"relation":{},"ISSN":["2376-5992"],"issn-type":[{"value":"2376-5992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,13]]},"article-number":"e3551"}}