A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks
A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks
复制标题
DOI：
10.1109/access.2017.2669344
复制
发表时间：
2017-02
期刊：
影响因子：
3.9
通讯作者：
Muhammad Bilal;Shin-Gak Kang
中科院分区：
文献类型：
--
作者：
Muhammad Bilal;Shin-Gak Kang
为了科普互联网不断变化的需求，“网内缓存”作为一种应用解决方案已经提出了二十年。随着以信息为中心的网络（ICN）架构的出现，“网内缓存”成为网络级解决方案。国际竞争网络的一些独特特征，例如，快速变化的高速缓存状态、较高的请求到达率、较小的高速缓存大小和其它因素对内容驱逐策略提出了不同的要求。特别是，驱逐政策应该是快速和轻量级的。在本文中，我们提出了高速缓存复制和驱逐计划，有条件的离开科普无处不在（CLCE）和最近使用最少（LFRU），这是非常适合ICN类型的高速缓存网络（CN）。CLCE复制方案减少了内容的冗余缓存，从而提高了该高速缓存空间利用率。LFRU近似于最近最少使用的方案，并且实际上可用于快速变化的缓存网络，如ICN。
To cope with the ongoing changing demands of the internet, ‘in-network caching’ has been presented as an application solution for two decades. With the advent of information-centric network (ICN) architecture, ‘in-network caching’ becomes a network level solution. Some unique features of the ICNs, e.g., rapidly changing cache states, higher request arrival rates, smaller cache sizes, and other factors, impose diverse requirements on the content eviction policies. In particular, eviction policies should be fast and lightweight. In this paper, we propose cache replication and eviction schemes, conditional leave cope everywhere (CLCE) and least frequent recently used (LFRU), which are well suited for the ICN type of cache networks (CNs). The CLCE replication scheme reduces the redundant caching of contents; hence improves the cache space utilization. LFRU approximates the least frequently used scheme coupled with the least recently used scheme and is practically implementable for rapidly changing cache networks like ICNs.