发明名称 Method and apparatus for longest match address lookup
摘要 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.
申请公布号 AU2334101(A) 申请公布日期 2001.06.18
申请号 AU20010023341 申请日期 2000.12.08
申请人 MOSAID TECHNOLOGIES INCORPORATED 发明人 DAVID A. BROWN
分类号 G06F17/30;G11C15/00;H04L12/741 主分类号 G06F17/30
代理机构 代理人
主权项
地址