High-Performance Kernel-Level In-Network Caching for Named Data Networking

doi:10.3778/j.issn.1002-8331.2204-0068

Abstract

Abstract: Named data networking（NDN） is a new information-centric network architecture. In-network caching is one of core functions in NDN. Current cache modules are mainly deployed in user-level, which brings issues of network operation efficiency, compatibility among devices and limitation of deployment location. Comparing to user-level cache module, kernel-level cache module can be directly and widely deployed on general net devices, so it can boost the large-scale deployment of in-network caching and the practical use of NDN solutions. However, due to the frequent per-packet caching operations in NDN, introducing cache into kernel may cause performance issues. To solve these performance issues, this paper designs and implements a kernel-level cache method. The cache method uses a hash table for exact cache lookup and utilizes the naming conventions of NDN to construct a trie for prefix cache lookup. Furthermore, this paper presents an approach of using fine-grained per-slot locks for lookup table and atomic operations for replacement queues to parallelize cache operations. The multi-thread cache module is implemented in the Linux kernel. The experimental results show that the proposed cache scheme reduces the lookup latency by half comparing to current solutions, and boosts the throughput up to 6.785 Mpacket/s via multithreading.

Key words: named data networking, in-network caching, named lookup, multi-thread

摘要： 命名数据网（named data networking，NDN）是一种以信息为中心的新型网络架构方案，网内缓存是其核心功能之一。现有缓存模块主要以应用级缓存实现为主，存在网络操作效率低、设备兼容性差、部署位置受限等问题。相比于应用级缓存模块，内核级缓存模块可以直接且广泛地部署于通用网络设备上，有助于推动网内缓存技术的规模应用以及NDN网络方案的实际部署。然而，由于NDN网内缓存机制涉及频繁的逐包缓存操作，将网内缓存功能引入内核将会影响内核处理性能。针对这一性能问题，设计并实现了一种内核级缓存方法。该方法维护一个哈希表进行缓存的精确查找，利用NDN名称的结构性，在节点间构建字典树支撑NDN缓存模糊匹配功能。提出使用细粒度的逐槽锁保护缓存查找表，原子操作保护替换队列，将缓存操作多线程并行化。在Linux内核中实现了所提的多线程缓存模块，实验结果表明，所提出的方法可以将缓存模块查找延迟降低至现有方案的一半，并且通过多线程将吞吐量提升至6.785?Mpacket/s。

关键词: 命名数据网, 网内缓存, 名称查找, 多线程

YANG Jike, SONG Tian, LI Tianlong, YANG Yating. High-Performance Kernel-Level In-Network Caching for Named Data Networking[J]. Computer Engineering and Applications, 2023, 59(16): 240-247.

杨济科, 嵩天, 李天龙, 杨雅婷. 面向命名数据网的高性能内核级网络缓存方法[J]. 计算机工程与应用, 2023, 59(16): 240-247.

References

[1] ZHANG L，AFANASYEV A，BURKE J，et al.Named data networking[J].ACM SIGCOMM Computer Communication Review，2014，44（3）：66-73.
[2] JACOBSON V，SMETTERS D K，THORNTON J D，et al.Networking named content[C]//Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies，Rome，Dec 1-4，2009.New York：ACM，2009：1-12.
[3] ZHANG L，ESTRIN D，BURKE J，et al.Named data networking （NDN） project：NDN-0001[R/OL].（2010-10-31）[2022-04-06].https：//named-data.net/wp-content/uploads/TR001ndn-proj.pdf.
[4] MANSILHA R B，SAINO L，BARCELLOS M P，et al.Hierarchical content stores in high-speed ICN routers：emulation and prototype implementation[C]//Proceedings of the 2nd ACM Conference on Information-Centric Networking，2015：59-68.
[5] AFANASYEV A，SHI J，ZHANG B，et al.NFD developer’s guide：NDN-0021[R/OL].（2021-08-01）[2022-04-06].https：//named-data.net/wp-content/uploads/2021/07/ndn-0021-11-nfd-guide.pdf.
[6] LI Z，XU Y，ZHANG B，et al.Packet forwarding in named data networking requirements and survey of solutions[J].IEEE Communications Surveys & Tutorials，2019，21（2）：1950-1987.
[7] YI W，HE K，DAI H，et al.Scalable name lookup in NDN using effective name component encoding[C]//2012 IEEE 32nd International Conference on Distributed Computing Systems，2012.
[8] SONG T，YUAN H，CROWLEY P，et al.Scalable name-based packet forwarding：from millions to billions[C]//Proceedings of the 2nd ACM Conference on Information-Centric Networking，2015：19-28.
[9] VARVELLO M，PERINO D，LINGUAGLOSSA L.On the design and implementation of a wire-speed pending interest table[C]//2013 IEEE Conference on Computer Communications Workshops，Turin，2013：369-374.
[10] HUANG K，WANG Z，XIE G.Scalable high-speed NDN name lookup[C]//Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems，2018：55-65.
[11] WANG Y，PAN T，MI Z，et al.NameFilter：achieving fast name lookup with low memory cost via applying two-stage bloom filters[C]//2013 Proceedings IEEE INFOCOM，2013：95-99.
[12] TIAN P，TAO H，JIANG L，et al.Fast content store lookup using locality-aware skip list in content-centric networks[C]//2016 IEEE Conference on Computer Communications Workshops，2016：187-192.
[13] QAZI M M，REHMAN R A，KIM B S.Minimizing content-store data access time using two-tier tree architecture for NDN-based WSNs[C]//2020 IEEE Wireless Communications and Networking Conference Workshops，2020.
[14] ZHANG R，LIU J，HUANG T，et al.Adaptive compression trie based bloom filter：request filter for NDN content store[J].IEEE Access，2017，5：23647-23656.
[15] KHATOUNI A S，MELLIA M，VENTURINI L，et al.Performance comparison and optimization of ICN prototypes[C]//2016 IEEE Globecom Workshops，2016.
[16] SO W，NARAYANAN A，ORAN D.Named data networking on a router：fast and dos-resistant forwarding with hash tables[C]//2013 IEEE Symposium on Architectures for Networking and Communications Systems，2013：215-225.
[17] SHI J，PESAVENTO D，BENMOHAMED L.NDN-DPDK：NDN forwarding at 100 Gbps on commodity hardware[C]//Proceedings of the 7th ACM Conference on Information-Centric Networking，2020.