节点文献

一种支持动态名字查找的NDN网络路由转发表设计

Self-Index FIB:a FIB for Supporting Dynamic Name Lookup in Named Data Networking

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 刘渊孙建华

【Author】 LIU Yuan;SUN Jian-hua;College of Computer Science and Electronic Engineering,Hunan University;

【机构】 湖南大学信息科学与工程学院

【摘要】 路由转发表是命名数据网络转发模块中重要的组成部分,转发表不仅要能被快速构建,还要支持高速的动态名字查找.所谓动态查找,是指当进行名字查找时,转发表还需同时支持表项的插入、更新和删除操作.设计二者兼顾的转发表仍是一大挑战,当前的研究成果主要是通过先构建路由表,再新建一个路由表索引来实现快速的名字查找,但对于高速动态名字查找效果仍然不佳.在本文中,我们将改进后的自适应基数树融合到转发表中,使转发表能利用基数树的特点,实现快速构建和动态名字查找,这种新的转发表称为自索引转发表.实验评估表明,自索引转发表有效提升了转发表的构建速度,保证了动态名字查找的效率,并在一定程度上节省了新建额外索引的内存开销.

【Abstract】 Forwarding Information Base(FIB) is a very crucial component of Named Data Networking(NDN) forwarding.An excellent FIB in NDN not only needs to be constructed high-efficiently,but also supports fast dynamic name lookup.The dynamic means the FIB should support insert,update and delete operations when fast name lookup executing.But designing this kind of FIB is still a big challenge.Current research is mainly to construct a FIB firstly,and then to build an extra FIB index to achieve fast name lookup,but the effect is still poor for high-speed dynamic name lookup.In this paper,we try to solve this problem by designing a novel FIB,which we called Self-Index FIB(SIF).We integrate an improved adaptive radix tree index structure into SIF,and then SIF can use the characteristics of the radix tree to achieve rapid construction and fast name lookup.Experimental evaluation shows that SIF can effectively improve the speed of the construction of FIB,and ensure the efficiency of dynamic name lookup,and save the memory cost of newly built FIB index to a certain extent.

【基金】 国家自然科学基金项目(61572179,60803130)资助
  • 【文献出处】 小型微型计算机系统 ,Journal of Chinese Computer Systems , 编辑部邮箱 ,2017年06期
  • 【分类号】TP393.02
  • 【下载频次】65
节点文献中: 

本文链接的文献网络图示:

本文的引文网络