当前位置: X-MOL 学术Connect. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An efficient and DoS-resilient name lookup for NDN interest forwarding
Connection Science ( IF 5.3 ) Pub Date : 2021-03-16 , DOI: 10.1080/09540091.2021.1875988
Dacheng He, Dafang Zhang, Yanbiao Li, Wei Liang, Meng-Yen Hsieh

As a novel Internet architecture focused on data contents, Named Data Networking (NDN) has been proven to be of great value in supporting the Internet of Things, Edge computing, Blockchain, and other popular topics. They can benefit mainly from NDN's intrinsic properties, such as flexible multicasting, in-network caching, among several others. However, once NDN's forwarding plane suffers Denial of Service (DoS) attacks, the overall system performance would be affected significantly. In NDN data transmission, interest forwarding is the most time-consuming operation and thus opens a possible vector of DoS attacks. It is proposed in this paper a fast name lookup algorithm for NDN interest forwarding, which selects feature prefixes instead of lengths to filter out interest packets in NDN interest forwarding. Due to the excellent filtration with feature prefixes, the algorithm accelerates NDN forwarding processes. Compared with other existing solutions, the proposed algorithm shows more than 70% of time improvement in forwarding malicious interests, while remaining at the same performance level in standard cases.



中文翻译:

用于 NDN 兴趣转发的高效且具有 DoS 弹性的名称查找

作为一种专注于数据内容的新型互联网架构,命名数据网络(NDN)已被证明在支持物联网、边缘计算、区块链等热门话题方面具有巨大的价值。它们主要受益于 NDN 的内在属性,例如灵活的多播、网络缓存等。但是,一旦 NDN 的转发平面遭受拒绝服务 (DoS) 攻击,系统整体性能将受到显着影响。在 NDN 数据传输中,兴趣转发是最耗时的操作,因此打开了可能的 DoS 攻击向量。本文提出了一种用于NDN兴趣转发的快速名称查找算法,该算法在NDN兴趣转发中选择特征前缀而不是长度来过滤兴趣包。由于具有特征前缀的出色过滤,该算法加速了 NDN 转发过程。与其他现有解决方案相比,所提出的算法在转发恶意利益方面表现出超过 70% 的时间改进,同时在标准情况下保持相同的性能水平。

更新日期:2021-03-16
down
wechat
bug