Performance analysis of in-network caching for content-centric networking
Performance analysis of in-network caching for content-centric networking
复制标题
DOI：
10.1016/j.comnet.2012.11.026
复制
发表时间：
2013-09-09
影响因子：
5.6
通讯作者：
Yeom, Ikjun
中科院分区：
文献类型：
--
作者：
Kim, Yusung;Yeom, Ikjun
随着多媒体内容的爆炸式增长，重复下载流行内容会浪费互联网带宽。最近，已经提出了以内容为中心的网络（CCN），或所谓的以信息为中心的网络（ICN），以实现高效的内容交付。在本文中，我们研究了命名数据网络 (NDN) 的网络内缓存性能，这是一个很有前途的 CCN 提案。首先，我们检查 LRU（最近最少使用）的低效率，LRU 是 NDN 中的基本缓存替换策略。然后我们为两个网络内缓存策略制定最佳内容分配。一种是单路径缓存，它允许仅沿着请求者和内容源之间的路径从路由器提供请求。另一种是网络范围缓存，它允许从网络中保存所请求内容的任何路由器提供请求。对于这两种策略，我们使用混合整数程序通过考虑链接成本、缓存大小和内容流行度来优化内容分配模型。我们还考虑了链路容量和路由问题对最佳内容分配的影响。我们的评估和分析根据实际约束（例如链路成本、链路容量和缓存大小）提出了 NDN 网络内缓存的性能界限。 (C) 2013 Elsevier B.V. 保留所有权利。
With the explosion of multimedia content, Internet bandwidth is wasted by repeated downloads of popular content. Recently, Content-Centric Networking (CCN), or the so-called Information-Centric Networking (ICN), has been proposed for efficient content delivery. In this paper, we investigate the performance of in-network caching for Named Data Networking (NDN), which is a promising CCN proposal. First, we examine the inefficiency of LRU (Least Recently Used) which is a basic cache replacement policy in NDN. Then we formulate the optimal content assignment for two in-network caching policies. One is Single-Path Caching, which allows a request to be served from routers only along the path between a requester and a content source. The other is Network-Wide Caching, which enables a request to be served from any router holding the requested content in a network. For both policies, we use a Mixed Integer Program to optimize the content assignment models by considering the link cost, cache size, and content popularity. We also consider the impact of link capacity and routing issues on the optimal content assignment. Our evaluation and analysis present the performance bounds of in-network caching on NDN in terms of the practical constraints, such as the link cost, link capacity, and cache size. (C) 2013 Elsevier B.V. All rights reserved.