TY - JOUR
T1 - 面向命名数据网络的轻量级路由协议
AU - Zou, Bowen
AU - Song, Tian
AU - Li, Tianlong
AU - Yang, Yating
N1 - Publisher Copyright:
© 2024 Journal of Computer Engineering and Applications Beijing Co., Ltd.; Science Press. All rights reserved.
PY - 2024/3/1
Y1 - 2024/3/1
N2 - Named data networking (NDN) is a novel network architecture that revolves around information-centric principles. In order to acquire global routing information within the network, typical NDN routing protocols rely on data synchronization mechanisms to achieve global routing updates. However, such synchronization protocols operate at the application layer, which introduces challenges in dynamic network environments, such as high costs associated with network information updates and limited ability to perceive network dynamics. To address these issues, this paper designs and implements a lightweight named-binding routing protocol (NBRP). This approach binds routing node names with their published content names, enabling routing nodes to make targeted requests for routing update information without requiring additional synchronization protocols, thus achieving lightweight routing information exchange. To further reduce the transmission costs of routing updates, this paper introduces a reusable routing information packet naming format and a routing information incremental transmission mechanism. Additionally, to validate the effectiveness of the proposed solution, corresponding functional modules are implemented and tested within the Linux kernel. Experimental results demonstrate that, in dynamic network environments, compared with traditional NDN link-state routing protocols, the proposed method can reduce routing update synchronization costs by 72% and increase link-state awareness and response speed by nearly twofold.
AB - Named data networking (NDN) is a novel network architecture that revolves around information-centric principles. In order to acquire global routing information within the network, typical NDN routing protocols rely on data synchronization mechanisms to achieve global routing updates. However, such synchronization protocols operate at the application layer, which introduces challenges in dynamic network environments, such as high costs associated with network information updates and limited ability to perceive network dynamics. To address these issues, this paper designs and implements a lightweight named-binding routing protocol (NBRP). This approach binds routing node names with their published content names, enabling routing nodes to make targeted requests for routing update information without requiring additional synchronization protocols, thus achieving lightweight routing information exchange. To further reduce the transmission costs of routing updates, this paper introduces a reusable routing information packet naming format and a routing information incremental transmission mechanism. Additionally, to validate the effectiveness of the proposed solution, corresponding functional modules are implemented and tested within the Linux kernel. Experimental results demonstrate that, in dynamic network environments, compared with traditional NDN link-state routing protocols, the proposed method can reduce routing update synchronization costs by 72% and increase link-state awareness and response speed by nearly twofold.
KW - link-state awareness
KW - name-binding
KW - named data networking (NDN)
KW - routing protocol
UR - http://www.scopus.com/inward/record.url?scp=85188779949&partnerID=8YFLogxK
U2 - 10.3778/j.issn.1673-9418.2304001
DO - 10.3778/j.issn.1673-9418.2304001
M3 - 文章
AN - SCOPUS:85188779949
SN - 1673-9418
VL - 18
SP - 795
EP - 804
JO - Journal of Frontiers of Computer Science and Technology
JF - Journal of Frontiers of Computer Science and Technology
IS - 3
ER -