A Practical Study on Distributed Resolution Service for ICN

Despite the rapid progress of Information-Centric Network (ICN) research in the last few years, its key component route-by-name faces feasibility and efficiency challenges since we have to deal with a large number of information objects. In this article, we take a practical approach to the challenge of feasible and efficient name resolution service. Because of the similarity between the naming scheme in ICN and URI, we evaluate the time and space complexity of a typical data structure for lookup of ICN names using URIs collected from the traffic trace of a campus backbone. We propose a simple and empirical Distributed Resolution Service (DRS) scheme according to the time and space complexity model. The proposed scheme can handle at least 1012 name entries using about 3, 300 nodes with commodity hardware. Finally, we optimize the proposed distributed resolution service scheme with regard to network performance.