Apparatus and method for processing alternately configured longest prefix match tables
US9331942B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 28, 2014 |
| Grant date | May 3, 2016 |
| Priority date | — |
| Expiry date | Oct 2, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/741
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
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 from the local prefix matches is selected. The longest prefix match has an associated next hop index base address and offset value. A next hop index processor accesses a next hop index table in the memory utilizing the next hop index base address and offset value to obtain a next hop table pointer. A next hop processor accesses a next hop table in the memory using the next hop table pointer to obtain a destination network address.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.