CSpace  > 中国科学院计算技术研究所期刊论文  > 英文
A Fast and Memory-Efficient Approach to NDN Name Lookup
He, Dacheng1; Zhang, Dafang1; Xu, Ke1; Huang, Kun2; Li, Yanbiao1
2017-10-01
发表期刊CHINA COMMUNICATIONS
ISSN1673-5447
卷号14期号:10页码:61-69
摘要For name-based routing/switching in NDN,the key challenges are to manage large-scale forwarding Tables, to lookup long names of variable lengths, and to deal with frequent updates. Hashing associated with proper length-detecting is a straightforward yet efficient solution. Binary search strategy can reduce the number of required hash detecting in the worst case. However, to assure the searching path correct in such a schema, either backtrack searching or redundantly storing some prefixes is required, leading to performance or memory issues as a result. In this paper, we make a deep study on the binary search, and propose a novel mechanism to ensure correct searching path without neither additional backtrack costs nor redundant memory consumptions. Along any binary search path, a bloom filter is employed at each branching point to verify whether a said prefix is present, instead of storing that prefix here. By this means, we can gain significantly optimization on memory efficiency, at the cost of bloom checking before each detecting. Our evaluation experiments on both real-world and randomly synthesized data sets demonstrate our superiorities clearly
关键词named data networking binary search of hash table bloom filter
收录类别SCI
语种英语
资助项目National Natural Science Foundation of China[61472130] ; National Natural Science Foundation of China[61702174] ; China Postdoctoral Science Foundation
WOS研究方向Telecommunications
WOS类目Telecommunications
WOS记录号WOS:000414520700006
出版者CHINA INST COMMUNICATIONS
引用统计
被引频次:7[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/6425
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Zhang, Dafang
作者单位1.Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China
2.Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
推荐引用方式
GB/T 7714
He, Dacheng,Zhang, Dafang,Xu, Ke,et al. A Fast and Memory-Efficient Approach to NDN Name Lookup[J]. CHINA COMMUNICATIONS,2017,14(10):61-69.
APA He, Dacheng,Zhang, Dafang,Xu, Ke,Huang, Kun,&Li, Yanbiao.(2017).A Fast and Memory-Efficient Approach to NDN Name Lookup.CHINA COMMUNICATIONS,14(10),61-69.
MLA He, Dacheng,et al."A Fast and Memory-Efficient Approach to NDN Name Lookup".CHINA COMMUNICATIONS 14.10(2017):61-69.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[He, Dacheng]的文章
[Zhang, Dafang]的文章
[Xu, Ke]的文章
百度学术
百度学术中相似的文章
[He, Dacheng]的文章
[Zhang, Dafang]的文章
[Xu, Ke]的文章
必应学术
必应学术中相似的文章
[He, Dacheng]的文章
[Zhang, Dafang]的文章
[Xu, Ke]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。