Performance Analysis of Cache Replacement Algorithm using Virtual Named Data Network Nodes

Leanna Vidya Yovita (School of Electrical Engineering, Telkom University)
Tody Ariefianto Wibowo (School of Electrical Engineering, Telkom University)
Ade Aditya Ramadha (School of Electrical Engineering, Telkom University)
Gregorius Pradana Satriawan (School of Electrical Engineering, Telkom University)
Sevierda Raniprima (School of Electrical Engineering, Telkom University)

JOIN (Jurnal Online Informatika)
Vol 7 No 2 (2022)

As a future internet candidate, named Data Network (NDN) provides more efficient communication than TCP/IP network. Unlike TCP/IP, consumer requests in NDN are sent based on content, not the address. The previous study evaluated the NDN performance using a simulator. In this research, we modeled the system using virtual NDN nodes, making the model more relevant to the real NDN. As an essential component in every NDN router, the content store (CS) has a function to keep the data. We use First In First Out (FIFO) and Least Recetly Used (LRU) in our nodes as cache replacement algorithms. The in-depth exploration is done using various scenarios. The result shows that the cache hit ratio (CHR) increases if the size of the CS, the number of interests, and the number of consumers increases. CHR decreases as the number of producers and the number of prefixes increase. As CHR increases, round trip time (RTT) decreases. LRU provides better performance for all cases: higher CHR of 5-15% and lower RTT of 1-10% than FIFO.