Original Research ARTICLE
A Composite Structure for Fast Name Prefix Lookup
- 1Peking University, China
Name-based forwarding plane is a critical but challenging component for Named Data Networking (NDN), where the hash table is an appealing candidate for data structure utilized in FIB on the benefit of its fast lookup speed. However, the hash table is flawed that it does not naturally support the longest-prefix-matching (LPM) algorithm for name-based forwarding. To support LPM in the hash table, besides the linear lookup, the random search (such as binary search) aims at increasing the lookup speed by reconstructing the FIB and optimizing the search path. We propose a composite data structure for random search based on the combination of hash table and trie; the latter is introduced preserve the logical associations among names, so as to recycle memory and prevent the so-called backtracking problem, thus enhancing the lookup efficiency. The experiment indicates the superiority of our scheme in lookup speed, the impact on memory consumption has also been evaluated.
Keywords: Named data networking (NDN), Hash table algorithm, Random search, Trie Based LPM, Data structural model
Received: 09 Feb 2019;
Accepted: 04 Jul 2019.
Edited by:Pere Barlet-Ros, Universitat Politecnica de Catalunya, Spain
Reviewed by:Giorgos Dimopoulos, Independent researcher, Spain
Yi Wang, Southern University of Science and Technology, China
Copyright: © 2019 Hu and Li. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
Mr. Jiawei Hu, Peking University, Beijing, China, firstname.lastname@example.org
Prof. Hui Li, Peking University, Beijing, China, email@example.com