Abstract: Token buckets are used in a computer or communications system for controlling rates at which corresponding items are processed. The number of tokens in a token bucket identifies the amount of processing that is available for the corresponding item. Instead of storing the value of a token bucket as a single value in a single memory location as traditionally done, the value of a token bucket is stored across multiple storage locations, such as in on-chip storage and in off-chip storage (e.g., in a memory device). An indication (e.g., one or more bits) can also be stored on chip to identify whether or not the off-chip stored value is zero and/or of at least of a certain magnitude such that it may be readily determined whether there are sufficient tokens to process an item without accessing the off-chip storage.

Abstract: Comparison tree data structures of particular use in performing lookup operations are disclosed. A data structure typically includes first and second elements of a subtree, the subtree including a root node. The first and the second elements each include: a node value field for indicating one or more paths from the root node through the subtree for reaching the respective first or second element. The first node also includes a next node indication for use in traversing to the second element. Additionally, one embodiment identifies a lookup value, wherein lookup value includes a first lookup path and a next portion of the lookup value. A first node including a first node value is identified, with the first node value. The first node value is compared with the first lookup path to identify that a matching child node has been identified.

Abstract: Inter alia, methods, apparatus, data structures, computer-readable medium, mechanisms, and means for programming routes and access control lists in comparison tree data structures and their use such as in performing lookup operations for use in routers, packet switching systems, and other devices. One implementation identifies a parent node, the parent node including a first node value for indicating a path through a subtree from a root node to the parent node, and the parent node including a first base pointer. A child node of the parent node is added at a memory location based on the base pointer and a next stride value, the child node including a second node value including the first node value and the next stride value.

Abstract: Inter alia, methods, apparatus, data structures, computer-readable medium, mechanisms, and means for programming routes and access control lists in comparison tree data structures and their use such as in performing lookup operations for use in routers, packet switching systems, and other devices. One implementation identifies a parent node, the parent node including a first node value for indicating a path through a subtree from a root node to the parent node, and the parent node including a first base pointer. A child node of the parent node is added at a memory location based on the base pointer and a next stride value, the child node including a second node value including the first node value and the next stride value.

Abstract: Comparison tree data structures of particular use in performing lookup operations are disclosed. A data structure typically includes first and second elements of a subtree, the subtree including a root node. The first and the second elements each include: a node value field for indicating one or more paths from the root node through the subtree for reaching the respective first or second element. The first node also includes a next node indication for use in traversing to the second element. Additionally, one embodiment identifies a lookup value, wherein lookup value includes a first lookup path and a next portion of the lookup value. A first node including a first node value is identified, with the first node value. The first node value is compared with the first lookup path to identify that a matching child node has been identified.