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

Large-scale character string high-speed searching method based on TCAM

A string and large-scale technology, applied in the field of network infrastructure, can solve problems such as limited storage space, and achieve the effect of increased query speed and fast query speed

Active Publication Date: 2018-04-27
BEIJING INSTITUTE OF TECHNOLOGYGY
View PDF7 Cites 20 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

TCAM can access all entries in the table in parallel and return the query results within one clock cycle. The query speed is extremely fast, but its storage space is limited. Currently, the largest TCAM memory is only 80Mb

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
  • Large-scale character string high-speed searching method based on TCAM
  • Large-scale character string high-speed searching method based on TCAM
  • Large-scale character string high-speed searching method based on TCAM

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0056] This embodiment describes the specific implementation of a TCAM-based high-speed search method for large-scale strings according to the present invention.

[0057] figure 1 Shows the flowchart of the present invention, including the flow of the construction process and the query process, figure 1 (a) shows the construction process of the present invention: the first step is to establish a tree structure according to the prefix string data set. In this embodiment, a deformed prefix tree Patricia tree is used. The Patricia tree uses nodes with only one child node Merge with its children to form a space-optimized prefix tree; the second step is to determine the position information in the prefix string of the byte, bit, and string-based structure of the middle node of the tree structure that is used to divide different child nodes, namely Distinguishing bit, the distinguishing bit in the present embodiment is the bit position in the character prefix binary representation ...

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 large-scale character string high-speed searching method based on a TCAM, and belongs to the field of network infrastructures. The method comprises the steps of constructionand query, during construction, a large-scale character string set is utilized to construct a tree structure, then a distinction position of two or multiple character strings is utilized to extract distinction position lists, the values corresponding to distinction positions on all assigned node paths in the tree structure according to the sequence of the distinction position lists, compression stings are constructed to serve as TCAM storage items, the divided subtree or leaf information is stored in a DRAM, and the SRAM is utilized to store the corresponding relation of the TCAM items and a DRAM address; during query, the distinction position lists are utilized to extract query character strings to generate query keywords of the TCAM, high-speed lookup features of the TCAM are utilized tolocate a subset or matching information stored in the DRAM, and high-speed matching of a large scale of character strings is achieved. By means of the large-scale character string high-speed searching method based on the TCAM, the matching speed of name prefixes is increased, and a large scale of varchar can be well disposed.

Description

technical field [0001] The present invention relates to a large-scale character string high-speed search method based on TCAM, in particular to a method for extracting bit values ​​or bit strings from a tree structure to construct a compressed bit string as a TCAM storage entry, and utilizing the characteristics of TCAM parallel search to realize The invention relates to high-speed matching of large-scale character strings, which belongs to the technical field of network infrastructure. Background technique [0002] String search algorithms are widely used in various fields of network infrastructure, and the speed of search algorithms often determines the level of network performance. Among them, the character string search plays a crucial role in the data packet forwarding process. When the router forwards the data packet, it needs to use the destination address (in the IP network) or the data name (in the information center network) to query the forwarding information base...

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): G06F12/06
CPCG06F12/0692
Inventor 嵩天刘苗苗
Owner BEIJING INSTITUTE OF TECHNOLOGYGY
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