An IPv6 Address Lookup Algorithm Based on Multi-bit Trie and Prefix Hierarchy
Abstract
The size of IPv6 routing table growing rapidly, fast ip address lookup is becoming critical in high-speed packet forwarding. However, most of the IPv4 routing algorithm is not suitable for IPv6, *measure the characteristics of IPv6 and the routing table address prefix hierarchical distribution. In this paper, a new fast IP address lookup algorithm based on multi-bit trie and prefix hierarchy is proposed. The proposed algorithm has good scalability and effectively reduces the depth of the search tree.
DOI
10.12783/dtetr/apetc2017/11393
10.12783/dtetr/apetc2017/11393
Refbacks
- There are currently no refbacks.