| 摘要 |
PROBLEM TO BE SOLVED: To provide a network switch with alternately configured longest prefix match tables.SOLUTION: A network switch includes a memory configurable to store alternate table representations of an individual trie in a hierarchy of tries. A prefix table processor accesses in parallel, using an input network address, the alternate table representations of the individual trie and searches for a longest prefix match in each alternate table representation to obtain local prefix matches. The longest prefix match is selected from the local prefix matches. The longest prefix match has an associated next hop index base address and an offset value. |
