Method and apparatus for storing sparse and dense subtrees in a longest prefix match lookup table
US6539369B2 · kind B2 · utility
44Cited by
7References
30Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Dec 8, 2000 |
| Grant date | Mar 25, 2003 |
| Priority date | — |
| Expiry date | Apr 27, 2021 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99943
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
We present a lookup table which allows sparse subtree descriptors and dense subtree descriptors to be stored in the same memory. A subtree entry in the memory stores a dense subtree descriptor for a dense subtree or a plurality of sparse subtree descriptors for sparse subtrees. The subtree entry is indexed by a leaf in the previous subtree. The sparse subtree descriptor stores at least one node descriptor. The node descriptor describes a set of leaves in the sparse subtree having a common value. The common value is encoded in the node descriptor using run length encoding.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.