Pseudo-LRU Replacement Policy in Named Data Networking Using Fat Tree DataCenter Network Architecture

Named Data Networking (NDN) is a new content centric architecture for the future Internet aiming to improve communication performance compared to coventional IP. One of the building bricks of NDN is data caching. Various caching strategies were proposed in the literature in order to improve NDN performance. But, it is still unclear which strategy performs better than the others in terms of efficient communication and energy consumption using DataCenter Networking (DCN) architectures.In this paper, we propose to evaluate a new cache replacement scheme based on Pseudo-LRU algorithm. We combine it with NDN inside a Fat Tree based DCN architecture. For that aim, we extended the ndnSIM module developped under NS-3 and ran simulations to evaluate the performance of our proposition. We also combined it with ProbCache placement scheme and compared it to conventional LRU scheme. We used evaluation metrics such as packet delay, hop count, cache hit rate and consumed energy. Simulation results show that our proposed Pseudo-LRU policy based outperforms LRU by reducing packet delay, hop count, consumed energy and increasing cache hit rate indepedently from cache size.