High-speed routing search method and device based on variable step width trie tree
A step width and routing technology, applied in the transmission system, electrical components, etc., can solve the problems of maintaining high efficiency and inability to ensure the routing table, and achieve the effect of improving flexibility
Active Publication Date: 2022-03-29
TSINGHUA UNIV
View PDF6 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0003] However, most of the existing routing lookup algorithms including Poptrie rely on a relatively fixed data structure, which cannot ensure high efficiency in routing tables with various distribution characteristics.
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 moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0022] Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals designate the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary and are intended to explain the present invention and should not be construed as limiting the present invention.
[0023] In order to solve the above technical problems, the present invention proposes a routing search algorithm based on a multi-way trie tree. On the basis of ensuring search efficiency, the flexibility of the algorithm is improved by supporting variable step width. The algorithm uses bitmap index sub-nodes to compress the space to speed up the search, and the bitmap of the node is segmented and stored separately in the bit string sequence to achieve fast search under different synchronization widths.
[0024] The high-speed ro...
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
Login to View More Abstract
The present invention proposes a high-speed routing search method and device based on a variable step width trie tree, wherein the method includes: constructing at least one root node according to all prefixes in the routing table; using the preset step width s corresponding to each root node , match the next s bits of binary data of all prefixes, and get 2 s child nodes; repeat the above steps for internal nodes, until the child nodes are leaf nodes to complete the creation of the initial trie tree; according to the node type of the child nodes in the initial trie tree, construct the leaf_string corresponding to the leaf node and corresponding to the internal node innode_string; according to the preset segment length w, segment leaf_string and innode_string respectively to obtain multiple segment data, and count each segment data through a counter to obtain the corresponding counting result, so as to query the corresponding destination IP address according to the counting result routing. Therefore, on the basis of ensuring the search efficiency, the flexibility of the algorithm is improved by supporting variable step width.
Description
technical field [0001] The invention relates to the field of computer application technology, in particular to a high-speed routing search method and device based on a variable step width trie tree. Background technique [0002] The router needs to use the routing lookup algorithm to perform the longest prefix match on the incoming IP address, so as to determine the next hop of the corresponding data packet. The Poptrie algorithm proposes a routing lookup algorithm that uses bitmap to index child nodes to achieve high-speed lookup. [0003] However, most of the existing routing lookup algorithms including Poptrie rely on relatively fixed data structures, which cannot ensure high efficiency in routing tables with various distribution characteristics. Therefore, in order to adapt to the ever-increasing routing tables in various scenarios, a flexible and variable routing lookup algorithm that can achieve high-speed lookup is needed. Contents of the invention [0004] The pr...
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
Login to View More Patent Type & Authority Patents(China)
IPC IPC(8): H04L45/745H04L45/748
CPCH04L45/745H04L45/748
Inventor 张雨轩杨芫徐明伟
Owner TSINGHUA UNIV