Granted Patent B2

US 12,301,456 · App. 18/378,463 · Granted May 13, 2025

Inventors: Guy Townsend Hutchison (San Jose, CA); Sachin Ramesh Gandhi (San Jose, CA); Tsahi Daniel (Palo Alto, CA); Gerald Schmidt (San Jose, CA); Albert Fishman (Sunnyvale, CA); Martin Leslie White (Sunnyvale, CA); Zubin Shah (Santa Clara, CA)

Assignee: Marvell Asia PTE, LTD

H04L45/64G06F3/0604G06F3/064G06F3/0656G06F3/0673G06F16/00G06F40/205H04L45/74H04L45/745H04L45/7452H04L49/109H04L49/1546H04L49/3018H04L67/63H04L69/22

Abstract

Claims (42)

1. A switch microchip for a software-defined network, the microchip comprising:

a programmable parser that parses packet context data from headers of a plurality of incoming packets based on a software-defined parse graph of the parser including a plurality of paths; and

one or more dynamically configurable lookup memories having a plurality of tables, wherein the lookup memories are configured as a logical overlay such that the scaling and width of a portion of the lookup memories allocated to each of the paths is software-defined by a user.

2. The microchip of claim 1 , wherein starting from the same initial node of the parse graph, each path through the parse graph represents a combination of layer types of one of the headers that is able to be recognized by the parser.

3. The microchip of claim 2 , wherein portions of the paths overlap.

4. The microchip of claim 1 , further comprising a rewrite block that expands each layer of each of the headers parsed by the parser to form a expanded layer type of a generic size based on a protocol associated with the layer.

5. The microchip of claim 4 , wherein the rewrite block generates a bit vector that indicates which portions of the expanded layer type contain valid data and which portions of the expanded layer type contain data added during the expanding by the rewrite block.

6. The microchip of claim 1 , wherein the tables of the lookup memories are each able to be independently set in hash, direct access or longest prefix match operational modes.

7. The microchip of claim 6 , wherein the tables of the lookup memories are able to be dynamically reformatted and reconfigured by the user such that a number of tiles of the lookup memories partitioned and allocated for lookup paths coupled to the lookup memories is based on memory capacity needed by each of the lookup paths.

8. The microchip of claim 1 , further comprising at least one lookup and decision engine including:

a Key Generator configured to generate a set of lookup keys for each input token; and

an Output Generator configured to generate an output token by modifying the input token based on content of lookup results associated with the set of lookup keys.

9. The microchip of claim 8 , wherein each of the lookup and decision engines comprise:

an Input Buffer for temporarily storing input tokens before input tokens are processed by the lookup and decision engine;

a Profile Table for identifying positions of fields in each of the input tokens;

a Lookup Result Merger for joining the input token with the lookup result and for sending the joined input token with the lookup result to the Output Generator;

a Loopback Checker for determining whether the output token should be sent back to the current lookup and decision engine or to another lookup and decision engine; and

a Loopback Buffer for storing loopback tokens.

10. The microchip of claim 9 , wherein Control Paths of both the Key Generator and the Output Generator are programmable such that users are able to configure the lookup and decision engine to support different network features and protocols.

11. The microchip of claim 1 , further comprising a counter block including:

N wrap-around counters, wherein each of the N wrap-around counters is associated with a counter identification; and

an overflow FIFO used and shared by the N wrap-around counters, wherein the overflow FIFO stores the associated counter identifications of all counters that are overflowing.

12. A non-transitory computer-readable medium comprising one or more dynamically configurable lookup memories and storing a programmable parser that parses packet context data from headers of a plurality of incoming packets based on a software-defined parse graph of the parser including a plurality of paths, wherein the one or more dynamically configurable lookup memories have a plurality of tables and are configured as a logical overlay such that the scaling and width of a portion of the lookup memories allocated to each of the paths is software-defined by a user.

13. The non-transitory computer-readable medium of claim 12 , wherein starting from the same initial node of the parse graph, each path through the parse graph represents a combination of layer types of one of the headers that is able to be recognized by the parser.

14. The non-transitory computer-readable medium of claim 13 , wherein portions of the paths overlap.

15. The non-transitory computer-readable medium of claim 12 , wherein the non-transitory computer-readable medium further stores a rewrite block that expands each layer of each of the headers parsed by the parser to form an expanded layer type of a generic size based on a protocol associated with the layer.

16. The non-transitory computer-readable medium of claim 15 , wherein the rewrite block generates a bit vector that indicates which portions of the expanded layer type contain valid data and which portions of the expanded layer type contain data added during the expanding by the rewrite block.

17. The non-transitory computer-readable medium of claim 12 , wherein the tables of the lookup memories are each able to be independently set in hash, direct access or longest prefix match operational modes.

18. The non-transitory computer-readable medium of claim 17 , wherein the tables of the lookup memories are able to be dynamically reformatted and reconfigured by the user such that a number of tiles of the lookup memories partitioned and allocated for lookup paths coupled to the lookup memories is based on memory capacity needed by each of the lookup paths.

19. The non-transitory computer-readable medium of claim 12 , wherein the non-transitory computer-readable medium further stores at least one lookup and decision engine including:

a Key Generator configured to generate a set of lookup keys for each input token; and

an Output Generator configured to generate an output token by modifying the input token based on content of lookup results associated with the set of lookup keys.

20. The non-transitory computer-readable medium of claim 19 , wherein each of the at least one lookup and decision engines comprise:

an Input Buffer for temporarily storing input tokens before input tokens are processed by the lookup and decision engine;

a Profile Table for identifying positions of fields in each of the input tokens;

a Lookup Result Merger for joining the input token with the lookup result and for sending the joined input token with the lookup result to the Output Generator;

a Loopback Checker for determining whether the output token should be sent back to the current lookup and decision engine or to another lookup and decision engine; and

a Loopback Buffer for storing loopback tokens.

21. The non-transitory computer-readable medium of claim 20 , wherein Control Paths of both the Key Generator and the Output Generator are programmable such that users are able to configure the lookup and decision engine to support different network features and protocols.

22. The non-transitory computer-readable medium of claim 12 , wherein the non-transitory computer-readable medium further stores a counter block including:

N wrap-around counters, wherein each of the N wrap-around counters is associated with a counter identification; and

an overflow FIFO used and shared by the N wrap-around counters, wherein the overflow FIFO stores the associated counter identifications of all counters that are overflowing.

Assignments (4)

Continuity (6)

References Cited (393)