Efficient name lookup scheme based on hash and character trie in named data networking

摘要：

　　Name lookup, as a key function of routers for forwarding and filtering packets in NDN, has confronted serious memory efficiency problem.To solve the problem, this paper presents an efficient NDN name lookup scheme-Split Name character Trie(SNT).It first decomposed a name into components, which were then hashed to construct a trie.After that, the trie would be split into two smaller ones.When operating name lookup, a name would be split into two parts to conduct lookup on the two tries independently.Experimental results show that SNT supports longest prefix match very well.It can reduce 30% ~ 38% memory cost by component hash and can reduce 30% ~ 33% memory cost further by splitting trie.Despite of the extra memory cost of maintaining hash table, it still improves general memory efficiency by 23% ~ 49%.

关键词： NDN name lookup component hash split trie longest prefix match memory efficiency

作者: Yun Tan Shuhua Zhu

作者单位: School of Information Science and Technology Jinan University Guangzhou, China

会议类型: 国际会议

会议名称: The 12th Web Information System and Application Conference第十二届全国Web信息系统及其应用学术会议(WISA2015)、全国第十次语义Web 与本体论学术研讨会(SWON2015)、全国第九次电子政务技术及应用学术研讨会(EGTA2015)

会议地点: 济南

会议语种:英文

页码: 130-135

在线出版日期: 2015-09-11（万方平台首次上网日期，不代表论文的发表时间）