Cache-aware routing in Information-Centric Networks

Information-Centric Networking (ICN) has attracted the attention of the research community, which has argued that content, instead of end-points, must be at the center stage of attention. The research issues addressed by most of the proposed architectures are related to persistent/unique naming, efficient content distribution, in-network caching and security. Despite the emergence of ICN-oriented solutions, little attention has been given on designing efficient routing mechanisms suitable for ICNs since most of the approaches assume either traditional shortest path or inefficient flooding schemes. In this paper, we first describe how a resource management system can be deployed on two of the most fermentative ICN network architectures and we propose a cache-aware routing scheme that calculate the paths with the minimum transportation cost based on the information item demands and the caching capabilities of the network. We present a Dynamic Programming approach for calculating the paths and we validate the proposed approach through simulations.