Please use this identifier to cite or link to this item: https://hdl.handle.net/1822/79557

TitleNDN content store and caching policies: performance evaluation
Author(s)Silva, Elídio Tomás da
Macedo, Joaquim
Costa, António
KeywordsCaching replacement policies
Named data networking
Performance evaluation
Issue date4-Mar-2022
PublisherMultidisciplinary Digital Publishing Institute (MDPI)
JournalComputers
CitationSilva, E.T.d.; Macedo, J.M.H.d.; Costa, A.L.D. NDN Content Store and Caching Policies: Performance Evaluation. Computers 2022, 11, 37. https://doi.org/10.3390/computers11030037
Abstract(s)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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>α</mi><mo>=</mo><mn>1.1</mn></mrow></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>α</mi><mo>=</mo><mn>0.75</mn></mrow></semantics></math></inline-formula>). 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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>α</mi><mo>=</mo><mn>0.75</mn></mrow></semantics></math></inline-formula>, the CHR is significantly reduced, as expected.
TypeArticle
URIhttps://hdl.handle.net/1822/79557
DOI10.3390/computers11030037
ISSN2073-431X
e-ISSN2073-431X
Publisher versionhttps://www.mdpi.com/2073-431X/11/3/37
Peer-Reviewedyes
AccessOpen access
Appears in Collections:BUM - MDPI

Files in This Item:
File Description SizeFormat 
computers-11-00037.pdf950,44 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID