# Data Structure and Management Protocol to Enhance Name Resolving in Named Data Networking
## 5 Conclusions and Future Work  
This paper proposes a two-element solution to enhance name resolution in NDN networks. The two elements in the proposed solution include (1) a data structure of the NDN mapping table and (2) a management protocol. The proposed data structure, called  
Figure 8: Use case scenario, (**a**) No PNPS, (**b**) No entry in mapping table, (**c**) Full solution for global NDN traffic.  
Encoded Component Hash Trie (ECHT), combines the trie data structure with a hashing mechanism to build the NDN mapping table, where each producer name is decomposed into components, and each component is encoded in NDN NameComponent TLV format. ECHT supports three operations: insertion, deletion, and lookup. The lookup operation in ECHT is based on a proposed searching mechanism called Best Component Match (BCM) as a replacement for the Longest Prefix Match (LPM) mechanism, which assists in avoiding a wrong reply due to an incorrect partial component matching. Moreover, the management protocol is proposed to automatically populate, update, and modify the entries of the mapping table (producer name, delivery location) via four messages (add, remove, get, getbm). The proposed scheme performance was tested and evaluated against two other tries: component and character tries. The results show that the operations' speed was enhanced and was much faster than other tries, e.g., lookup and insertion operations are around 65 and 37 times faster, respectively, when the ECHT data structure is used in comparison with normal text-based component trie. This is because ECHT does not require decoding/encoding NDN names while parsing received NDN Interests or creating NDN Data replies.  
For future work, we aim to develop an authentication framework that can be used by an NDN producer who wants to modify (add or remove) an entry in the mapping table. Accordingly, the origin, authenticity, and integrity of the content producer are verified.  
For the convenience of the reader, the abbreviations used in this paper are listed in Table 5.  
**Author Contributions:** Conceptualization, M.A. ([PERSON]), D.A.-A., M.A. ([PERSON]) and F.K.; methodology, M.A. ([PERSON]); validation, M.A. ([PERSON]); formal analysis, M.A. ([PERSON]); investigation M.A. ([PERSON]); resources, M.A. ([PERSON]); data curation, M.A. ([PERSON]); writing--original draft preparation, M.A. ([PERSON]); writing--review and editing, M.A. ([PERSON]), D.A.-A., M.A. ([PERSON]) and F.K.; visualization, M.A. ([PERSON]); project administration, M.A. ([PERSON]) and D.A.-A., funding acquisition, M.A. ([PERSON]). All authors have read and agreed to the published version of the manuscript.  
**Funding:** This research received no external funding.  
**Data Availability Statement:** The data presented in this study are available in this article.  
\begin{table}
\begin{tabular}{c c} \hline \hline
**Abbreviation** & **Description** \\ \hline BMC & Best Component Match \\ \hline DNS & Domain Name System \\ \hline ECHT & Encoded Component Hash Trie \\ \hline FIB & Forwarding Information Base \\ \hline IDR & Inter-Domain Routing \\ \hline LPM & Longest Prefix Match \\ \hline N-BGP & Named Data Border Gateway Protocol \\ \hline NDN & Named Data Networking \\ \hline PNP & Peer Name Provider \\ \hline PNPC & Peer Name Provider Client \\ \hline PNPP & Peer Name Provider Protocol \\ \hline PNPS & Peer Name Provider Server \\ \hline TLV & Type-Length-Value \\ \hline \hline \end{tabular}
\end{table}
Table 5: Abbreviations in alphabetical order.  
**Acknowledgments:** The authors would like to thank Sultan Qaboos University for financially supporting this research and publication.  
**Conflicts of Interest:** The authors declare that they have no competing interests.