Due to a mismatch between downloading and caching content, the network may not gain significant benefit from the sophisticated in-network caching of information-centric networking (ICN) architectures by using a basic caching mechanism. This paper aims to seek an effective caching decision policy to improve the content dissemination in ICN. We propose PopCache-a caching decision policy with respect to the content popularity-that allows an individual ICN router to cache content more or less in accordance with the popularity characteristic of the content. We propose an analytical model to evaluate the performance of different caching decision policies in terms of the server-hit rate and expected round-trip time. The analysis confirmed by simulation results shows that PopCache yields the lowest expected round-trip time compared with three benchmark caching decision policies, i.e., the always, fixed probability and path-capacity-based probability, and PopCache provides the server-hit rate comparable to the lowest ones.

The Content-Centric Networking (CCN) architecture exploits a universal caching strategy whose inefficiency has been confirmed by research communities. Various caching schemes have been proposed to overcome some drawbacks of the universal caching strategy but they come with additional complexity and overheads. Besides those sophisticated caching schemes, there is a probabilistic caching scheme that is more efficient than the universal caching strategy and adds a modest complexity to a network. The probabilistic caching scheme was treated as a benchmark and the insights into its behavior have never been studied despite its promising performance and feasibility in practical use. In this paper we study the probabilistic caching scheme by means of computer simulation to explore the behavior of the probabilistic caching scheme when it works with various cache replacement policies. The simulation results show the different behavioral characteristics of the probabilistic caching scheme as a function of the cache replacement policy.

A typical Forwarding Information Based (FIB) construction in the Content Centric Networking (CCN) architecture relies on the name prefix dissemination following the shortest path manner. However, routing based on the shortest path may not fully exploit the benefits of forwarding and data planes of the CCN architecture since different content requester routers may use disjoint paths to forward their interest packets, even though these packets aim at the same content. To exploit this opportunity, we propose a cooperative routing protocol for CCN, which focuses on a FIB reconstruction based on the content retrieval statistics to improve the in-network caching utilization. A binary linear optimization problem is formulated for calculating the optimal path for the cooperative routing. The simulation results show an improvement in the server load and round-trip time provided by the cooperative routing scheme compared with that of the conventional shortest path routing scheme.

No abstract

No abstract

No abstract

This paper presents an optimal cooperative routing protocol (OCRP) for Content Centric Networking (CCN) aiming to improve the in-network cache utilization. The objective of OCRP is to selectively aggregate the multiple flows of interest messages onto the same path. This improves the cache utilization while mitigating the cache contention in the Content Store (CS) of CCN routers on the routing path. The optimal routing path is obtained by binary linear optimization under threes constraints: flow conservation constraint, cache contention mitigating constraint, and path length constraint. Our simulation results of OCRP show the reduction in the server load and round-trip hop distance in comparison to those of the shortest path routing and our previously proposed cooperative routing schemes.

No abstract