A distributed in-network caching scheme for P2P-like content chunk delivery
A distributed in-network caching scheme for P2P-like content chunk delivery
复制标题
DOI：
10.1016/j.comnet.2015.08.035
复制
发表时间：
2015-11
期刊：
影响因子：
--
通讯作者：
Xu Zhang;Ning Wang;V. Vassilakis;M. Howarth
中科院分区：
文献类型：
--
作者：
Xu Zhang;Ning Wang;V. Vassilakis;M. Howarth
网内内容缓存最近出现在以信息为中心的网络（ICN）的上下文中，其允许在中间路由器侧缓存内容对象。在本文中，我们专门专注于网络缓存的对等（P2P）的内容对象，以提高服务和运营效率。我们提出了一个完全分布式的网络缓存协议的P2P类内容块，旨在减少基于P2P的内容流量负载，并实现改进的内容分发性能。为此，建议的整体决策逻辑考虑到上下文信息的底层网络和P2P的特点，如块的可用性，流行度和对等距离。此外，我们还分析了相邻的内容路由器之间的协调时，缓存决策，以避免重复的P2P块缓存附近的好处。一个分析建模框架的开发，以定量评估所提出的网络缓存方案的效率。并进行了大量的实验验证分析结果。
In-network content caching has recently emerged in the context of information-centric networking (ICN), which allows content objects to be cached at the intermediate router side. In this paper, we specifically focus on in-network caching of peer-to-peer (P2P)-like content objects for improving both service and operation efficiencies. We propose a fully distributed in-network caching protocol for P2P-like content chunks, aiming to reduce P2P based content traffic load and also to achieve improved content distribution performances. Toward this end, the proposed holistic decision-making logic takes into account context information of both the underlying network and the P2P characteristics, such as chunk availability, popularity and peer distances. In addition, we also analyse the benefit of coordination between neighbouring content routers when making caching decisions in order to avoid duplicated P2P chunk caching nearby. An analytical modelling framework is developed to quantitatively evaluate the efficiency of the proposed in-network caching scheme. Extensive experiments are also conducted to validate the analytical results.