...
首页> 外文期刊>International journal of communication systems >CAKA: a novel cache-aware K-anycast routing scheme for publish/subscribe-based information-centric network
【24h】

CAKA: a novel cache-aware K-anycast routing scheme for publish/subscribe-based information-centric network

机译:CAKA:一种用于基于发布/订阅的以信息为中心的网络的新型缓存感知K-anycast路由方案

获取原文
获取原文并翻译 | 示例
           

摘要

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 (c) 2015 John Wiley & Sons, Ltd.
机译:在过去的几年中,已经提出并研究了许多基于发布/订阅的以信息为中心的网络(PS-ICN)架构,以有效地将信息从内容发布者传递到订户。但是,关于PS-ICN的大多数现有研究都没有考虑如何利用网络内缓存,这是ICN中常见但重要的功能。为了解决这个问题,在本文中,我们提出了一种新颖的可感知缓存的K-anycast路由方案,即CAKA,它可以显着提高内容交付的性能。具体而言,我们选择最重要的PS-ICN架构之一PURSUIT,并利用其双向通信过程来执行以下操作:(1)使多个发布者可以向同一订户发送探测消息; (2)允许用户使用K-anycast路由和网络编码来检索内容对象。在这项研究中,我们扩展了PURSUIT协议以支持感知缓存的K-anycast路由,并设计了算法以选择多个部分不相交的路径进行探测,并选择用于内容检索的路径。为了评估所提出方案的性能,我们不仅开发了模拟测试台,而且还开发了在实际网络环境中运行的原型。我们的研究表明,提出的方案可以显着减少平均跳数,从而以很小的开销检索内容对象。版权所有(c)2015 John Wiley&Sons,Ltd.

著录项

  • 来源
    《International journal of communication systems》 |2015年第17期|2167-2179|共13页
  • 作者单位

    Univ Elect Sci & Technol China, Sch Commun & Informat Engn, Chengdu 610054, Peoples R China;

    Univ Puerto Rico, Dept Elect & Comp Engn, Mayaguez, PR USA|Shanghai Univ Elect Power, Sch Comp Engn, Shanghai, Peoples R China;

    Univ Elect Sci & Technol China, Sch Commun & Informat Engn, Chengdu 610054, Peoples R China;

    Soochow Univ, Suzhou, Peoples R China;

    City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China;

    Univ Elect Sci & Technol China, Sch Commun & Informat Engn, Chengdu 610054, Peoples R China;

    Huawei Technol, Shenzhen, Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    publish; subscribe-based ICN; in-network caching; cache-aware routing; K-anycast; network coding;

    机译:发布;基于订阅的ICN;网络内缓存;支持缓存的路由;K-anycast;网络编码;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号