Fast prefix matching of bounded strings
The present invention increases the efficiency of performing longest prefix matching operations by selecting a radix-encoded trie structure optimized with respect to memory cost. The structure is optimized by determining memory costs for retrie structures indexed on different numbers of high-order characters, and then selecting the structure corresponding to the lowest memory cost. The optimization improves performance in IP look-up operations as well as longest-prefix matching operations performed on general alphabets.
AT&T Corp.
H H Y
H04L H04L Y10S
inventional inventional additional
Balachander Adam Louis Glenn Stephen Jia Kiem-Phong
Krishnamurthy Buchsbaum Fowler Wang Vo