Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for realizing IPv6 fast route lookup

A routing and fast technology, applied in digital transmission systems, electrical components, transmission systems, etc., can solve problems such as increasing DFLOW overhead, reducing forwarding efficiency, and being less than ideal, and achieving the effect of improving forwarding efficiency

Active Publication Date: 2014-05-07
SHANGHAI BAUD DATA COMM
View PDF2 Cites 27 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Although the performance of the binary tree algorithm can meet the general needs, it is still not ideal
At present, DFLOW is directly associated with the routing nodes it depends on. It is difficult to accurately determine which DFLOWs need to be deleted when routing updates. Instead, conservative strategies can only be used to delete all DFLOWs that may need to be deleted, which increases the cost of rebuilding DFLOW and reduces forwarding efficiency

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 for realizing IPv6 fast route lookup
  • Method for realizing IPv6 fast route lookup

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0052] see figure 2 , which shows the process of using the bitmap to perform index mapping. It can be seen from the figure that in the original array 100 with 16 elements at the top, the elements with indexes 3, 4, 9 and 14 have actual content to be stored, and the rest are empty, so that the elements with actual content can be stored continuously , forming an array 300 with only 4 elements after compression, see the bottom of the figure.

[0053] Using the bitmap 200 in the middle of the figure, the original index value can be mapped to the compressed index value, 3 is mapped to 0, 4 is mapped to 1, 9 is mapped to 2, 14 is mapped to 3, and other original indexes on the corresponding bitmap All bits are 0, indicating that there is no content stored on these indices.

[0054] figure 1 It is a schematic diagram of the main data structure of the present invention. It can be seen from the figure that the R-series nodes are all leaf nodes that store routing information, and th...

example 2

[0057] This example is for a scheme of eigenvalues. Assuming that there are only two prefixes 110* and 11010* in the routing table (for simplicity, take an address prefix with only one valid byte as an example), the original characteristic values ​​of the two can be preliminarily determined to be (00100000)2 and (00001000) respectively 2, but since 110* is also the prefix of 11010*, prefix expansion is required, and the eigenvalues ​​of 110* are superimposed on the eigenvalues ​​of 11010*, and the final eigenvalues ​​of 110* and 11010* are (00100000)2 and ( 00101000) 2.

[0058] If you want to do the longest prefix match on the destination prefix 11011*, the first thing you find must be 11010* (the bit corresponding to 11011* in the bitmap must be 0, but you can still calculate the number of 1s in front of this bit at this time) method to get the index value of the effective prefix 11010* in front of 11011* and closest to it in the compressed array, of course, this method is ...

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

The invention discloses a method for realizing IPv6 fast route lookup. The data structure of a multibit tree is used to store a route table, then a compression method is used to compress a repeated key and an empty key generated by prefix expansion in a table in a branch node, and a mapping is made by using key index values before and after the compression. According to the method, on the basis of not increasing memory occupation, the adding, lookup and deletion speeds of an IPv6 route can be raised by multiple times.

Description

technical field [0001] The invention relates to IPv6 unicast routing in data communication, in particular to a method for IPv6 fast routing search. Background technique [0002] Traditionally, a tree structure is generally used to store routing tables, and the simplest method is to use a binary tree with values ​​marked on each branch, which is currently the most widely used method. It is generally stipulated that the path from a node to its left child node indicates that the corresponding bit in the prefix is ​​0, and the path from the node to its right child node indicates that the corresponding bit in the prefix is ​​1. Because routing prefixes are composed of binary 0 and 1, a binary tree is suitable for representing routing prefixes. [0003] Each search starts from the root node. Read 1 bit from the destination IP address each time, if it is 1, search for the right child node of the current node next time; if it is 0, search for the left child node. If the current n...

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 Applications(China)
IPC IPC(8): H04L12/741H04L45/74
Inventor 汪革彭双庭冯松柏
Owner SHANGHAI BAUD DATA COMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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