Organizing Named Data Objects in Distributed Name Resolution System for Information-Centric Networks

Abstract

The Information-centric Networks (ICN), an important research direction of the future Internet architecture, has gained lot of attention from the research community. The aim is to improve the current Internet with a new architecture where the design is completely based on information instead of the host. The information is named and is called as Named Data Object (NDO), utilized for data registration and name resolution, and the system that translates the object identifiers to network address is known as Name Resolution System (NRS). The random NRS distribution and network segregation are important and challenging issues in increasing NDO registration and storage. It is challenging for a single NRS to handle more than 1015 expected NDO’s with low latency and good throughput, along with the issues interest flooding and interest congestion. To overcome these problems NRS is distributed based on the location of routers. The mechanism is called Distributed Name Resolution Mechanism (DNRM). The NDO storage needs to be organized to increase the scalability of NRS. Distributed hash table and Bloom Filter have their own problems such as high latency in individual element searching and member deletion respectively. To overcome the above-mentioned issues the Balance Binary Tree (BBT) data structure is introduced to manage large NDO storage. The implementation results reduce the end-to-end delay by increasing network throughput. The contribution of this study is significant in promoting the use of NRS in ICN for handling the heterogeneity of the future Internet.