Jointly Optimal Routing and Caching for Arbitrary Network Topologies

We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologies. Our algorithms reduce routing costs by several orders of magnitude compared to prior art, including algorithms optimizing caching under fixed routing.Comment: This is the extended version of the paper "Jointly Optimal Routing and Caching for Arbitrary Network Topologies", appearing in the 4th ACM Conference on Information-Centric Networking (ICN 2017), Berlin, Sep. 26-28, 201

Reversing The Meaning of Node Connectivity for Content Placement in Networks of Caches

It is a widely accepted heuristic in content caching to place the most popular content at the nodes that are the best connected. The other common heuristic is somewhat contradictory, as it places the most popular content at the edge, at the caching nodes nearest the users. We contend that neither policy is best suited for caching content in a network and propose a simple alternative that places the most popular content at the least connected node. Namely, we populate content first at the nodes that have the lowest graph centrality over the network topology. Here, we provide an analytical study of this policy over some simple topologies that are tractable, namely regular grids and trees. Our mathematical results demonstrate that placing popular content at the least connected nodes outperforms the aforementioned alternatives in typical conditions

Routing and Caching Strategy in Information-Centric Network (ICN)

The main usage of Internet today is content distribution and retrieval. In today’s Internet, connections and data exchanging can only happen between hosts, which is also called host centric end-to-end communication. As the network users and demand of contents grows quickly, current network paradigm is getting more and more complicated and can barely meet the needs in the future. Recently, the architecture of information/content centric networking (ICN) has been proposed and is expected to replace the current communication model. As an in-network caching system, the cache management scheme is a key factor of ICN. To improve the performance of this architecture, a lot of effort has been put by many researchers into this area. In this paper, a new strategy about content caching and routing is introduced. And the results of this new scheme show that this strategy leads to a good performance, i.e., the new scheme can reach less hops, when comparing with regular LRU cache strategy. And less hops means the requested object can be found in nearer routers, the network traffic, hence, is reduced