Reinforcement multidigit Trie tree searching method and apparatus

A search engine and bitmap technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problems of waste of storage space, high price, small capacity, etc.

Inactive Publication Date: 2008-03-12
HUAWEI TECH CO LTD
View PDF0 Cites 36 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, there are two fatal shortcomings of commercial device TCAM: 1. Small capacity, one device can only realize 250,000 entries; 2. High price, one device costs more than 100 US dollars
From the original route prefix to multiple in the algorithm, it is necessary to store multiple redundant prefixes. It can be seen that this algorithm wastes storage space; moreover, the longer the search step is, the more redundant prefixes are generated after expansion. Then the storage space waste is more serious

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
  • Reinforcement multidigit Trie tree searching method and apparatus
  • Reinforcement multidigit Trie tree searching method and apparatus
  • Reinforcement multidigit Trie tree searching method and apparatus

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0095] The keyword to be searched (hereinafter referred to as Key) is 0100001010, and the NP interface of the search engine system obtains the Key to be searched from the network processor, first starting from the first-level tree node TNode, and Have_p_node in the TNode is "1", that is There is a prefix node PNode. At this time, PBMI / PNode_address is represented as a pointer PNode_address pointing to the prefix node, which is the pointer 110 in FIG. The third bit from the left in the Extending Bitmap is "1", so there is a subtree node, and it is the first among the subtree nodes; because there are subtree nodes, there is no need to read the current level PNode for parsing and processing , according to the pointer Child_address pointing to the subtree node array in TNode, that is, the pointer 100 in FIG. 7, the first tree node TNode of the second level is obtained.

[0096] Have_p_node in the first tree node TNode of the second level is also "1", that is, there is

[0097] PN...

Embodiment 2

[0099] If the search key is 0101001010, the first-level search is the same as when the first search key is 0100001010, and the second-level search is basically the same, except that no matching prefix is ​​found in the second-level PrefixBitmap analysis. Determine whether the PBMI (pointer 211 in FIG. 7 ) in the second-level PNode is valid; in this example, the PBMI is valid and points to the RNode corresponding to the first Prefix in the first-level subtree to obtain the search result.

Embodiment 3

[0101] If the search Key is 1110011011, at first from the tree node TNode of the first level, the Have_p_node in this TNode is "1", that is, there is PNode, and now PBMI / PNode_address is represented as PNode_address (pointer 110 among Fig. 7); The Extending Bitmap in the Extending Bitmap is "00110001", take the highest 3 bits "111" of the search Key, address and get the 8th bit from the left in the Extending Bitmap is "1", so there is a subtree node, and it is the first in the subtree node Three; because there is a subtree node, it is not necessary to read the PNode of the current level for parsing, and obtain the third tree node TNode of the second level according to the Child_address (pointer 100 in FIG. 7 ) in the TNode.

[0102] Have_p_node in the third tree node TNode of the second level is "0", that is, there is no PNode. At this time, PBMI / PNode_address is represented as PBMI (pointer 212 in FIG. 7); the Extending Bitmap in this TNode is "00110000" , take the second gro...

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 present invention relates to a searching technology for the routing forwarding table, in particular to a searching technology and a device which can enhance a multidigit Trie tree. Through optimizing and improving the searching method to the multidigit Trie, and the data structure of a tree node, particularly the relation between an expansion bitmap and an inferior tree node, and though adopting an FPGA and a DDRII SDRAM, the searching of the high-capacity routing forwarding table is realized, as well as the wire-speed searching under the 20 Gbps flow, even the 40 Gbps flow, and the present invention has obvious advantages in the aspects of table capacity and the cost etc. compared with the commercial three-state content addressable memorizer.

Description

technical field [0001] The present invention relates to the lookup technique of the routing forwarding table, in particular to an enhanced multi-bit Trie tree (hereinafter referred to as: Enhanced Multi-bit Trie) lookup method and device. Background technique [0002] With the rapid development of the Internet network, the number of route prefixes on the network has doubled, which puts forward higher and higher requirements for the entry capacity of router products. Because in the router, the routing prefix is ​​stored in the Internet Protocol Version 4 forwarding information base (hereinafter referred to as: IPV4 FIB) of the router, and the capacity of entries in the IPV4 FIB has been required to be on the order of millions. [0003] A multi-bit Trie tree (hereinafter referred to as: Multi-bit Trie) is shown in Figure 4. It is a tree formed after dividing a typical binary tree with "0" on the left and "1" on the right according to a certain search step. shaped structure. ...

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/56G06F17/30H04L12/753
Inventor 沈士军胡睿李猛徐振华
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap