Modeling the Sojourn Time of Items for In-Networ Cache Based on LRU Policy  

作　　者：LIU Jiang WANG Guoqing HUANG Tao CHEN Jianya LIU Yunjie 

机构地区：[1]State Key Laboratory of Networking and Switching Technology. Beijing University of Posts and Telecommunications, Beijing 100876, China.

出　　处：《China Communications》2014年第10期88-95,共8页中国通信（英文版）

摘　　要：To reduce network redundancy,innetwork caching is considered in many future Internet architectures,such as Information Centric Networking.In in-network caching system,the item sojourn time of LRU(Least Recently Used) replacement policy is an important issue for two reasons:firstly,LRU is one of the most common used cache policy;secondly,item sojourn time is positively correlated to the hit probability,so this metric parameter could be useful to design the caching system.However,to the best of our knowledge,the sojourn time hasn't been studied theoretically so far.In this paper,we first model the LRU cache policy by Markov chain.Then an approximate closedform expression of the item expectation sojourn time is provided through the theory of stochastic service system,which is a function of the item request rates and cache size.Finally,extensive simulation results are illustrated to show that the expression is a good approximation of the item sojourn time.To reduce network redundancy, in- network caching is considered in many future Internet architectures, such as Information Centric Networking. In in-network caching system, the item sojourn time of LRU （Least Recently Used） replacement policy is an important issue for two reasons： firstly, LRU is one of the most common used cache policy; secondly, item sojourn time is positively correlated to the hit probability, so this metric parameter could be useful to design the caching system. However, to the best of our knowledge, the sojourn time hasn＇t been studied theoretically so far. In this paper, we first model the LRU cache policy by Markov chain. Then an approximate closed- form expression of the item expectation sojourn time is provided through the theory of stochastic service system, which is a function of the item request rates and cache size. Finally, extensive simulation results are illustrated to show that the expression is a good approximation of the item sojourn time.

关 键 词：sojourn time Markov chain LRU steady-state probability 

分 类 号：TP360.3[自动化与计算机技术—计算机系统结构] TN929.5[自动化与计算机技术—计算机科学与技术]