NDN中名称查找方法对比  

Comparative on name lookup methods in NDN

作　　者：周炳晟 苗笛[1] 杨俊杰 王优祎康 ZHOU Bingsheng;MIAO Di;YANG Junjie;WANG Youyikang(School of Electronic Engineering,Tianjin University of Technology and Education,Tianjin 300222,China)

机构地区：[1]天津职业技术师范大学电子工程学院,天津300222

出　　处：《天津职业技术师范大学学报》2022年第2期23-28,35,共7页Journal of Tianjin University of Technology and Education

基　　金：教育部协同育人项目(201801082003);天津市科技计划项目(17YFZCSF01210);天津市教委科研计划项目(JWK1606)。

摘　　要：概述了命名数据网络(NDN)名称查找所面临的挑战以及实施难点。针对现有的22种名称查找方法,以查找吞吐率、内存开销占比和名称路由表3个因素作为衡量指标,分别采用基于前缀树、哈希表、布隆过滤器3种查找方案进行比对分析。结果表明:使用2种及以上的混合查找方案能够有效提高名称查找效率,为未来NDN的设计提供了新的思路。This paper outlines the challenges and difficulties in implementing the name lookup of the Named Data Networking(NDN). The existing 22 name lookup methods are compared and analyzed using three lookup schemes based on tries,hash tables,and Bloom filters,as well as three factors of lookup throughput,memory overhead ratio,and name routing table as metrics. The results show that using two or more hybrid search methods can effectively improve the efficiency of name lookup,which provides new ideas for future NDN design.

关 键 词：命名数据网络(NDN) 名称查找方法 前缀树 哈希表 

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