A Popularity-Based Cache Consistency Mechanism for Information-Centric Networking

Abstract

Information-Centric Networking (ICN) has emerged as a promising way for the efficient content delivery over the Internet, and it can be seen as a super large-scale caching distributed system. However, as one of the most important problems, the cache consistency issue, which refers to whether cached contents in routers are outdated, is still not investigated thoroughly in ICN. Thus, in this paper, we propose a cost-effective Popularity-based Cache Consistency (PCC) mechanism to guarantee the freshness of cached contents in ICN routers. PCC is able to balance the trade between the consistency strength and related costs since it only maintains the strong consistency for popular contents while the weak for unpopular ones. Besides, we improve another two cache consistency mechanisms used in the web caching, namely Polling-Every-Time (PET) and Time-To-Live (TTL), to be suitable for ICN, and use them as the benchmarks for comparisons with PCC. To evaluate their performance, we firstly analyse the costs of these mechanisms including the user latency in terms of hop counts and corresponding signaling overheads, and then conduct extensive simulations using a real topology. The simulation results show the high efficiency of PCC compared with the improved PET and TTL.