Method for using a balanced tree as a base for a routing table
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jan 20, 2004
Grant Date -
Dec 5, 2002
app pub date -
Jan 18, 2002
filing date -
Jan 22, 2001
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
The invention provides a method for using a balanced tree as a base for a routing table. In one embodiment of the invention the routing table is stored as a binary search tree data structure in which a key value of each node in the tree corresponds with a network address of a network in the routing table. The tree is then rearranged so that any node having a key value which is a supernet of a network corresponding to the key value of any other node in the tree becomes a parent of such other node. In a preferred embodiment, the binary tree data structure is implemented as a red-black tree data structure.
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