A search device, search configuration method and search method

Abstract

A search device, a search configuration method and a search method, the search device includes N pipeline stages, each pipeline stage includes a search unit, each stage search unit is configured with a prefix node, and the prefix of the N-1th level search unit configuration The node is obtained by subtree-dividing the multi-bit Trie tree formed by the lookup table, and the prefix node configured in the N-2 level search unit is formed by the associated prefix of the prefix node configured in the N-1 level search unit The multi-bit Trie tree is obtained by subtree division, and the prefix node configuration is performed through multiple iterations. By adopting the search device provided by the present invention, the occupation of memory resources and the number of pipeline stages can be reduced, thereby reducing search delay and implementation difficulty.

Description

technical field [0001] The invention relates to the field of network communication, in particular to a search device, a search configuration method and a search method. Background technique [0002] The main task of the router is to forward Internet Protocol (Internet Protocol, referred to as IP) packets, that is, to forward the packets arriving at the input port of the router to the correct output port according to the destination IP address in the packet header. Route lookup is the process of searching the routing table in the router according to the destination IP address of the message to obtain the next hop information of the message. [0003] The routing lookup adopts the longest prefix match (longest prefix match, LPM for short) principle. When multiple prefixes match the input IP address, the next-hop information corresponding to the prefix with the longest mask among the prefixes matching the IP address is the final search result. [0004] Commonly used route look...

AI Technical Summary

Problems solved by technology

[0017] The existing routing search algorithm based on multi-bit Trie algorithm puts the entire multi-bit Trie tree structure in the search device, which will take up a large amount of memory resources; Therefore, for IPv6 routes with longer masks, the number of multi-bit Trie trees tends to be more, and the number of corresponding pipeline structures is also more, resulting in a large search delay and increasing the difficulty of hardware implementation

Images