# Data Structure and Management Protocol to Enhance Name Resolving in Named Data Networking
###### Abstract  
Named Data Networking (NDN) is a future Internet architecture that requires an Inter-Domain Routing (IDR) to route its traffic globally. Address resolution is a vital component of any IDR system that relies on a Domain Name System (DNS) resolver to translate domain names into their IP addresses in TCP/IP networks. This paper presents a novel two-element solution to enhance name-to-delivery location resolution in NDN networks, consisting of (1) a mapping table data structure and a searching mechanism and (2) a management protocol to automatically populate and modify the mapping table. The proposed solution is implemented and tested on the Peer Name Provider Server (PNPS) mapping table, and its performance is compared with two other algorithms: component and character tries. The findings show a notable enhancement in the operational speed of the mapping table when utilizing the proposed data structure. For instance, the insertion process is 37 times faster compared to previous algorithms.  
Named Data Networking; Named Data Border Gateway Protocol; Peer Name Provider Server; component trie; NameComponent; hashing; Longest Prefix Match; Type-Length-Value +
Footnote †: journal: _Future Internet_  
scheme in [3] has some shortcomings: (1) The scheme data structure was not taken into consideration. However, the mapping table data structure must be optimized to speed up the operations that occur on it such as searching, adding, and removing, and (2) the way of filling, populating, and operating the mapping table was out of scope, which must be automated to increase the simplicity and decrease the human mistakes when modifications occur to the mapping table entries.  
In this paper, we propose a two-element solution that is suitable for any two-column mapping and resolving tables in NDN networks to populate and keep the global database of producers' names and their delivery locations up to date rapidly and automatically.  
The two elements in the proposed solution are (1) a mapping table data structure that combines the trie data structure and hashing mechanism to build the PNP mapping table where the name is split into components, and each component is encoded, hereafter referred to as Encoded Component Hash Trie (ECHT), and (2) a PNP protocol that manipulates the pairs of producer and delivery locations in the mapping table via four messages (add, remove, get, and getbcm). This aims to automate population and operations within the mapping table, enhancing efficiency by simplifying processes and reducing human errors during modifications to mapping table entries.  
Moreover, we propose a new search mechanism that is based on the Best Component Match (BCM) instead of using the Longest Prefix Match (LPM) mechanism. Utilizing BCM as a lookup mechanism ensures accuracy by components-based matching and helps avoid incorrect replies due to partial component matching errors. Additionally, employing BCM enables faster iteration over components compared to iterating over individual characters, enhancing the efficiency of the operations. Finally, the test results show that the lookup process is 98.47% faster when ECHT is used in comparison with normal string component trie. Accordingly, the topological-locator resolution shortcoming, mentioned in [4], is overcome with an optimal solution.  
The remainder of this paper is structured as follows: Section 2 provides a review of related works. Section 3 includes the proposed data structure and search mechanism and then presents our proposed PNP protocol. Section 4 describes the lab setup and presents the performance evaluation of the proposed mechanism and a use case scenario. Section 5 includes the conclusion and future work.