Performance evaluation of caching policies in NDN - an ICN architecture

Shailendra, Samar; Sengottuvelan, Senthilmurugan; Rath, Hemant Kumar; Panigrahi, B. K.; Simha, Anantha

doi:10.1109/tencon.2016.7848182

Cited by 33 publications

(17 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The parameters used in the simulations are listed in Table IV. These parameters were selected based on the previous studies [18] [20] [25] [26]. In total, ten experiments were performed, and a 95% confidence interval was calculated.…”

Section: Simulation Resultsmentioning

confidence: 99%

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Silva

Araujo²,

Linder³

et al. 2019

JCIS

View full text Add to dashboard Cite

An essential aspect of the network paradigm called Named Data Networking (NDN) is that all nodes in the network have the ability to cache contents natively. The focus of this work relies on efficiently choosing which content should be removed from a full cache to allow storing another one. We propose a new caching replacement algorithm for NDN networks called Name Popularity Algorithm (NPA). The proposed algorithm adopts an extra table that takes into account a long time history for the popularity of contents. Thus, when a data content is removed from the cache, its popularity is not reset, improving the cache usage of the network routers. The performance of NPA is compared to well-known strategies in the literature through NS-3/ndnSIM simulations. The results indicate that the proposed algorithm overcomes others with lower end-to-end delay, higher cache hit ratio and smaller hop count. Besides, our code is available as open source to be accessible for other researchers and to allow reproduction of the results.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Silva

Araujo²,

Linder³

et al. 2019

JCIS

View full text Add to dashboard Cite

show abstract

“…This can increase the sharing probability, save more bandwidth, and reduce content retrieval time [65]. However, it is worth mentioning that efficient and reliable content replacement policy is essential for harnessing the full potential of CS in NDN [66]- [68].…”

Section: A System Architecture Of Ndnmentioning

confidence: 99%

Named Data Networking in Vehicular Ad Hoc Networks: State-of-the-Art and Challenges

Khelifi

Luo

Nour

et al. 2020

IEEE Commun. Surv. Tutorials

254

121

View full text Add to dashboard Cite

Information-Centric Networking (ICN) has been proposed as one of the future Internet architectures. It is poised to address the challenges faced by today's Internet that include, but not limited to, scalability, addressing, security, and privacy. Furthermore, it also aims at meeting the requirements for new emerging Internet applications. To realize ICN, Named Data Networking (NDN) is one of the recent implementations of ICN that provides a suitable communication approach due to its clean slate design and simple communication model. There are a plethora of applications realized through ICN in different domains where data is the focal point of communication. One such domain is Intelligent Transportation System (ITS) realized through Vehicular Ad hoc NETwork (VANET) where vehicles exchange information and content with each other and with the infrastructure. To date, excellent research results have been yielded in the VANET domain aiming at safe, reliable, and infotainment-rich driving experience. However, due to the dynamic topologies, host-centric model, and ephemeral nature of vehicular communication, various challenges are faced by VANET that hinder the realization of successful vehicular networks and adversely affect the data dissemination, content delivery, and user experiences. To fill these gaps, NDN has been extensively used as underlying communication paradigm for VANET. Inspired by the extensive research results in NDN-based VANET, in this paper, we provide a detailed and systematic review of NDN-driven VANET. More precisely, we investigate the role of NDN in VANET and discuss the feasibility of NDN architecture in VANET environment. Subsequently, we cover in detail, NDN-based naming, routing and forwarding, caching, mobility, and security mechanism for VANET. Furthermore, we discuss the existing standards, solutions, and simulation tools used in NDN-based VANET. Finally, we also identify open challenges and issues faced by NDN-driven VANET and highlight future research directions that should be addressed by the research community.

show abstract

“…In [50,51], a caching replacement policy dubbed universal caching (UC) was proposed. The proposal was evaluated and compared to FIFO and LRU.…”

Section: Related Workmentioning

confidence: 99%

NDN Content Store and Caching Policies: Performance Evaluation

2022

View full text Add to dashboard Cite

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.

show abstract

Performance evaluation of caching policies in NDN - an ICN architecture

Cited by 33 publications

References 20 publications

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Named Data Networking in Vehicular Ad Hoc Networks: State-of-the-Art and Challenges

NDN Content Store and Caching Policies: Performance Evaluation

Contact Info

Product

Resources

About