PACKET EXTRACTION OPTIMIZATION IN A NETWORK PROCESSOR

• US 20140269718A1
• Filed: 03/15/2013
• Published: 09/18/2014
• Est. Priority Date: 03/15/2013
• Status: Active Grant

• Current Assignee: Marvell Asia Pte Limited (Marvell Technology Group Limited)
• Original Assignee: Cavium, LLC (Marvell Technology Group Limited)
• Inventors: Goyal, Rajan, Bouchard, Gregg A., Szypulski, Karen A., Spackman, Charles D.
• Granted Patent: US 9,276,846 B2
• Time in Patent Office: Days
• US Class Current: 370/392
• CPC Class Codes: H04L 2209/24 Key scheduling, i.e. generating round keys or sub-keys for block encryption
• CPC Class Codes: H04L 45/60 Router architectures
• CPC Class Codes: H04L 45/74 Address processing for routing
• CPC Class Codes: H04L 63/0227 Filtering policies mail message filtering H04L51/212
• CPC Class Codes: H04L 63/061 for key exchange, e.g. in peer-to-peer networks cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838

Abstract

A packet processor provides for rule matching of packets in a network architecture. The packet processor includes a lookup cluster complex having a number of lookup engines and respective on-chip memory units. The on-chip memory stores rules for matching against packet data. A lookup front-end receives lookup requests from a host, and processes these lookup requests to generate key requests for forwarding to the lookup engines. Based on information in the packet, the lookup front-end can optimize start times for sending key requests as a continuous stream with minimal delay. As a result of the rule matching, the lookup engine returns a response message indicating whether a match is found.

Claims

1. A method of processing a packet comprising:

receiving a first segment of a packet;

determining, based on the first segment, beats of a second segment of the packet containing portions of a key;

determining a start time at which the key may begin to be forwarded as a continuous stream, the start time being based on a prediction of when the portions of the key in the second segment will be received; and

initiating forwarding the key at the start time to a processing cluster configured to operate rule matching for the packet.

2. The method of claim 1, further comprising completing forwarding the key at an end time occurring after receipt of all of the portions of the key in the second segment.

3. The method of claim 1, wherein the key is a first key, and further comprising:

determining, based on the first segment, beats of a second segment of the packet containing portions of a second key;

determining a start time at which the second key may begin to be forwarded as a continuous stream, the start time being based on a prediction of when the portions of the second key in the second segment will be received; and

initiating forwarding the second key at the start time to a processing cluster configured to operate rule matching for the packet.

4. The method of claim 3, wherein the first and second keys are forwarded independent of one another.

5. The method of claim 3, wherein the first and second keys are forwarded serially to the respective processing clusters.

6. The method of claim 5, wherein the start time of the second key is based on a prediction of when forwarding the first key will be complete.

7. The method of claim 6, wherein the start time of the second key is determined to minimize delay between forwarding the first key and forwarding the second key.

8. The method of claim 3, further comprising:

determining portions of the packet that are common to both the first and second keys; and

ordering the packet such that the portions of the packet that are common are received prior to portions of the packet that are uncommon to the first and second keys.

9. The method of claim 1, further comprising determining an entry in a packet header table (PHT) for the packet, the entry indicating rules for extracting data from the packet to generate the key.

10. The method of claim 9, wherein the entry further indicates portions of the packet for generating the key.

11. The method of claim 10, wherein the start time is determined based on the entry.

12. The method of claim 1, wherein the first segment of the packet includes a group identifier (GID), and further comprising:

comparing the GID against a global definition table to determine at least one table identifier (TID);

determining, based on the TID, a subset of processing clusters that are capable of operating rule matching for the packet; and

selecting the processing cluster of the subset based on availability.

13. The method of claim 12, further comprising comparing the GID against a global definition table to determine a packet header index (PHIDX).

14. The method of claim 13, wherein the key is generated according to the PHIDX.

15. The method of claim 14, wherein the PHIDX indexes an entry in a packet header table (PHT), the entry indicating rules for extracting data from the packet to generate the key.

16. The method of claim 15, wherein the entry includes a mapping of the packet to the key.

17. The method of claim 12, further comprising comparing the GID against a global definition table to determine a key format table index (KFTIDX).

18. The method of claim 17, wherein the KFTIDX indexes an entry in a key format table, the entry indicating instructions for extracting fields from the key at the processing cluster.

19. The method of claim 17, wherein the key request further includes the KFTIDX.

20. The method of claim 1, wherein the start time is further determined based on a prediction of when an error code is received, the error code indicating whether the packet includes an error.

21. The method of claim 1, wherein the first segment includes a control word, and wherein the second segment includes a packet header.

22. An apparatus for processing a packet comprising:

a register configured to receive a first segment of a packet of a packet;

a packet header extractor (PHE) configured to;

determine, based on the first segment, the beats of a second segment of the packet containing portions of a key, and

determine a start time at which the key may begin to be forwarded as a continuous stream, the start time being based on a prediction of when all of the portions of the key in the second segment will be received; and

a scheduler output manager configured to initiate forwarding the key at the start time to a processing cluster configured to operate rule matching for the packet.

23. The apparatus of claim 22, wherein the scheduler output manager is further configured to complete forwarding the key at an end time occurring after receipt of all of the portions of the key in the second segment.

24. The apparatus of claim 22, wherein the key is a first key, and wherein the PHE is further configured to:

determine, based on the first segment, beats of a second segment of the packet containing portions of a second key; and

determine a start time at which the second key may begin to be forwarded as a continuous stream, the start time being based on a prediction of when the portions of the second key in the second segment will be received;

and wherein the scheduler output manager is further configured to initiate forwarding the second key at the start time to a processing cluster configured to operate rule matching for the packet.

25. The apparatus of claim 24, wherein the scheduler output manager forwards the first and second keys independent of one another.

26. The apparatus of claim 24, wherein the scheduler output manager forwards the first and second keys serially to the respective processing clusters.

27. The apparatus of claim 26, wherein the start time of the second key is based on a prediction of when forwarding the first key will be complete.

28. The apparatus of claim 27, wherein the start time of the second key is determined to minimize delay between forwarding the first key and forwarding the second key.

29. The apparatus of claim 24, wherein a host forwarding the packet to the register is configured to:

determine portions of the packet that are common to both the first and second keys; and

order the packet such that the portions of the packet that are common are received prior to portions of the packet that are uncommon to the first and second keys.

30. The apparatus of claim 22, wherein the PHE is further configured to determine an entry in a packet header table (PHT) for the packet, the entry indicating rules for extracting data from the packet to generate the key.

31. The apparatus of claim 30, wherein the entry further indicates portions of the packet for generating the key.

32. The apparatus of claim 31, wherein the PHE is further configured to determine the start time based on the entry.