NDN Content Store and Caching Policies: Performance Evaluation

Abstract

Among various factors contributing to performance of named data networking (NDN), the organization of caching is a key factor and has benefited from intense studies by the networking research community. The performed studies aimed at (1) finding the best strategy to adopt for content caching; (2) specifying the best location, and number of content stores (CS) in the network; and (3) defining the best cache replacement policy. Accessing and comparing the performance of the proposed solutions is as essential as the development of the proposals themselves. The present work aims at evaluating and comparing the behavior of four caching policies (i.e., random, least recently used (LRU), least frequently used (LFU), and first in first out (FIFO)) applied to NDN. Several network scenarios are used for simulation (2 topologies, varying the percentage of nodes of the content stores (5–100), 1 and 10 producers, 32 and 41 consumers). Five metrics are considered for the performance evaluation: cache hit ratio (CHR), network traffic, retrieval delay, interest re-transmissions, and the number of upstream hops. The content request follows the Zipf–Mandelbrot distribution (with skewness factor α=1.1 and α=0.75). LFU presents better performance in all considered metrics, except on the NDN testbed, with 41 consumers, 1 producer and a content request rate of 100 packets/s. For the level of content store from 50% to 100%, LRU presents a notably higher performance. Although the network behavior is similar for both skewness factors, when α=0.75, the CHR is significantly reduced, as expected.

QWLCPM: A Method for QoS-Aware Forwarding and Caching Using Simple Weighted Linear Combination and Proximity for Named Data Vehicular Sensor Network

“…When the cache reaches its capacity and a new item needs to be stored, the algorithm identifies the least frequently used item and replaces it with the new one. LFU assumes that items that have been accessed less frequently are less likely to be accessed again in the future [32]. For delay and hop count, QWLCPM was assessed based on the best route strategy of the basic NDN [33] (bNDN, i.e., the default forwarding strategy of the named data network); in particular, bNDN forwards an interest to the upstream with the lowest routing cost.…”

A survey of classification cache replacement techniques in the contentcentric networking domain

“…First in first out (FIFO) (Lee et al, 2013;Silva et al, 2022) For scenarios where low computational overhead is desirable Remove the content that has been stored the longest…”

“…ndnSIM Random replacement (RR) (Silva et al, 2022) To introduce unpredictability and simplicity Contents are randomly selected for eviction Simple and unbiased Most demanded content may be evicted earlier ndnSIM…”

“…Least frequently used (LFU) (Lee et al, 2013;Silva et al, 2022) To consider the context of content access over time.…”

“…Least recently used (LRU) (Lee et al, 2013;Silva et al, 2022) To improve cache performance by giving priority to the most recently accessed content Content that has been unused for a long is removed…”