CRRP: Cost-Based Replacement with Random Placement for En-Route Caching

Sen WANG  Jun BI  Jianping WU  

IEICE TRANSACTIONS on Information and Systems   Vol.E97-D   No.7   pp.1914-1917
Publication Date: 2014/07/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E97.D.1914
Type of Manuscript: LETTER
Category: Information Network
Web caching,  en-route caching,  cache policy,  

Full Text: PDF(368.4KB)>>
Buy this Article

Caching is considered widely as an efficient way to reduce access latency and network bandwidth consumption. En-route caching, where caches are associated with routing nodes in the network, is proposed in the context of Web cache to exploit fully the potential of caching. To make sensible replacement and placement decision for en-route caching, traditional caching schemes either engage computation-intensive algorithm like dynamic programming or suffer from inferior performance in terms of average access latency. In this article, we propose a new caching scheme with cost-based replacement and random placement, which is named CRRP. The cost-based replacement of CRRP introduces probing request to timely perceive cost change and the random placement is independent of current caching state, of O(1) computational complexity of placement decision. Through extensive simulations, we show that CRRP outperforms a wide range of caching schemes and is very close to the traditional dynamic-programming-based algorithm, in terms of average access delay.