基于流行度和CDT的NDN名称查找方案  

Name Lookup Scheme based on Popularity and CDT in NDN

作　　者：张进[1] 江凌云[1] ZHANG Jin;JIANG Lingyun(Nanjing University of Posts and Telecommunications,Nanjing Jiangsu 210003,China)

机构地区：[1]南京邮电大学,江苏南京210003

出　　处：《通信技术》2021年第4期853-863,共11页Communications Technology

基　　金：国家重大科研仪器研制项目(No.61427801)。

摘　　要：针对命名数据网络在网络规模增大时造成的转发信息表(Forwarding Information Base,FIB)中的名称条目呈指数级爆炸性增长、内存占用大、名称查找速度慢等问题,提出了一种基于流行度和CDT的名称查找方案。该方案将FIB划分为计数布隆过滤器(Counting Bloom Filter,CBF)、流行FIB、Conflict-split Degraded Trie(“冲突拆分”Degraded Trie,CDT)以及辅助FIB。CBF用于快速筛选掉不在FIB中的名称前缀,流行FIB用于高流行度的名称前缀的快速转发,CDT用于减少树的深度以及节点的数目,辅助FIB用于辅助流行FIB的更新以及CDT中节点的快速定位。实验结果表明,该方案在创建时间、查找时间、内存占用上存在优化效果,从而提升了NDN中FIB的存储和名称查找性能。A name lookup scheme based on popularity and CDT is proposed to solve the problem of exponentially explosive growth of name entries in the Forwarding Information Base(FIB),large memory usage,and slow name lookup speed caused by the increase of network scale of the named data networking.FIB is divided into Counting Bloom Filter(CBF),popular FIB,Conflict-split Degraded Trie(CDT),and auxiliary FIB in this scheme.CBF is used to quickly filter out name prefixes that are not in FIB,popular FIB is used for fast forwarding of highly popular name prefixes,CDT is used to reduce the depth of the tree and the number of nodes,and auxiliary FIB is used to assist the update of popular FIB and the rapid positioning of nodes in CDT.Simulation results indicate that an optimized effect of the scheme is presented on creation time,lookup time,and memory usage;so that the storage and name search performance of FIB is improved in NDN.

关 键 词：命名数据网络 名称查找 Conflict-split Degraded Trie HASH表 流行度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]