Programming tree data structures and handling collisions while performing lookup operations
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 19, 2008
Grant Date -
Dec 16, 2004
app pub date -
Nov 7, 2003
filing date -
May 13, 2003
priority date (Note) -
In Force
status (Latency Note)
Importance
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully