当前位置: X-MOL 学术Electronics › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An On-Path Caching Scheme Based on the Expected Number of Copies in Information-Centric Networks
Electronics ( IF 2.6 ) Pub Date : 2020-10-17 , DOI: 10.3390/electronics9101705
Yuanhang Li , Jinlin Wang , Rui Han

The Information-Centric Network (ICN) is one of the most influential future network architectures and in-network caching in ICN brings some helpful features, such as low latency and mobility support. How to allocate cache capacity and place content properly will greatly influence the performance of ICN. This paper focuses on the cache allocation problem and content placement problem under the given cache space budget. Firstly, a lightweight allocation method utilizing information of both topology and content popularity is proposed, to allocate cache space and get the expected number of copies of popular content. The expected number of copies represents the number of content copies placed in the topology. Then, an on-path caching scheme based on the expected number of copies is proposed to handle the content placement problem. In the cache allocation scenario, the lightweight allocation method performs better than other baseline methods. In the content placement scenario, Leave Copy Down (LCD) based on the expected number of copies performs the second-best and is very close to Optimal Content Placement (OCP).

中文翻译:

基于信息中心网络中预期副本数的路径上高速缓存方案

以信息为中心的网络(ICN)是未来最具影响力的网络体系结构之一,ICN中的网络内缓存带来了一些有用的功能,例如低延迟和移动性支持。如何正确分配缓存容量和正确放置内容将极大地影响ICN的性能。本文重点研究在给定的缓存空间预算下的缓存分配问题和内容放置问题。首先,提出了一种利用拓扑和内容流行度信息的轻量级分配方法,以分配缓存空间并获得预期的流行内容副本数。预期的副本数表示放置在拓扑中的内容副本的数量。然后,提出了一种基于预期份数的路径上缓存方案来处理内容放置问题。在缓存分配方案中,轻量级分配方法的性能优于其他基准方法。在内容放置方案中,基于预期的副本数保留向下复印(LCD)效果第二好,非常接近最佳内容放置(OCP)。
更新日期:2020-10-17
down
wechat
bug