CAKA: a novel cache‐aware K‐anycast routing scheme for publish/subscribe‐based information‐centric network
CAKA: a novel cache‐aware K‐anycast routing scheme for publish/subscribe‐based information‐centric network
复制标题
DOI：
10.1002/dac.2976
复制
发表时间：
2015-11
影响因子：
2.1
通讯作者：
Jing Ren;K. Lu;Fei Tang;Jin Wang;Jianping Wang;Sheng Wang;Shucheng Liu
中科院分区：
文献类型：
--
作者：
Jing Ren;K. Lu;Fei Tang;Jin Wang;Jianping Wang;Sheng Wang;Shucheng Liu
在过去的几年中，已经提出并研究了许多基于发布/订阅的信息中心网络（PS-ICN）架构，以有效地将信息从内容发布者传递给订阅者。然而，大多数关于PS-ICN的现有研究都没有考虑如何利用网络缓存，这是ICN中常见但重要的功能。为了解决这个问题，在本文中，我们提出了一种新的缓存感知的K-任播路由方案，即CAKA，可以显着提高内容交付的性能。具体来说，我们选择PURSUIT，这是最重要的PS-ICN架构之一，并利用其双向通信过程来完成以下工作：（1）使多个发布者能够向同一个订阅者发送探测消息;（2）允许订阅者使用K-任播路由和网络编码检索内容对象。在这项研究中，我们扩展了PURSUIT协议，以支持缓存感知的K-任播路由，并设计算法来选择多个部分不相交的路径进行探测，并选择路径进行内容检索。为了评估所提出的方案的性能，我们不仅开发了一个模拟测试床，但也在现实的网络环境中运行的原型。我们的研究表明，该方案可以显着减少平均跳数检索内容对象，与非常小的开销。版权所有© 2015约翰威利父子有限公司.
In the past few years, many publish/subscribe‐based information‐centric network (PS‐ICN) architectures have been proposed and investigated to efficiently deliver information from content publishers to subscribers. However, most existing studies on PS‐ICN have not considered how to utilize in‐network caches, which is a common but important feature in ICN. To address this issue, in this paper, we propose a novel cache‐aware K‐anycast routing scheme, namely, CAKA, that can significantly improve the performance of content delivery. Specifically, we choose PURSUIT, which is one of the most important PS‐ICN architectures, and leverage its bidirectional communication procedure to do the following: (1) enable multiple publishers to send probing messages to the same subscriber; and (2) allow the subscriber to retrieve content objects using K‐anycast routing and network coding. In this study, we extend the PURSUIT protocol to support cache‐aware K‐anycast routing and design the algorithms to choose multiple partially disjointed paths for probing, and to select paths for content retrieval. To evaluate the performance of the proposed scheme, we develop not only a simulation testbed, but also a prototype running in a realistic network environment. Our studies show that the proposed scheme can significantly reduce the average hops to retrieve content objects, with very small overheads. Copyright © 2015 John Wiley & Sons, Ltd.