Prefix partitioning methods for dynamic router tables
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Oct 28, 2008
Grant Date -
Dec 23, 2004
app pub date -
Nov 21, 2003
filing date -
Jul 3, 2002
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
A method is provided to improve the performance of dynamic router-table designs. Specifically, the invention relates to a method and system for partitioning prefixes at each node of a partitioning tree into 2.sup.s+1 partitions using the next s bits of the prefixes. Prefixes that have a length less than s are placed into partition -1, with the remaining prefixes falling into the remaining partitions that correspond to the value of their first s bits. Prefix partitioning may be controlled using either static rule tables or by dynamic rule tables. In one embodiment, binary tree on binary tree (BOB) data structures are applied to a partition of the present invention. In another embodiment, prefix binary tree on binary tree (PBOB) data structures are applied to a partition of the present invention. In a further embodiment, a dynamic longest-matching prefix binary tree on binary tree-table (LMPBOB) is applied to a partition of the present invention.
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