Donghong Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Donghong Jiang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Gaogang Xie
Chinese Academy of Sciences
3 shared publications - Yanbiao Li
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China
3 shared publications - Yuxuan Chen
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China
3 shared publications - Jing Hu
Wuhan University
2 shared publications - Yi Huang
Huawei Technologies Company Ltd., Shenzhen, China
2 shared publications - Shi Meng
Computer Network Information Center, Chinese Academy of Sciences;University of Chinese Academy of Sciences, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1410-1426
Trie-Structure-Guided Compression, Allocation, and Mapping for Storage-Efficient IPv6 Lookup Pipelines
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1410-1426
Open AccessTrie-Structure-Guided Compression, Allocation, and Mapping for Storage-Efficient IPv6 Lookup Pipelines
- 9 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 554-569
Heuristic Binary Search: Adaptive and Fast IPv6 Route Lookup With Incremental Prefix Updates
The advent of Software Defined Networking (SDN) and Network Function Virtualization (NFV) has revolutionized the deployment of software-based routing and forwarding devices in cloud and network systems. Yet, the performance of IPv6 route lookup in these devices remains a significant challenge due to two main factors: 1) the longer IPv6 addresses, which hinder high-speed lookup, and 2) the huge IPv6 IP address space, necessitates adaptability to varied length-based prefix distributions across various network scenarios. Existing IP lookup algorithms fall short in addressing these IPv6-specific challenges. To address these challenges, this paper proposes a novel Heuristic Binary Search (HBS) scheme. Building on the classical “Binary Search on Prefix Lengths” scheme, HBS employs three innovative techniques to achieve adaptive and fast IPv6 lookups with incremental updates: 1) a heuristic binary search method for fast lookup; 2) a tree rotation method for dynamic adjustment of binary search tree shapes in response to changes in prefix distribution; and 3) the introduction of the Associated Marker List (AML), a new data structure aimed at facilitating rapid incremental prefix updates. Our theoretical proofs and comprehensive evaluations demonstrate HBS’s superiority in lookup performance, dynamic adaptability, update speed, and memory efficiency.
- 9 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 554-569
Heuristic Binary Search: Adaptive and Fast IPv6 Route Lookup With Incremental Prefix Updates
The advent of Software Defined Networking (SDN) and Network Function Virtualization (NFV) has revolutionized the deployment of software-based routing and forwarding devices in cloud and network systems. Yet, the performance of IPv6 route lookup in these devices remains a significant challenge due to two main factors: 1) the longer IPv6 addresses, which hinder high-speed lookup, and 2) the huge IPv6 IP address space, necessitates adaptability to varied length-based prefix distributions across various network scenarios. Existing IP lookup algorithms fall short in addressing these IPv6-specific challenges. To address these challenges, this paper proposes a novel Heuristic Binary Search (HBS) scheme. Building on the classical “Binary Search on Prefix Lengths” scheme, HBS employs three innovative techniques to achieve adaptive and fast IPv6 lookups with incremental updates: 1) a heuristic binary search method for fast lookup; 2) a tree rotation method for dynamic adjustment of binary search tree shapes in response to changes in prefix distribution; and 3) the introduction of the Associated Marker List (AML), a new data structure aimed at facilitating rapid incremental prefix updates. Our theoretical proofs and comprehensive evaluations demonstrate HBS’s superiority in lookup performance, dynamic adaptability, update speed, and memory efficiency.
- Open Access
- 29 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 47-53
Heuristic Binary Search: Adaptive and Fast IPv6 Route Lookup with Incremental Updates
- 29 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 47-53
Open AccessHeuristic Binary Search: Adaptive and Fast IPv6 Route Lookup with Incremental Updates