A Fast and Memory-Efficient Approach to NDN Name Lookup
文献类型：期刊论文
| 作者 | He, Dacheng2; Zhang, Dafang2; Xu, Ke2; Huang, Kun1; Li, Yanbiao2 |
| 刊名 | CHINA COMMUNICATIONS
 |
| 出版日期 | 2017-10-01 |
| 卷号 | 14期号:10页码:61-69 |
| 关键词 | named data networking binary search of hash table bloom filter |
| ISSN号 | 1673-5447 |
| 英文摘要 | 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 |
| 资助项目 | National Natural Science Foundation of China[61472130] ; National Natural Science Foundation of China[61702174] ; China Postdoctoral Science Foundation |
| WOS研究方向 | Telecommunications |
| 语种 | 英语 |
| WOS记录号 | WOS:000414520700006 |
| 出版者 | CHINA INST COMMUNICATIONS |
| 源URL | [http://119.78.100.204/handle/2XEOYT63/6424]  |
| 专题 | 中国科学院计算技术研究所期刊论文_英文 |
| 通讯作者 | Zhang, Dafang |
| 作者单位 | 1.Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China 2.Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, 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. |
入库方式： OAI收割
来源：计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。