Load balancing in IP address lookup
First Claim
Patent Images
1. A multi-level lookup table comprising:
- a plurality of memories, a binary tree representation of a routing table mapped into the memories, with each memory associated with one level of the binary tree; and
logic which allows storage of a subtree that includes final routes and is associated with a densely populated level of the binary tree in a memory associated with a level lower than the densely populated level of the binary tree to increase the number of locations for storing routes for the densely populated level.
4 Assignments
0 Petitions
Accused Products
Abstract
A load balancing mechanism maps a binary tree representation of a routing table into a set of fixed size memories. The mechanism efficiently utilizes the memory in the routing table without violating the tree precedence constraints and the memory access requirements of a pipelined system. The mechanism stores a subtree associated with a densely populated level of the binary tree in memory associated with lower levels.
23 Citations
20 Claims
-
1. A multi-level lookup table comprising:
-
a plurality of memories, a binary tree representation of a routing table mapped into the memories, with each memory associated with one level of the binary tree; and
logic which allows storage of a subtree that includes final routes and is associated with a densely populated level of the binary tree in a memory associated with a level lower than the densely populated level of the binary tree to increase the number of locations for storing routes for the densely populated level. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method for increasing a number of routes stored in a multi-level lookup table comprising the steps of:
-
mapping a binary tree representation of a routing table into a plurality of memories, each memory associated with one level of the binary tree; and
storing a subtree that includes final routes and is associated with a densely populated level of the binary tree in a memory associated with the level of the binary tree lower than the densely populated level to increase the number of locations for storing routes for the densely populated level. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14)
-
-
15. A multi-level lookup table comprising:
-
a plurality of memories, a binary tree representation of a routing table mapped into the memories, with each memory associated with one level of the binary tree; and
logic means for storing a subtree that includes final routes and is associated with a densely populated level of the binary tree in a lower level memory associated with the lower level of the binary tree to increase the number of locations for storing routes for the densely populated level. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification