| 84 | 2 | 16 |
| 下载次数 | 被引频次 | 阅读次数 |
概述了命名数据网络（NDN）名称查找所面临的挑战以及实施难点。针对现有的22种名称查找方法，以查找吞吐率、内存开销占比和名称路由表3个因素作为衡量指标，分别采用基于前缀树、哈希表、布隆过滤器3种查找方案进行比对分析。结果表明：使用2种及以上的混合查找方案能够有效提高名称查找效率，为未来NDN的设计提供了新的思路。
Abstract：This paper outlines the challenges and difficulties in implementing the name lookup of the Named Data Networking(NDN). The existing 22 name lookup methods are compared and analyzed using three lookup schemes based on tries,hash tables,and Bloom filters,as well as three factors of lookup throughput,memory overhead ratio,and name routing table as metrics. The results show that using two or more hybrid search methods can effectively improve the efficiency of name lookup,which provides new ideas for future NDN design.
[1] ZHANG L,ESTRIN D,BURKE J. Named data networking(NDN)project[EB/OL].(2016-10-09)[2021-07-08]. https：//blog.csdn.net/gongxifacai_believe/article/details/52771659.
[2] DAI H C,LIU B,CHEN Y,et al. On pending interest table in named data networking[C]//ANCS′12:Proceedings of the Eighth ACM/IEEE Symposium on Architectures for Networking and Communications Systems. Austin:IEEE, 2012:211-222.
[3] BERNERS-LEE T,MASINTER L,MCCAHILL M. Uniform Resource Locators(URL)[M]. New York:Association Management Solutions,LLC(AMS),1994.
[4] NILSSON S,KARLSSON G. IP-address lookup using LCtries[J]. IEEE Journal on Selected Areas in Communications,1999,17(6):1083-1092.
[5] WU Y,NONG G,HAMDI M. Scalable pipelined IP lookup with prefix tries[J]. Computer Networks,2017,120:1-11.
[6] LI Y B,ZHANG D F,YU X,et al. Accelerate NDN name lookup using FPGA:challenges and a scalable approach[C]//2014 24th International Conference on Field Programmable Logic and Applications(FPL). Munich:IEEE,2014:1-4.
[7] LEE J,LIM H. A new name prefix trie with path compression[C]//2016 IEEE International Conference on Consumer Electronics-Asia(ICCE-Asia). Seoul:IEEE,2016:438-456.
[8] LI D G,LI J M,DU Z. An improved trie-based name lookup scheme for Named Data Networking[C]//2016 IEEE Symposium on Computers and Communication(ISCC). Messina:IEEE,2016:1294–1296.
[9] WANG Y,XU B Y,TAI D Z,et al. Fast name lookup for named data networking[C]//2014 IEEE 22nd International Symposium of Quality of Service(IWQoS). Hong Kong:IEEE,2014:198–207.
[10]WANG Y,PAN T,MI Z A,et al. NameFilter:achieving fast name lookup with low memory cost via applying two-stage bloom filters[C]//2013 Proceedings IEEE INFOCOM. Turin:IEEE,2013:95–99.
[11] TAN Y,ZHU S H. Efficient name lookup scheme based on hash and character trie in named data networking[C]//201512th Web Information System and Application Conference(WISA). Jinan:IEEE,2015:130–135.
[12] YUAN H W,CROWLEY P. Reliably scalable name prefix lookup[C]//2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems(ANCS). Oakland:IEEE,2015:111–121.
[13] HE D C,ZHANG D F,XU K,et al. A fast and memoryefficient approach to NDN name lookup[J]. China Communications,2017,14(10):61-69.
[14]WU Q T,YAN J R,ZHANG M C,et al. Efficient lookup schemes based on splitting name for NDN[J]. Journal of Internet Technology,2019,20(1):195-203.
[15] BYUN H,LIM H. A new bloom filter architecture for FIB lookup in named data networking[J]. Applied Sciences,2019,9(2):329.
[16] LEE J,BYUN H,LIM H. Dual-load bloom filter:application for name lookup[J]. Computer Communications,2020,151:1-9.
[17]KIM J,KO M C,SHIN M S,et al. Scalable name lookup for NDN using hierarchical hashing and patricia trie[J]. Applied Sciences,2020,10(3):1023.
[18] SAXENA D,RAYCHOUDHURY V. Radient:scalable,memory efficient name lookup algorithm for named data networking[J]. Journal of Network and Computer Applications,2016,63:1-13.
[19] SO W,NARAYANAN A,ORAN D,et al. Named data networking on a router[J]. ACM SIGCOMM Computer Communication Review,2013,43(4):495-496.
[20] YUAN H W,CROWLEY P. Scalable pending Interest table design:from principles to practice[C]//IEEE INFOCOM2014-IEEE Conference on Computer Communications. Toronto:IEEE,2014:2049-2057.
[21] CAROFIGLIO G,GALLO M,MUSCARIELLO L,et al.Pending interest table sizing in named data networking[C]//Proceedings of the 2nd ACM Conference on InformationCentric Networking. New York:ACM,2015:1-7.
[22]LI Z,LIU K H,ZHAO Y,et al. MaPIT:an enhanced pending interest table for NDN with mapping bloom filter[J].IEEE Communications Letters,2014,18(11):1915-1918.
[23] FENG S B,ZHANG M C,ZHENG R J,et al. A fast name lookup method in NDN based on hash coding[C]//Proceedings of the 3rd International Conference on Mechatronics and Industrial Informatics. Paris:Atlantis Press,2015:575-580.
[24]DAI H C,LU J Y,WANG Y,et al. BFAST:unified and scalable index for NDN forwarding architecture[C]//2015IEEE Conference on Computer Communications(INFOCOM).Hong Kong:IEEE,2015:2290-2298.
[25]HSU J M,CHANG J Y. A CRC-32 name prefix encoding in named data networking[J]. International Journal of Advanced Information Technology(IJAIT),2014,8:125-130.
[26]LIU M M,SONG T,YANG Y T,et al. A unified data structure of name lookup for NDN data plane[C]//ICN′17:Proceedings of the 4th ACM Conference on InformationCentric Networking. Berlin:ACM,2017:188-189.
[27] SHEN T,ZHANG X Y,XIE G G,et al. CoDE:fast name lookup and update using conflict-driven encoding[C]//2018IEEE 37th International Performance Computing and Communications Conference(IPCCC). Orlando:IEEE,2018:17-19.
基本信息:
DOI：10.19573/j.issn2095-0926.202202004
中图分类号:TP393.0
引用信息:
[1]周炳晟,苗笛,杨俊杰,等.NDN中名称查找方法对比[J].天津职业技术师范大学学报,2022,32(02):23-28+35.DOI:10.19573/j.issn2095-0926.202202004.
基金信息:
教育部协同育人项目（201801082003）; 天津市科技计划项目（17YFZCSF01210）; 天津市教委科研计划项目（JWK1606）