ndn中快速的贪婪名称查找策略 fast greedy name lookup strategy for ndn.pdfVIP

下载本文档

11
0
约 6页
2017-09-05 发布于上海
举报
版权申诉

ndn中快速的贪婪名称查找策略 fast greedy name lookup strategy for ndn.pdf

1、本文档共6页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

ndn中快速的贪婪名称查找策略 fast greedy name lookup strategy for ndn

44 2016 ，52（11） Computer Engineering and Applications 计算机工程与应用 ⦾大数据与云计算⦾ NDN 中快速的贪婪名称查找策略杨晓非，牛翠翠，丁志鹏，张宏宇 YANG Xiaofei, NIU Cuicui, DING Zhipeng, ZHANG Hongyu 重庆邮电大学通信与信息工程学院光纤通信技术重点实验室，重庆 400065 Key Laboratory of Optical Fiber Communication Technology, School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China YANG Xiaofei, NIU Cuicui, DING Zhipeng, et al. Fast greedy name lookup strategy for NDN. Computer Engineer- ing and Applications, 2016, 52 （11）：44-49. Abstract ：Considering that the current Trie-based longest prefix matching search strategy of NDN content names, which are length-variable, hierarchical and unbounded length, has features including the high complexity, the lower lookup rate and the high updating overhead of tree data structure, leading to low efficiency of algorithm, this paper puts forward a Fast and Greedy Name Lookup mechanism （FGNL ）to realize the rapidly forwarding of packets. Fast and greed compo- nent code allocation mechanism is low complexity, easy to implement and supports rapid update operations. Component encoding Trie is essentially a two-dimensional state transition table, so it can be further transformed into fast hash table lookup. The multi-hash table structure is fast created, compressed in storage space, and can greatly accelerate the name lookup rate. Extensive experiments demonstrate that FGNL mechanism can save approximately 48.71% memory cost compared with TCT, 26.98% compared with NCE and has a two times speedup compared with NCE. Evaluation results also show that this scheme can be extended up to adapt to the potential future growth of the name set. Key words ：Named Data Networking （NDN ）; name lookup; longest prefix match; hash table 摘要：针对当前基于Trie 的变长层次化且可以无限长度的命名的数据网络（Named Data Networking ，NDN ）内容名称的最长前缀匹配查找策略存在复杂性高、查找速率低