Modified-LRU Algorithm for Caching in Named Data Network on Mobile Network

Abstract

It is estimated that the annual internet network traffic will exceed the threshold of 3.3 zettabytes by 2021. However, internet architecture is currently inefficient to support the distribution of information-sharing content. Thus, a new internet architecture is designed, namely Named Data Network. Named Data Network (NDN) can store data that has been accessed by consumers in the content store so that when the data is requested by other consumers, it will be fast in distributing data. Nonetheless, it is not possible to store all the content in the content store. Optimization should be made, the existing optimization technique based on the replacement algorithm is Least Recent Used (LRU). However, LRU has a weakness, which only uses the latest reference time and cannot distinguish between frequent or rare objects that are being accessed. Previous research has been conducted on modified-LRU but only on fixed networks, while currently the majority of users use mobile networks, and the condition of mobile networks is very different from the condition of fixed networks. In this research, scenario 5 testing was carried out relating to packet ratio, delay, and packet drop on mobile networks. Modified-LRU show great improvement by the performance of the Hit ratio, 3.6% greater than the LRU, reducing delay by 19.67%, and packet drop by 94% better than LRU.