首页> 外文会议>IEEE International Conference on Communications >C-LGV: A novel cooperative caching scheme for P2P caches
【24h】

C-LGV: A novel cooperative caching scheme for P2P caches

机译:C-LGV:一种用于P2P缓存的新颖协作缓存方案

获取原文

摘要

For an ISP (Internet Service Provider) which has deployed P2P caches in more than one AS (autonomous system), cooperative caching which makes their caches cooperate with each other can save more cost of carrying P2P traffic than independent caching for the ISP. However, existing cooperative caching schemes only use objects' popularity as the measurement to decide which objects should be cached, and cost on intra-ISP links that has great impact on the benefits of cooperative caching is not considered. In this paper, we propose a novel cooperative caching scheme named C-LGV (Cooperative, Lowest Global Value). C-LGV uses cost on intra-ISP links as well as objects' popularity to evaluate each object's global value (a new concept defined to estimate the benefits of caching or replacing an object), and objects with the lowest global values will be evicted when each local cache needs to replace its cached contents. Results of both synthetic and real traces driven simulations indicate that C-LGV can reduce the cost of carrying P2P traffic by at least 23% compared to existing cooperative caching schemes.
机译:对于在多个AS(自治系统)中部署了P2P缓存的ISP(Internet服务提供商)而言,使它们的缓存相互协作的协作缓存比为ISP进行独立缓存可以节省更多的承载P2P流量的成本。但是,现有的协作式缓存方案仅使用对象的流行程度作为确定应缓存哪些对象的度量,并且未考虑对协作式缓存的优势产生重大影响的ISP内链接的成本。在本文中,我们提出了一种新的协作缓存方案,称为C-LGV(协作,最低全局价值)。 C-LGV使用ISP内链接上的成本以及对象的受欢迎程度来评估每个对象的全局值(定义为估计缓存或替换对象的好处的新概念),并且具有最低全局值的对象将在以下情况下被驱逐每个本地缓存都需要替换其缓存的内容。综合和实际跟踪驱动的仿真结果均表明,与现有的协作缓存方案相比,C-LGV可以将承载P2P流量的成本降低至少23%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号