Researcb on Name Lookup in Named Data Networking

Bin Liu; Yi Wang

doi:10.3969／j.issn.1000-0801.2014.09.002

您当前的位置：

首页 >

文章列表页 >

Researcb on Name Lookup in Named Data Networking

Special topics: Information Center Network (ICN) | 更新时间：2024-06-05

- Researcb on Name Lookup in Named Data Networking
- Telecommunications Science Vol. 30, Issue 9, Pages: 10-17(2014)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：10.3969／j.issn.1000-0801.2014.09.002
  CLC：
- Published Online：2014-09，
  
  Published：20 September 2014
- 稿件说明：
移动端阅览
Bin Liu, Yi Wang. Researcb on Name Lookup in Named Data Networking[J]. Telecommunications science, 2014, 30(9): 10-17.
DOI：

Bin Liu, Yi Wang. Researcb on Name Lookup in Named Data Networking[J]. Telecommunications science, 2014, 30(9): 10-17. DOI： 10.3969／j.issn.1000-0801.2014.09.002.

摘要

内容中心网络作为一种新型的未来网络体系架构被提出，以满足当前互联网信息共享的需求。内容中心网络使用类似域名的层次化名字结构对内容进行标识、路由和查找。由于互联网中内容众多，使用名字前缀构建的路由表，比传统的IP路由表大2～5个数量级，且由于名字查找依旧遵循最长前缀匹配原则，使得实现高速名字查找是一个富有挑战性的难题。分析了名字查找的技术挑战、实施难点，介绍了主要技术方法以及当前在名字查找领域的主要研究成果。

Abstract

Named data networking（NDN）proposed as a new future architecture for the internet

aims to satisfy the requirement of information sharing among the users. NDN applies the hierarchical names to identify contents

route packets and retrieve information. Given the massive amount of contents and the longest prefix matching principle

achieving high speed name lookup exhibits a big challenge to implement NDN in real networks. The technical challenges of name lookup were firstly analyzed

then the main techniques to achieve wire-speed name lookup and their corresponding research results were introduced.

关键词

Keywords

references

Web server survey . http://news.netcraft.com/archives/category/web-server-survey/ http://news.netcraft.com/archives/category/web-server-survey/

Content-addressable memory . http://en.wikipedia.org/wiki/Content-addressable_memory http://en.wikipedia.org/wiki/Content-addressable_memory

Wang Y , Zu Y , Zhang T , et al . Wire speed name lookup: a GPU-based approach . Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation （NSDI'13） , Lombard, IL USA , 2013

Wang Y , He K Q , Dai H C , et al . Scalable name lookup in NDN using effective name component encoding . Proceedings of the 32nd International Conference on Distributed Computing Systems（ICDCS） , Macau, China , 2012

Wang Y , Pan T , Mi Z A , et al . NameFilter: achieving fast name lookup with low memory cost via applying two-stage bloom filters . Proceedings of INFOCOM 2013, Mini-Conference , Turin, Italy , 2013

Wang Y , Xu B Y , Tai D Z , et al . Fast name lookup for named data networking . Proceedings of IWQoS 2014 , Hong Kong, China , 2014

NVIDIA's next generation CUDA computer architecture: fermi . http://www.nvidia.com/content/PDF/fermi_white_papers/NVIDIA_Fermi_Compute_Architecture_Whitepaper.pdf http://www.nvidia.com/content/PDF/fermi_white_papers/NVIDIA_Fermi_Compute_Architecture_Whitepaper.pdf , 2014

Zu Y , Yang M , Xu Z , et al . GPU-based NFA implementation for high speed memory efficient regular expression matching . Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming （PPoPP） , New Orleans, Louisiana , 2012

Edward F . Trie memory . Communications of the ACM , 1960 , 3 , (9) : 490 ～ 499

Bloom B H . Space／time trade-offs in hash coding with allowable errors . Communications of the ACM , 1970 , 13 , (7) : 422 ～ 426

Named data networking（NDN）project . http://www.named-data.net/techreport/TR001ndn-proj.pdf http://www.named-data.net/techreport/TR001ndn-proj.pdf , 2014

Bonomi F , Mitzenmacher M , Panigrahy R , et al . An improved construction for counting bloom filters . Proceedings of the 14th Annual European Symposium , Zurich, Switzerland , 2006

Qiao Y , Li T , Chen S G . One memory access bloom filters and their generalization . Proceedings of the 30th Annual IEEE International Conference on Computer Communications（INFOCOM） , Shanghai, China , 2011

DJB hash function . http:http://www.partow.net/programming/hashfunctions/#DJBHashFunction http:http://www.partow.net/programming/hashfunctions/#DJBHashFunction , 2012

Wang Y , Dai H C , Jiang J C , et al . Parallel name lookup for named data networking . Proceedings of the IEEE Global Telecommunications Conference （Globecom） , Houston, Texas, United States , 2011

Wang Y , Tai D Z , Zhang T , et al . Greedy name lookup for named data networking . Proceedings of ACM SIGMETRICS , Pittsburgh, PA , 2013

Wang Y , Dai H C , Zhang T , et al . GPU-accelerated name lookup with component encoding . Elsevier Computer Networks , 2013 , 57 , (16) : 3165 ～ 3177

Views

801

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰