Performance evaluation of progressive caching policy on NDN

Abstract

Named Data Networking (NDN) is a promising solution to the explosion of multimedia traffic on the Internet. NDN shifts the paradigm of host-centric approach to name-based approach, allowing the retrieval of contents solely by their name. To support this, NDN has caching as one of its main feature. Seen as a critical aspect to maximize its potential, caching in NDN has invited a lot of researches related to it. Progressive Caching Policy (PCP) is one of caching policy that is proposed specifically for NDN. Its low complexity makes it one of potential caching policies that can cope with the scalability of the Internet. However, the performance of PCP itself still has not been evaluated thoroughly. PCP also has undefined variables, making the performance evaluation by comparing with other caching strategies hard. In this paper, we propose a modification to the algorithm of PCP to make the performance comparison fair. We then evaluate the performance of modified PCP with other caching strategies. We show that our proposed modification of PCP outperforms other caching strategies on most scenarios, especially on the scenarios that increase interest aggregation, such as cache size expansion, λ value increase, or α value decrease. On the k-ary tree topology, hit rate gain is also increasing as the number of arity and depth grows. But, compared to Leave Copy Down (LCD), the cache hit rate increase are fairly small and not significant enough, which is at most by 1.34% on the scenario with 5 arity.