A load balancing mechanism maps a binary tree representation of a routing table into a set of fixed size memories. The mechanism efficiency utilizes the memory in the routing table without violating the tree precedence constraints and the memory access requirements of a pipelines system. The mechanism stores a subtree associated with a densely populated level of the binary tree in memory associated with lower levels.
申请公布号
WO02098055(A2)
申请公布日期
2002.12.05
申请号
WO2002CA00786
申请日期
2002.05.28
申请人
MOSAID TECHNOLOGIES INCORPORATED;AHMAD, IMTIAZ;BROWN, DAVID, A.