A novel cooperative caching algorithm for massive

Authors: Yan Zhang Xu Zhou Yinlong Liu Bo Wang Song Ci

Publish Date: 2013/05/10

Volume: 6, Issue: 4, Pages: 425-433

PDF Link

Abstract

For an ISP Internet Service Provider that has deployed P2P caches in more than one ASs autonomous systems cooperative caching which makes their caches cooperate with each other can save more cost of carrying P2P traffic than independent caching However existing cooperative caching algorithms only use objects’ popularity as the measurement to decide which objects should be cached and cost on intraISP links that has great impact on the benefits of cooperative caching is not considered In this paper we first model the cooperative caching problem as a NPComplete problem which is based on our analysis about the cost of serving requests with consideration of both the objects’ popularity and the cost on intraISP links Then we propose a novel cooperative caching algorithm named cLGV Cooperative Lowest Global Value The cLGV algorithm uses a new concept global value to estimate the benefits of caching or replacing an object in the cooperative caching system and the global value of each object is evaluated according to not only objects’ popularity in each AS but also cost on intraISP links among ASs Results of both synthetic and real traces driven simulations indicate that our cLGV algorithm can save the cost of carrying P2P traffic at least 23  higher than that of existing cooperative caching algorithmsThis work is supported in part by National Science and Technology Major Projects of the Ministry of Industry and Information Technology of China Grant No 2010ZX03004001 and 2011ZX0300500402 and National Science Foundation of China Grant No 61102076 We are also grateful to Multiprobe team for making the DBD2 data set for simulation purposes

Keywords: