07539153 is referenced by 14 patents and cites 33 patents.

The present invention discloses a method and apparatus for longest prefix matching. The method includes (A) reading a current-level trie node (TNODE) in the trie, (B) determining whether an offset field of the TNODE indicates that a matched prefix exists in an upper level node and, if so, adding the offset field of the TNODE to a pointer that points to a leaf array in the upper level node, updating a current best match pointer with the computation result and executing block (C), otherwise, executing block (C), (C) determining whether the TNODE has a child node according to a child bitmap, when it is determined that a branch flag of the TNODE matches a corresponding bit of a search keyword, and (D) when it is determined that the TNODE has no child node, reading the internal bitmap of the TNODE, computing a longest matched prefix in the TNODE according to the internal bitmap and a pointer that points to a leaf array in the TNODE, updating the current best match pointer with the computation result, and computing an address of a leaf node (LNODE) associated with the current best match pointer.

Title
Method and apparatus for longest prefix matching based on a trie
Application Number
12/241513
Publication Number
7539153 (B1)
Application Date
September 30, 2008
Publication Date
May 26, 2009
Inventor
Jun Gong
Shenzhen
CN
Rui Hu
Shenzhen
CN
Juan Zhang
Shenzhen
CN
Meng Li
Shenzhen
CN
Shijun Shen
Shenzhen
CN
Jun Liang
Shenzhen
CN
Agent
Tim Tingkang Xia Esq
Morris Manning Martin
Assignee
Huawei Technologies
CN
IPC
G01R 31/08
View Original Source