Default route coding

• US 7,106,732 B2
• Filed: 10/31/2001
• Issued: 09/12/2006
• Est. Priority Date: 12/27/2000
• Status: Expired due to Term

• Current Assignee: Chartoleaux KG LLC (Intellectual Ventures LLC)
• Original Assignee: MOSAID Technologies Inc. (f/k/a Conversant Intellectual Property Management)
• Inventors: Brown, David A.
• Primary Examiner(s): NGUYEN, STEVEN H D
• Application Number:
  US10/004,280
• Publication Number:
  US 20020091856A1
• Time in Patent Office: 1,777 Days
• Field of Search: 370/389, 370/392, 711/216, 711/221, 717/168, 717/171, 709/242
• US Class Current: 370/389
• CPC Class Codes: H04L 45/745 Address table lookup; Address filtering

Abstract

A multi-level lookup table includes a plurality of search levels with each search level including a plurality of subtrees, each subtree representing a plurality of nodes. A search of the multi-level lookup table for an entry corresponding to a search key results in a value stored in an entry associated with the node in a subtree. A default value is associated with the root of the subtree. Multiple entries for the subtree can store the default value. To minimize route update time, the default value associated with the subtree is stored in a single location. Instead of storing the default value in multiple entries, each entry stores a use default indicator to indicate that the default value stored in the single location is to be used. To further reduce the number of locations to modify to update the default route, the single location can store an inherit indicator to indicate that the default value for the subtree is inherited from another subtree.

Claims

1. A method for updating a multi-level lookup table comprising the steps of:

providing a default route memory for storing an inherit indicator to indicate that a default route corresponding to the route associated with the root of a subtree is inherited from another subtree, wherein the inherited default route is forwarded by a default index pipeline;

sharing the default route by nodes in the subtree; and

modifying the default route of the root of the subtree, in a single write, by updating the default route memory of the root of the subtree to include a route index value.

2. The method as claimed in claim 1 wherein the subtree is a sparse subtree, the number of routes in the sparse subtree is greater than one and a sparse subtree entry associated with the subtree includes the default route memory.

3. The method as claimed in claim 1 wherein the subtree is a sparse subtree, the number of routes in the sparse subtree is one, and a default route memory associated with the sparse subtree stores the default route.

4. A method for updating a multi-level lookup table comprising the steps of:

providing a default route memory for storing a default route for a subtree, wherein the subtree is a dense subtree and a dense subtree descriptor associated with the subtree includes the default route memory;

sharing the default route by nodes in the subtree; and

modifying the default route of a root node, in a single write, by updating the default route memory of the root node to include a route index value.

5. The method as claimed in claim 4 wherein the default route is shared by storing a use default indicator in a mapper entry associated with at least one node in the subtree.

6. The method as claimed in claim 5 further comprising the step of:

returning the default route as a result of a search of the lookup table upon detecting the use default indicator stored in the mapper entry.

7. A multi-level lookup table comprising:

a default route memory which stores an inherent indicator to indicate that a default route associated with the root of the subtree is inherited from another subtree;

default logic which returns the default route as a result of a search of the lookup table; and

a default index pipeline which forwards the inherited default route.

8. The multi-level lookup table as claimed in claim 7 wherein the subtree is a sparse subtree, the number of routes in the sparse subtree is greater than one and a sparse subtree entry associated with the subtree includes the default route memory.

9. The multi-level lookup table as claimed in claim 7 wherein the subtree is a sparse subtree, the number of routes in the sparse subtree is one, and the default route memory is stored in a default mapper entry associated with the sparse subtree descriptor.

10. A multi-level lookup table comprising:

a default route memory which stores a default route shared by nodes in a subtree, wherein the subtree is a dense subtree and a dense subtree entry associated with the subtree includes the default route memory; and

default logic which returns the default route as a result of a search of the lookup table.

11. The multi-level lookup table as claimed in claim 10 further comprising:

a mapper entry associated with at least one node in the subtree, the mapper entry stores a use default indicator which indicates that the default route stored in the default route memory is the default route for the at least one node, the default route is modified by performing a single write to the default route memory.

12. The multi-level lookup table as claimed in claim 11 wherein the default logic returns the default route upon detecting the use default indicator stored in the mapper entry.

13. A multi-level lookup table comprising:

a default route memory which stores an inherit indicator to indicate that a default route associated with the root of the subtree is inherited from another subtree;

means for returning the default route as a result of a search of the lookup table; and

means for forwarding the inherited default index.

14. The lookup table as claimed in claim 13 wherein the subtree is a sparse subtree the number of routes in the sparse subtree is greater than one and a sparse subtree descriptor associated with the sparse subtree includes the default route memory.

15. The lookup table as claimed in claim 13 wherein the subtree is a sparse subtree, the number of routes in the sparse subtree is one, and the default route memory is stored in a default mapper entry associated with the sparse subtree descriptor.

16. A multi-level lookup table comprising:

a default route memory which stores a default route for nodes in a subtree, wherein the subtree is a dense subtree and a dense subtree descriptor associated with the subtree includes the default route memory; and

means for returning the default route as a result of a search of the lookup table upon detecting the use default indicator stored in the mapper entry.

17. A multi-level lookup table comprising:

a default route memory which stores a default route for nodes in a subtree;

means for returning the default route as a result of a search of the lookup table upon detecting the use default indicator stored in the mapper entry; and

means for sharing the default route amongst nodes in the subtree by storing a use default indicator in a mapper entry associated with at least one node in the subtree and modifying the default route of a root node, in a single write, by updating the default route memory of the root node to include a route index value.