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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: DEStech Transactions on Engineering and Technology Research
Paper Title
Journal
Date
