Cache-Filter: A Cache Permission Policy for Information-Centric Networking
Cache-Filter: A Cache Permission Policy for Information-Centric Networking
复制标题
缓存过滤器：以信息为中心的网络的缓存权限策略
DOI：
10.3837/tiis.2015.12.010
复制
发表时间：
2015-12
影响因子：
1.5
通讯作者：
张宏科
中科院分区：
文献类型：
--
作者：
冯博昊;周华春;张明川;张宏科
以信息为中心的网络（ICN）最近引起了极大的关注。它将内容与位置解耦，并引入网络缓存，使内容可以缓存在网络中的任何位置。这种设计的好处是显而易见的，然而，许多挑战仍然需要解决。其中，本地缓存策略被广泛讨论，它可以进一步分为两个部分，即该高速缓存权限策略和该高速缓存替换策略。前者用于决定是否应该缓存传入的内容，而后者用于在需要时驱逐缓存的内容。互联网是一个面向用户的网络，流行的内容总是比不流行的内容有更多的需求。将这种流行内容缓存在更靠近用户位置的位置可以提高网络性能，因此，需要本地缓存策略来识别流行内容。然而，考虑到ICN路由器的线速度要求，其复杂度大于O（1）的本地缓存策略不能被应用。在替换策略方面，最近最少使用（LRU）被选为ICN的默认替换策略，因为它的复杂度低，但它对流行内容的识别能力较差。因此，流行内容的识别应该由该高速缓存权限策略来完成。本文提出了一种复杂度为O（1）的缓存权限策略Cache-Filter，旨在将流行内容存储在离用户更近的地方。Cache-Filter算法充分考虑了内容的流行度，通过路径上节点的协作来实现。大量的模拟进行评估缓存过滤器的性能。还实现了左下复制（LCD）、左下移动复制（MCD）、Betw、ProbCache、ProbCache+、Prob（p）和带有二级列表的概率缓存（PCSL）以进行比较。结果表明，缓存过滤器性能良好。例如，在访问内容的距离方面，与命名数据网络（NDN）使用的Leave Copy Everywhere（LCE）作为权限策略相比，Cache-Filter节省了超过17%的跳数。
Information Centric Networking (ICN) has recently attracted great attention. It names the content decoupling from the location and introduces network caching, making the content to be cached anywhere within the network. The benefits of such design are obvious, however, many challenges still need to be solved. Among them, the local caching policy is widely discussed and it can be further divided into two parts, namely the cache permission policy and the cache replacement policy. The former is used to decide whether an incoming content should be cached while the latter is used to evict a cached content if required. The Internet is a user-oriented network and popular contents always have much more requests than unpopular ones. Caching such popular contents closer to the user’s location can improve the network performance, and consequently, the local caching policy is required to identify popular contents. However, considering the line speed requirement of ICN routers, the local caching policy whose complexity is larger than O(1) cannot be applied. In terms of the replacement policy, Least Recently Used (LRU) is selected as the default one for ICN because of its low complexity, although its ability to identify the popular content is poor. Hence, the identification of popular contents should be completed by the cache permission policy. In this paper, a cache permission policy called Cache-Filter, whose complexity is O(1), is proposed, aiming to store popular contents closer to users. Cache-Filter takes the content popularity into account and achieves the goal through the collaboration of on-path nodes. Extensive simulations are conducted to evaluate the performance of Cache-Filter. Leave Copy Down (LCD), Move Copy Down (MCD), Betw, ProbCache, ProbCache+, Prob(p) and Probabilistic Caching with Secondary List (PCSL) are also implemented for comparison. The results show that Cache-Filter performs well. For example, in terms of the distance to access to contents, compared with Leave Copy Everywhere (LCE) used by Named Data Networking (NDN) as the permission policy, Cache-Filter saves over 17% number of hops.
登录
查看更多内容
可扩展且安全的以信息为中心的网络
影响因子：
1.6
作者：
Hua-Pei Chiang;Yong-Jin Park;Xiaodong Lee;Yueh-Min Huang
通讯作者：
Yueh-Min Huang
DOI：
--
发表时间：
2011-06
期刊：
2011 Future Network & Mobile Summit
影响因子：
--
作者：
Gerardo García-de-Blas;A. Beben;Francisco Javier Ramón-Salguero;Adrian Maeso;I. Psaras;G. Pavlou;
通讯作者：
Gerardo García-de-Blas;A. Beben;Francisco Javier Ramón-Salguero;Adrian Maeso;I. Psaras;G. Pavlou;
DOI：
10.1145/954339.954341
发表时间：
2003-12
期刊：
ACM Comput. Surv.
影响因子：
--
作者：
Stefan Podlipnig;L. Böszörményi
通讯作者：
Stefan Podlipnig;L. Böszörményi
DOI：
10.1016/j.jnca.2013.03.002
发表时间：
2014
期刊：
J. Netw. Comput. Appl.
影响因子：
--
作者：
Yuemei Xu;Yang Li;Tao Lin;Zihou Wang;Wenjia Niu;Hui Tang;S. Ci
通讯作者：
Yuemei Xu;Yang Li;Tao Lin;Zihou Wang;Wenjia Niu;Hui Tang;S. Ci
DOI：
10.1145/1282380.1282402
发表时间：
2007-10
期刊：
--
影响因子：
--
作者：
T. Koponen;M. Chawla;Byung-Gon Chun;A. Ermolinskiy;Kye Hyun Kim;S. Shenker;I. Stoica
通讯作者：
T. Koponen;M. Chawla;Byung-Gon Chun;A. Ermolinskiy;Kye Hyun Kim;S. Shenker;I. Stoica