您的位置:首页  > 论文页面

面向信息中心容迟网的命名社区路由算法

发表时间:2015-02-28  浏览量:4883  下载量:2754
全部作者: 许昱玮,刘婷婷,贾晓薇,徐敬东
作者单位: 南开大学计算机与控制工程学院
摘 要: 提出一种基于命名社区的路由(named-data-community-based routing,NDCR)算法。NDCR算法将网络中的所有节点划分入社区并为社区命名。当用户发出查询数据请求时根据社区名进行路由,而当返回命名数据时根据节点的历史连接数据选择中继点。研究在模拟器ONE上验证了NDCR算法的性能,并与EPI(epidemic),FC(first contact),DD(direct delivery)3种已知路由进行了对比。实验结果显示,NDCR的发送成功率为46.5%,仅次于EPI,高于FC和DD,而NDCR的平均开销不足EPI的20%. 研究结果表明,NDCR具有良好的网络性能,适用于以信息为中心的延迟容忍网络(information centric delay tolerant network,ICDTN)。
关 键 词: 计算机网络;延迟容忍网络;信息中心网络;命名社区;路由算法
Title: Routing algorithm by named communities in information centric delay tolerant network
Author: XU Yuwei, LIU Tingting, JIA Xiaowei, XU Jingdong
Organization: College of Computer and Control Engineering, Nankai University
Abstract: In this paper, we proposed a novel routing algorithm called named-data-community-based routing (NDCR). NDCR divided all the nodes into named communities. The requests sent by consumers would be routed by the names of communities, and the named data was also forwarded by the intermediate nodes which were selected according to history records. We validated our NDCR algorithm in the simulator ONE, and made performance comparison between NDCR and three well-known routing algorithms which were epidemic (EPI), first contact (FC) and direct delivery (DD). The results indicated that the delivery ratio of NDCR was up to 46.5%, which was slightly lower than EPI but higher than FC and DD, while the overhead of NDCR was only 20% of EPI. In summary, NDCR obtained a good network performance in information centric delay tolerant network (ICDTN).
Key words: computer network; delay tolerant network; information centric network; named community; routing algorithm
发表期数: 2015年2月第4期
引用格式: 许昱玮,刘婷婷,贾晓薇,等. 面向信息中心容迟网的命名社区路由算法[J]. 中国科技论文在线精品论文,2015,8(4):344-349.
 
0 评论数 0
暂无评论
友情链接