Huawei Technologies Co., Limited

Future Wei Technologies, Inc.

Wenyong Zhang

Hui Wang

Jun Gong

Shuying Liu

Zixiong Wang

Hongfei Chen

Xiaozhong Wang

Yuanming Zheng

A search apparatus, a search configuration method, and a search method are disclosed. The search apparatus includes N pipeline stages, where each pipeline stage includes a search unit. A search unit of each pipeline stage is configured with a prefix node. A prefix node configured in the (N&#x2212;1)-stage search unit is obtained by dividing, into sub-trees. A multi-bit Trie tree formed by a search table, a prefix node configured in the (N&#x2212;2)-stage search unit is obtained by dividing, into sub-trees. A multi-bit Trie tree formed by an associated prefix of the prefix node configured in the (N&#x2212;1)-stage search unit, and prefix node configuration is performed by means of iteration for multiple times. By using the search apparatus provided in the present invention, a memory resource to be occupied and a quantity of pipeline stages can be reduced, thereby reducing a search delay and decreasing difficulties in implementation.

Search apparatus, search configuration method, and search method

Methods and devices for creating, compressing and searching a binary tree are provided by the present disclosure, which relates to the field of traffic classification. Binary tree compression includes: determining a number of a compression layer or a number of an intermediate node, compressing a binary tree according to the number of the compression layer or the number of the intermediate node to form at least one compression node, and creating a bitmap of the compression node. Therefore, the depth of the decision tree is reduced, the search speed is increased, rule expansion is avoided, and rule replication is reduced.

Methods and devices for creating, compressing and searching binary tree

One embodiment of the present invention provides a router. The router includes a storage, a forwarding table management mechanism, and a longest prefix matching mechanism. The storage stores, in a data structure corresponding to a rich prefix node associated with a trie, a plurality of network address prefixes represented by the trie. The forwarding table management mechanism expresses a respective network address prefix using one or more of: 1) a traversal path on the trie from a root node to a subtrie of the trie; and 2) an encoded representation of a node in the subtrie. The longest prefix matching mechanism matches a network address with a longest prefix from the network address prefixes stored in the data structure corresponding to the prefix node.

Optimized trie-based address lookup

A method and a device for classifying a packet, in the field of communications technologies, are provided to reduce rule duplication in a classification process and improve classification efficiency. The method classifies a packet by receiving a packet; searching for a rule matching the packet in at least one created decision tree (created after an original rule set is divided based on a segmentation code); and classifying the packet according to a found rule. The method and the device may be applicable to a router.

Growing community of inventors

Beijing, China

Wenyong Zhang