电信科学 ›› 2014, Vol. 30 ›› Issue (4): 46-53.doi: 10.3969/j.issn.1000-0801.2014.04.007

• 研究与开发 • 上一篇    下一篇

一种面向邻近缓存的引导式内容路由机制

杜传震,兰巨龙,田铭   

  1. 国家数字交换系统工程技术研究中心 郑州 450002
  • 出版日期:2014-04-15 发布日期:2017-06-29
  • 基金资助:
    国家重点基础研究发展计划(“973”计划)基金资助项目;国家高技术研究发展计划(“863”计划)基金资助项目;国家科技支撑计划基金资助项目

A Leading Routing Mechanism for Neighbor Content Store

Chuanzhen Du,Julong Lan,Ming Tian   

  1. National Digital Switching System Engineering Technological R&D Center, Zhengzhou 450002, China
  • Online:2014-04-15 Published:2017-06-29

摘要:

针对命名数据网络(NDN)内容请求节点容易忽略邻近节点缓存的问题,基于节点兴趣集群思想,提出一种面向邻近缓存的引导式便捷内容路由机制。首先通过构建节点兴趣集群将节点分为若干区域进行缓存通告;然后设计报文与便捷路由转发表项;最后选择最优路径发送请求数据。理论分析与仿真结果表明,该机制能够充分利用邻近节点缓存,有效地降低了用户平均时延,服务器负载减少约30%。

关键词: 命名数据网络, 内容路由, 兴趣集群, 邻近缓存

Abstract:

It is very easy for the nodes in named data networking to ignore the neighbor nodes. To solve this issue, a leading routing mechanism for neighbor content store was proposed. Firstly, through building the interest clusters, the nodes were partitioned to different reigns to announce the information of content store. Secondly, the packets and the fast routing tables were designed. Finally, the best path was chosen to send the interest packets. The theoretical analysis and simulation results show that, this mechanism adequately uses the neighbor content and effectively decreases the average network delay. The server load is reduced by 30%.

Key words: named data networking, content routing, interest cluster, neighbor content store

No Suggested Reading articles found!