Workload-Aware Caching Policy for Information-Centric Networking

Qian HU
Muqing WU
Song GUO
Hailong HAN
Chaoyi ZHANG

IEICE TRANSACTIONS on Communications   Vol.E97-B    No.10    pp.2157-2166
Publication Date: 2014/10/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E97.B.2157
Type of Manuscript: PAPER
Category: Network
information-centric networking,  in-network caching,  cache replacement,  content popularity,  temporal locality,  

Full Text: PDF>>
Buy this Article

Information-centric networking (ICN) is a promising architecture and has attracted much attention in the area of future Internet architectures. As one of the key technologies in ICN, in-network caching can enhance content retrieval at a global scale without requiring any special infrastructure. In this paper, we propose a workload-aware caching policy, LRU-GT, which allows cache nodes to protect newly cached contents for a period of time (guard time) during which contents are protected from being replaced. LRU-GT can utilize the temporal locality and distinguish contents of different popularity, which are both the characteristics of the workload. Cache replacement is modeled as a semi-Markov process under the Independent Reference Model (IRM) assumption and a theoretical analysis proves that popular contents have longer sojourn time in the cache compared with unpopular ones in LRU-GT and the value of guard time can affect the cache hit ratio. We also propose a dynamic guard time adjustment algorithm to optimize the performance. Simulation results show that LRU-GT can reduce the average hops to get contents and improve cache hit ratio.