Cached IP routing tree for longest prefix search

• US 20030026246A1
• Filed: 06/05/2002
• Published: 02/06/2003
• Est. Priority Date: 06/06/2001
• Status: Abandoned Application

• Current Assignee: Conexant Systems Incorporated (Synaptics Incorporated)
• Original Assignee: Zarlink Semiconductor Inc. (Microchip Technology Incorporated)
• Inventors: Hsieh, Steven, Cravens, George, Dorfman, Ilya, Huang, James, Lin, Eric, Yik, James
• Application Number:
  US10/163,478
• Publication Number:
  US 20030026246A1
• Time in Patent Office: Days
• US Class Current: 370/352
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/74591 using content-addressable memories [CAM]

Abstract

Architecture for processing routing information in a data network. A set of routing information entries is provided in a routing database of a first storage location. A subset of the routing information entries is created in a second storage location, which subset of the routing information entries are in the structure of an IP tree. Packet routing information of an incoming packet is extracted, which packet routing information includes multiple byte parts. The second storage location is accessed to compare the multiple byte parts of the packet routing information sequentially with respective entries of the subset of routing information entries to determine forwarding information. The subset of routing information in the second location is adjusted dynamically in response to the availability of the packet routing information in the subset of routing information entries.

Claims

1. A method of processing routing information in a data network, comprising the steps of:

providing a set of routing information entries in a routing database of a first storage location;

creating a subset of the routing information entries in a second storage location; and

accessing the second storage location before the first storage location when a packet is received.

2. The method of claim 1, wherein the time to access the second storage location is less than the time to access the first storage location.

3. The method of claim 1, wherein the second storage location is a cache memory associated with a network switching device, and the first storage location is network computing device that includes a storage device on which the routing database is stored.

4. The method of claim 1, further comprising the step of updating the subset of routing information entries of the second storage location when at least one of, the packet is received that includes routing information not contained in the subset of routing information entries, one of the set of routing information entries of the first storage location is deleted, a new routing information entry is added to the set of routing information entries of the first storage location, and a select one of the subset of the set of routing information entries of the second storage location is aged out.

5. The method of claim 1, wherein the second storage location is associated with a network switching device, which network switching device includes an interface algorithm that interfaces to the first storage location to receive routing information therefrom, and which interface algorithm further interfaces to a search engine of the network switching device to communicate results of the step of accessing from the search engine to the first storage location and maintains the subset of routing information entries of the second storage location.

6. The method of claim 5, wherein the interface algorithm resides in firmware of the network switching device.

7. The method of claim 1, wherein the subset of routing information entries in the second storage location is structured as an IP tree.

8. The method of claim 1, wherein the routing information is processed by a resolving algorithm that resolves an IP address, which algorithm includes no more than four layers of direct-addressed pointer tables.

9. The method of claim 1, further comprising the steps of,

extracting a destination address of the packet, which destination address contains multiple bytes, and

resolving the destination address by comparing at least one of the multiple bytes with a respective pointer table.

10. The method of claim 9, wherein the multiple bytes are compared sequentially to respective pointer tables in the subset of routing information of the second storage location until the routing information for the packet is detected.

11. The method of claim 10, wherein the step of resolving further includes the step of backtracking to a previous pointer table associated with a previous byte of the multiple bytes to retrieve control information.

12. The method of claim 1, further comprising the step of enqueing the packet in order to access the first storage location when the routing information is not found in the step of accessing the second storage location.

13. The method of claim 1, wherein the subset of routing information in the step of creating is adjusted dynamically in response to the availability of packet routing information of the packet in the subset of routing information.

14. The method of claim 1, wherein the first storage location communicates with a third storage location to update the routing information of the routing database in the step of providing.

15. A method of processing routing information in a data network, comprising the steps of:

providing a set of routing information entries in a routing database of a first storage location;

creating a subset of the routing information entries in a second storage location;

accessing the second location before the first location when a packet is received; and

adjusting dynamically the subset of routing information in response to the availability of packet routing information of the packet in the subset of routing information.

16. The method of claim 15, further comprising the step of resolving a multi-byte destination address of the packet against the subset of routing information with a resolving algorithm, which resolving algorithm includes no more than four layers of direct addressed pointer tables, each layer associated with a byte of the destination address.

17. The method of claim 16, wherein the step of resolving further includes the step of backtracking to a previous pointer table associated with a previous byte of the destination address multiple bytes to retrieve control information.

18. A method of processing routing information in a data network, comprising the steps of:

providing a set of routing information entries in a routing database of a first storage location;

creating a subset of the routing information entries in a second storage location, which subset of the routing information entries are in the structure of an IP tree;

extracting packet routing information of an incoming packet, which packet routing information includes multiple byte parts;

accessing the second storage location to compare the multiple byte parts of the packet routing information sequentially with respective entries of the subset of routing information entries to determine forwarding information; and

adjusting dynamically the subset of routing information in response to the availability of the packet routing information in the subset of routing information entries.

19. A system of processing routing information in a data network, comprising:

a set of routing information entries provided in a routing database of a first storage location; and

a subset of the routing information entries created in a second storage location;

wherein the second storage location is accessed before the first storage location when a packet is received.

20. The system of claim 19, wherein the time to access the second storage location is less than the time to access the first storage location.

21. The system of claim 19, wherein the second storage location is a cache memory associated with a network switching device, and the first storage location is network computing device that includes a storage device on which the routing database is stored.

22. The system of claim 19, wherein the subset of routing information entries of the second storage location is updated when at least one of, the packet is received that includes routing information not contained in the subset of routing information entries, one of the set of routing information entries of the first storage location is deleted, a new routing information entry is added to the set of routing information entries of the first storage location, and a select one of the subset of the set of routing information entries of the second storage location is aged out.

23. The system of claim 19, wherein the second storage location is associated with a network switching device, which network switching device includes an interface algorithm that interfaces to the first storage location to receive routing information therefrom, and which interface algorithm further interfaces to a search engine of the network switching device to communicate results from the search engine to the first storage location and maintains the subset of routing information entries of the second storage location.

24. The system of claim 23, wherein the interface algorithm resides in firmware of the network switching device.

25. The system of claim 19, wherein the subset of routing information entries in the second storage location is structured as an IP tree.

26. The system of claim 19, wherein the routing information is processed by a resolving algorithm that resolves an IP address, which algorithm includes no more than four layers of direct-addressed pointer tables.

27. The system of claim 19, wherein a destination address is extracted from the packet, which destination address contains multiple bytes, and the destination address is resolved by comparing at least one of the multiple bytes with a respective pointer table.

28. The system of claim 27, wherein the multiple bytes are compared sequentially to respective pointer tables in the subset of routing information of the second storage location until the routing information for the packet is detected.

29. The system of claim 28, wherein the destination address is resolved by backtracking to a previous pointer table associated with a previous byte of the multiple bytes to retrieve control information.

30. The system of claim 19, wherein the packet is enqueued in order to access the first storage location when the routing information is not found in the second storage location.

31. The system of claim 19, wherein the subset of routing information is adjusted dynamically in response to the availability of packet routing information of the packet in the subset of routing information.

32. The system of claim 19, wherein the first storage location communicates with a third storage location to update the routing information entries of the routing database.

33. A system of processing routing information in a data network, comprising:

a set of routing information entries stored in a routing database of a first storage location; and

a subset of the routing information entries created in a second storage location;

wherein the second location is accessed before the first location when a packet is received;

wherein the subset of routing information is adjusted dynamically in response to the availability of packet routing information of the packet in the subset of routing information.

34. The system of claim 33, wherein a multi-byte destination address of the packet is resolved against the subset of routing information entries with a resolving algorithm, which resolving algorithm includes no more than four layers of direct-addressed pointer tables, each layer associated with a byte of the destination address.

35. The system of claim 34, wherein the destination address is resolved by backtracking to a previous pointer table associated with a previous byte of the multiple bytes to retrieve control information.

36. The system of claim 33, wherein the second storage location is associated with a network switching device, which network switching device includes an interface algorithm that interfaces to the first storage location to receive routing information therefrom, and which interface algorithm further interfaces to a search engine of the network switching device to communicate results from the search engine to the first storage location and maintains the subset of routing information entries of the second storage location.

37. A system of processing routing information in a data network, comprising:

a set of routing information entries in a routing database of a first storage location;

a subset of the routing information entries created in a second storage location, which subset of the routing information entries are in the structure of an IP tree;

wherein packet routing information is extracted from an incoming packet, which packet routing information includes multiple byte parts;

wherein the second storage location is accessed to compare the multiple byte parts of the packet routing information sequentially with respective entries of the subset of routing information entries to determine forwarding information; and

wherein the subset of routing information is adjusted dynamically in response to the availability of the packet routing information in the subset of routing information entries.

38. The system of claim 37, wherein the second storage location is associated with a network switching device, which network switching device includes an interface algorithm that interfaces to the first storage location to receive routing information therefrom, and which interface algorithm further interfaces to a search engine of the network switching device to communicate results from the search engine to the first storage location and maintains the subset of routing information entries of the second storage location.

39. A system of processing routing information in a data network, comprising:

a first storage location of a network for storing a set of routing information; and

a second storage location for storing a subset of the routing information, which second storage location is associated with a network switching device, which network switching device includes,

a search engine for extracting a destination address of an incoming packet, and resolving the destination address against the subset of routing information of the second storage location; and

an interface algorithm for interfacing with the first storage location to facilitate dynamic adjustment of the subset of routing information entries at the second storage location based upon the availability destination information associated with the packet in the subset of routing information.