Abstract

Information centric networking (ICN) shifts the focus of existing internet architecture from host-oriented to content-oriented model by enabling in-network caching and content-based forwarding. These ICN features help to increase network performance by decreasing content discovery delay, content server load, and network congestion. To route a content interest inside network such that content can be fetched with minimal time is a challenging task in ICN. The performance of the ICN routing protocol can be significantly improved if the decisions related to content chunk placement and request forwarding are taken in a cooperative fashion. This paper describes a novel strategy for co-operative caching joint request forwarding in ICN, focusing on decreasing content retrieval latency. To do so, the caching strategy leverages the concept of connected dominating set (CDS) for creating a virtual backbone network to eliminate caching redundancy and reduce content discovery delay. It considers content chunk placement and request forwarding tasks as strongly co-related procedures. It exploits the caching information so that the request is forwarded to a content router (CR) with the maximum likelihood of carrying needed data using the betweenness centrality (BC) of CR. The proposed approach also uses the Markov chain-based model to estimate CS hit likelihood and use it as decisional parameter while forwarding the interest packet. This mechanism helps to fetch the content within the shortest possible time duration. The CCJRF-ICN adopts the Dijkstra's shortest path routing and works in collaboration with the CDS-driven caching joint forwarding mechanism. The simulation study of CCJRF-ICN is done inside ns-3 based ndnSIM-2.0 simulator with performance measures like content store (CS) hit ratio, content discovery delay, mean hop distance, network load, and network overhead. The simulation outcomes demonstrate that CCJRF-ICN outperforms the state-of-the-art strategies for realistic topologies (GEANT, US-26, Euro-28) and shows improvement up to 5-35% against stated performance measures.

Highlights

  • The communication technology domain has noticed a significant change in the last couple of decades due to an exponential increase in data

  • The protocol runs on top of Dijkstra's shortest path routing algorithm

  • It utilizes the connected dominating set (CDS) concept to introduce hub routers to reduce caching redundancy and increase the likelihood of content store (CS) hit for the requested content

Read more

Summary

Introduction

The communication technology domain has noticed a significant change in the last couple of decades due to an exponential increase in data. Future network technologies will be demanding in the context of throughput and access latency [1]. The ICN paradigm is introduced to address such needs of future internet users. The ICN enables content caching at interior nodes in a network to minimize data retrieval latency and network congestion. It provides unique naming to content chunks, and an enduser can request desired content through its identifier [2]. The request can be satisfied by any node/content router (CR) that has cached desired content without depending only on the content provider. The primary challenges in ICN are to provide efficient caching and routing strategies that improve content discovery latency by maximizing throughput [3]. The research work discussed in this paper adopts the named data network (NDN, 2014) architecture [4] of ICN

Objectives
Methods
Findings
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.