首页> 外文会议>Annual IEEE International Conference on Computer Communications >An O(1)-Competitive Online Caching Algorithm for Content Centric Networking
【24h】

An O(1)-Competitive Online Caching Algorithm for Content Centric Networking

机译:一个O(1) - 以中心为中心网络的竞争性在线缓存算法

获取原文

摘要

Since the emergence of Content Centric Networking (CCN) as a new paradigm for content delivery in the Internet, copious of research targeted the evaluation or the enhancement of CCN caching schemes. Motivated by providing the Internet Service Providers with incentives to perform caching, the increasing deployment of in-network cloudlets, and the low cost of storage devices, we study caching in CCN from an economical point of view, where the content providers pay the Internet Service Providers in exchange for caching their content items. We propose an online caching algorithm for CCN that does not require the exact knowledge of content items' popularities to minimize the total cost paid by the content providers. The total cost here is the sum of the caching costs and the retrieval costs. Our analysis shows that the proposed algorithm achieves an O(1) competitive ratio when compared to the optimal offline caching scheme that possesses the exact knowledge of content items' popularities. We also show through simulations that the proposed algorithm can cut the cost incurred by widely used caching schemes such as Leave Copy Down (LCD) and Leave Copy Everywhere (LCE) by up to 65%.
机译:由于内容中心网络(CCN)的出现作为互联网内容交付的新范式,因此大量的研究旨在评估或增强CCN缓存方案。通过提供互联网服务提供商提供了激励执行缓存的启发,在网络cloudlets的增加部署和存储设备的成本低,我们在CCN从来看,经济的地步内容提供商支付的互联网服务研究缓存提供者以换取缓存其内容项。我们提出了一个用于CCN的在线缓存算法,该算法不需要内容项的普及精确知识,以最大限度地降低内容提供商支付的总成本。这里的总成本是缓存成本和检索成本的总和。我们的分析表明,与拥有内容物品普及的确切知识的最佳离线缓存方案相比,所提出的算法达到O(1)竞争比率。我们还通过模拟显示所提出的算法可以通过广泛使用的缓存方案来降低诸如留下副本(LCD)的诸如休假计划的成本,并将其它地(LCE)留下高达65%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号