An Efficient Content Retrieval and Content Placement Approach for Named Data Networks

Named Data Network (NDN) is the future-generation Internet architecture proposed to address the issues in the current Internet architecture (TCP/IP) such as high content access latency, single point of failure, etc. NDN supports in-network caching that significantly enhances the network performance and facilitates scalable content distribution. However, the state-of-the-art in-network caching approaches suffer from drawbacks such as high lookup repetition overhead, poor cache utilization, and high content redundancy. To overcome these issues, in this paper, we propose a new content retrieval and content placement approach for NDN. The proposed approach reduces the lookup repetition overhead by minimizing the number of router consultations required for content retrieval. Moreover, the proposed approach improves cache utilization and reduces content redundancy by optimally placing the content on the most suitable router. The experimental results show that this approach improves the overall performance of the NDN architecture in terms of both content access latency and Cache Hit Ratio (CHR). We also compare the performance of the proposed approach with state-of-the-art approaches in a real-world topology and show that it outperforms the previously known approaches.