IPv6 routing lookup method and IPv6 routing lookup device
A technology of routing and ipv6 addresses, applied in the field of IPv6 routing search methods and devices, can solve problems such as large routing table entries, and achieve the effects of reducing redundant nodes, improving search efficiency, and reducing Hash conflicts
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0047] TreeBitmap (tree bitmap) is a classic routing lookup algorithm based on MultibitTrie (multibit dictionary tree), which is applied to CRS series high-end routers. In order to understand TreeBitmap in depth, first introduce UnibitTrie (unit dictionary tree) and MultibitTrie.
[0048] image 3 An example diagram for UnibitTrie, such as image 3 As shown, there are 9 IPv4 prefixes P1-P9 distributed. Among them, the highest prefix node P1 of UnibitTrie represents the prefix *, after that, the prefix Q1 represented by the left branch of the next level of P1 is 0*, the prefix P2 represented by the right branch of the next level of P1 is 1*, and the next The prefix P3 represented by the left branch of the level is 00*, the prefix Q2 represented by the left branch of the next level of P2 is 01*, the prefix Q3 represented by the right branch of the next level of P2 is 11*, and so on; Say, for any node P in the UnibitTrie, the prefix P represented by the left branch of the next...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com