Unlock instant, AI-driven research and patent intelligence for your innovation.

Method and device for ipv6 route lookup

A routing and search process technology, applied in digital transmission systems, electrical components, transmission systems, etc., can solve the problem of large routing table entries, reduce redundant nodes, improve search efficiency, and increase routing search speed.

Active Publication Date: 2018-08-10
NEW H3C TECH CO LTD
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] In addition, because the network device needs to support multiple VPN instances, each VPN instance needs to maintain an independent routing table. When the network device supports more VPN instances, the overall routing table entries of the network device will be very large.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and device for ipv6 route lookup
  • Method and device for ipv6 route lookup
  • Method and device for ipv6 route lookup

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0047] Tree Bitmap (tree bitmap) is a classic routing lookup algorithm based on Multibit Trie (multibit dictionary tree), which is applied to CRS series high-end routers. In order to gain an in-depth understanding of Tree Bitmap, first introduce Unibit Trie (unit dictionary tree) and Multibit Trie.

[0048] image 3 An example diagram for Unibit Trie, such as image 3 As shown, there are 9 IPv4 prefixes P1-P9 distributed. Among them, the highest prefix node P1 of the Unibit Trie represents the prefix *, after that, the prefix Q1 represented by the left branch of the lower level of P1 is 0*, the prefix P2 represented by the right branch of the lower level of P1 is 1*, and the lower level of Q1 The prefix P3 represented by the left branch of the first 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; That is to say, for any node P in the Unibit Tri...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

This application proposes an IPv6 route lookup method and device. The method includes: constructing a Multibit Trie for the routing distribution of IPv6 prefixes in each VPN; dividing each Multibit Trie into n+1 Levels: Level 0~n; The route above is extended to the m+1-level prefix; each branch of the m+1-th level IPv6 prefix is ​​used as a Branch_Tree; for each first-level Sub_Trie node in Level p~n, the current VPN identifier + this Sub_Trie All the bits of the IPv6 address of the node before this Level are used as the input Key, and Hash calculation is performed on the input Key; The input Key of Level is calculated, and the longest Hash hit result is used to find the route. The application improves the efficiency of IPv6 route lookup.

Description

technical field [0001] The present application relates to the technical field of route lookup, in particular to an IPv6 route lookup method and device. Background technique [0002] Communication between networks requires data transmission and forwarding, so one of the main functions of network equipment is to perform efficient data forwarding, and its function in the basic data plane of the Internet protocol is routing lookup, that is, according to the routing table. Prefix information, for each incoming data packet determines its next hop and outgoing port. Due to the wildcards in the routing table and the LPM (LongestPrefix Matching, longest prefix matching) problem of CIDR (Classless Inter-Domain Routing, based on Classless Inter-Domain Routing), routing search becomes very complicated. In addition to high performance, the LPM-based routing lookup algorithm also needs to meet the following requirements: [0003] 1. IPv4 and IPv6 dual stack [0004] Most existing algor...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/741H04L45/74
CPCH04L45/745
Inventor 任凯葛长忠安绍亮
Owner NEW H3C TECH CO LTD
PatSnap Eureka logo

PatSnap Eureka turns technology decisions into work you can execute. Powered by our Innovation Knowledge Graph, it runs expert workflows across engineering, life sciences, materials and intellectual property. Get your review-ready output in minutes.

X (Twitter)LinkedInYouTubeSubstack

© 2026 PatSnap. All rights reserved. 

Terms of Service

 | 

Privacy policy

 | 

Modern Slavery Act Transparency Statement