Patent Grant
11425038
In Software Defined Networking (SDN), the control plane is physically separated from the forwarding plane and communicates with the forwarding plane through an interface (e.g., the OpenFlow protocol). OpenFlow is an evolving networking standard that uses a match-action paradigm for network packet switching. The typical hardware switches that were (and still are) used to implement the match-action paradigm, however, are not quite flexible since they process only a fixed set of fields with a limited repertoire of packet processing actions. A reconfigurable match table (RMT) architecture that overcomes the aforementioned shortcomings has recently been introduced to the market. This new architecture could be improved to make the hardware switch operate more efficiently.
Some embodiments provide a novel packet processing pipeline that enhances the match-action packet header processing performed by reconfigurable hardware switches. The hardware switch of some embodiments includes, among other elements, an ingress pipeline and an egress pipeline. Each pipeline includes a parser, a match-action unit (MAU), and a deparser. In some embodiments, for each packet that is processed by the switch, the parser separates the packet header data (e.g., Ethernet headers, IPv4 headers, TCP headers, etc.) from the payload of the packet and determines which fields of each packet header (e.g., source port address of the TCP header, destination port address of the TCP header, etc.) might be processed by the MAU. The parser of some such embodiments (1) populates a primary packet header vector (PPHV) with only the fields of the different headers that may be used by the MAU, and (2) populates a secondary packet header vector (SPHV) with the rest of the fields of the different headers (i.e., the fields that will not be processed by the MAU). In some embodiments, the PPHV and SPHV each includes a set of registers that stores the packet header fields during processing by the MAU.
In some embodiments, the parser delivers the populated PPHV to the MAU, which includes a set of match-action stages for matching the different header fields of the packet against the different match tables and applying the required actions to the packet by modifying the packet header data (e.g., assigning the packet to an output port and queue, sending the packet to a network controller, dropping the packet, etc.). The parser of some such embodiments also delivers the populated SPHV directly to the deparser (without having the MAU process the SPHV) along with the payload of the packet.
In some embodiments, after the different packet headers are processed by the MAU, the deparser reassembles the packet with (1) the processed header data (e.g., modified header fields) of the PPHV that the deparser receives from the MAU, (2) the unprocessed header data stored in the SPHV that the deparser receives from the parser directly, and (3) the payload of the packet that the deparser also receives from the parser. After reassembling the packet, if the packet is reassembled by an ingress deparser, the deparser sends the packet to a queuing system to be subsequently forwarded to the egress pipeline of the switch. On the other hand, if the packet is reassembled by an egress deparser, the deparser sends the packet (with a header that might or might not have been modified) out of the switch.
The parser of some embodiments determines which fields of each packet header may be processed and which fields will not be processed by the MAU, based on the information the parser receives from the packet headers themselves (e.g., the EtherType field of the packet, etc.), and based on configuration data received from the control plane. In some embodiments, a compiler in the control plane receives the data required for configuring the pipeline (e.g., through a programing language code), generates a set of configuration data, and distributes the generated data to a configurator module (also part of the control plane). The configurator module then distributes the configuration data to both the parser and MAU of the pipeline in the switch.
The parser of some embodiments, based on the information it receives from the configurator, determines which sets of packet headers to extract from the packet and how to extract these packet headers. The parser analyzes the packet headers as it extracts them according to the configuration data configured by the control plane. This configuration data represents a parse graph that identifies how to parse the packet based on values of certain packet header fields as well as table flow and control flow graphs used to generate the configuration data for the MAU, which describe how packets will be processed through the stages of the MAU. Based on the configuration data and the values of certain packet header fields, the parser determines iteratively (i) whether each packet header field should be placed in the PPHV or the SPHV and (ii) how to extract the next set of packet header fields. For instance, the EtherType field of the layer 2 header of some embodiments specifies how to extract the layer 3 header (e.g., whether the packet is IPv4 or IPv6, etc.).
Separating the fields that may be processed by the MAU from the rest of the fields in each packet header improves the overall efficiency of the switch in many ways. For instance, this separation helps avoid wasting the valuable resources of the MAU by enabling these resources to only (or primarily) process data that is actually needed for making the packet processing determinations. For example, a TCP packet header typically has a minimum length of five words (twenty bytes). In many cases, the MAU of the pipeline processes only four bytes of the TCP header bytes (i.e., the source and destination port addresses) and the rest of the fields in the TCP header (sixteen bytes) are not used by any of the stages of the MAU. In such cases, by separating the unused data from useful data, the parser does not waste any of the valuable resources of the MAU to process the other sixteen bytes of the TCP header.
In addition, separating the PPHV from the SPHV enables the parser to parse deeper into packets while sending the same amount of data to the MAU (via the PPHV). While using a single PPHV of a fixed size only allows the parser to extract the packet headers up to a certain point (the size of the PPHV), sending some of the unused fields into the SPHV allows the PPHV to carry only the more useful fields, and include deeper packet headers. For example, newer tunneling protocols such as GENEVE add variable length option fields to the packet header, and may be quite long. Similarly, packets sent using multi-layer tunneling may have significant amounts of packet header data that may need to be extracted in order to reach the layer 4 (e.g., TCP) data. By sending the fields that will not be processed by the MAU to the SPHV, the PPHV can include packet header fields that are located deeper into the packet, without sending additional data to the MAU.
The preceding Summary is intended to serve as a brief introduction to some embodiments of the invention. It is not meant to be an introduction or overview of all inventive subject matter disclosed in this document. The Detailed Description that follows and the Drawings that are referred to in the Detailed Description will further describe the embodiments described in the Summary as well as other embodiments. Accordingly, to understand all the embodiments described by this document, a full review of the Summary, Detailed Description and the Drawings is needed. Moreover, the claimed subject matters are not to be limited by the illustrative details in the Summary, Detailed Description and the Drawings, but rather are to be defined by the appended claims, because the claimed subject matters can be embodied in other specific forms without departing from the spirit of the subject matters.
The novel features of the invention are set forth in the appended claims. However, for purpose of explanation, several embodiments of the invention are set forth in the following figures.
In the following description, numerous details are set forth for the purpose of explanation. However, one of ordinary skill in the art will realize that the invention may be practiced without the use of these specific details. In other instances, well-known structures and devices are shown in block diagram form in order not to obscure the description of the invention with unnecessary detail.
Some embodiments provide a novel packet processing pipeline that enhances the match-action packet header processing performed by reconfigurable hardware switches. The hardware switch of some embodiments includes, among other elements, an ingress pipeline and an egress pipeline. Each of these pipelines includes a parser, a match-action unit (MAU), and a deparser.
In some embodiments the queuing system 120 receives the packets that are processed by the ingress pipeline and provides a large shared buffer (storage) that accommodates the queuing delays due to oversubscription of the output channels of the ingress deparser. In some embodiments, the data buffer stores packet data, while pointers to that data are kept in different queues per channel. Each channel in turn requests data from the common data buffer using a configurable queuing policy. When pointers to packets reach the head of the queues, the packets are read out of the data buffer 120 into the egress interface 125.
Similar to the ingress interface 115, the egress interface 125 of some embodiments receives the packet from the queuing system 120, separates the packet payload from the packet headers, stores the packets headers in a PHV, sends the PHV through an ingress pipeline of match and action stages, deparses the packet headers back from the PHV into packet format, and sends the packet 130 to an appropriate output port of the switch 110 to be driven off the switch (e.g., through one of the output channels). The output packet 130 may be the same packet as the input packet 105 (i.e., with identical packet headers), or it may have different packet headers compared to the input packet 105 based on the actions that are applied to the packet headers in the ingress and egress pipelines (e.g., different header field values for certain header fields and/or different sets of header fields).
One of ordinary skill in the art would realize that the illustrated blocks in switch 110 are exemplary only. The ingress, queuing, and egress blocks are simplified for simplicity of the description. For example, although the figure shows only one entry point to the ingress parser and one exit point from the egress deparser, in some embodiments the input signals are received by many different input channels (e.g., 64 channels) and the output signals are sent out of the switch from different output channels (e.g., 64 channels). Additionally, although for the illustrated switch only one parser interface is shown for the ingress/egress pipeline 140, some embodiments employ numerous parser blocks (e.g., 16 parser blocks) that feed the match-action unit (MAU) in each pipeline.
The PHV provides the input data to the match tables of the MAU. In some embodiments the MAU 150 includes a set of match-action stages (e.g., 32 match-action stages in some embodiments), each of which matches a particular set of header fields against a match table and takes an action based on the result of the match (e.g., assigning the packet to an output port and queue, dropping the packet, modifying one or more of the header fields, etc.). The MAU 150 and its different match-action stages are described in more detail below by reference to
The output PHV is then handed to the deparser 155. In some embodiments, the deparser 155 reassembles the packet by putting back together the output PHV (that might or might not have been modified) that the deparser receives from the MAU 150 and the payload of the packet that the deparser receives directly from the parser 145 in some embodiments. The deparser then sends the packet out of the ingress/egress pipeline (to the queuing system 120 or out of the switch, depending on whether it is the deparser for the ingress pipeline or the egress pipeline).
As described above, in some embodiments, for each packet that is processed by the switch, the parser separates the packet header data (e.g., Ethernet, IPv4, TCP, etc.) from the payload 220 of the packet and determines which fields of each packet header (e.g., source port address of the TCP header, destination port address of the TCP header, etc.) may be processed by the MAU (i.e., might be matched against, or might be modified by an action). Packets may contain packet headers and a payload, though the divide between the two depends on how deep into the packet an element is inspecting. For instance, for a network element that only looks at and operates on the layer 2 (e.g., Ethernet) headers, the layer 3 (e.g., IPv4, IPv6, etc.), layer 4 (e.g., TCP, UDP, etc.) portions are part of the packet payload. However, for a network element that uses the layer 4 headers, the layer 2, layer 3, and layer 4 portions are all part of the headers, and the remainder of the packet is treated as payload. Each header (e.g., the layer 2 header, layer 3 header, layer 4 header, tunnel encapsulations, etc.) may include one or more header fields, which contain data values. For example, the source and destination IP addresses of an IP header (e.g., IPv4 header) are two different header fields of the IP header, while the source port and destination port addresses of a TCP header are two different header fields of the TCP header.
The term “packet” is used throughout this application to refer to a collection of bits in a particular format sent across a network. It should be understood that the term “packet” may be used herein to refer to various formatted collections of bits that may be sent across a network. A few examples of such formatted collections of bits are Ethernet frames, TCP segments, UDP datagrams, IP packets, etc.
While separating the different packet headers from the payload and separating the participating header fields from the nonparticipating header fields, the parser of some embodiments (1) populates the primary packet header vector (PPHV) 230 with only the participating header fields of different headers (i.e., the fields that may be processed by the MAU), and (2) populates the secondary packet header vector (SPHV) 240 with the nonparticipating fields of the different packet headers (i.e., the fields that will not be processed by the MAU).
Each of the PPHV and SPHV includes a set of registers that stores the packet header fields in some embodiments. For example, and as described above, the PPHV 230 of some embodiments includes a combination of different size registers (e.g., with a total capacity of 4 k bits) that hold the packet header field values that may be processed the MAU. Similarly, the SPHV 240 of some embodiments includes a set of the same or different size registers (e.g., shift registers, FIFO registers, etc.) for holding non-used header field values (e.g., with a total capacity of 2 k bits).
In some embodiments, the parser delivers the populated PPHV 230 to the MAU 150, which includes a set of match-action stages for matching the different header fields of the packet against the different match tables and applying the required actions to the packet by modifying the packet header data (e.g., assigning the packet to an output port and queue, sending the packet to a network controller, dropping the packet, modifying the header field values of the PPHV, etc.). The parser of some such embodiments also delivers the populated SPHV 240 directly to the deparser 155 along with the payload of the packet and without having the MAU 150 process the SPHV 240. By carrying the SPHV directly to the deparser without having the registers sent to the MAU, the wiring of the switch with respect to these packet header registers is greatly simplified.
In some embodiments, after the packet headers are processed by the MAU 150, the deparser 155 reassembles the packet with (1) the processed header data (that might or might not have been modified) which the deparser receives from the MAU 150, (2) the unprocessed header data stored in the SPHV 240 that the deparser receives from the parser 145, and (3) the payload 220 of the packet that the deparser also receives from the parser 145. As described before, after reassembling the packet, if the packet is reassembled by an ingress deparser, the deparser sends the packet to a queuing system to be subsequently forwarded to the egress pipeline of the switch. On the other hand, if the packet is reassembled by an egress deparser, the deparser sends the packet (with a header that might or might not have been modified) out of the switch. In some embodiments, the deparser recognizes the location in the reconstructed packet at which to place each value from the different registers (as an example, the 13 bits of the IPv4 fragment offset field that might be located in register X of the SPHV are inserted directly after the 3 bits of the flags field from register Y of the SPHV and directly before the 8 bits of the time to live field from register N of the PPHV).
As described above, the parser 310 receives a packet (e.g., through a set of input modules of the switch) and extracts the packet headers (e.g., Ethernet header, IPv4 header, IPv6 header, TCP header, UPD header, tunnel encapsulation headers, etc.) from the body of the packet. The parser 310 then separates the header field values that may be processed by the MAU from the rest of the header field values in each packet header. As stated above, the header fields of a packet header are the different segments of the packet header, each of which stores a particular value representing a particular piece of data. For example, an IPv4 packet header includes a source IP address header field, a destination IP address header field, an IPv4 identification field header field, a time-to-live header field, etc.
The parser of some embodiments determines which header fields are participating header fields (i.e., the fields that may be processed by the MAU) and which header fields are non-participating header fields based on configuration data that the parser receives from a configurator module in the control plane. In some such embodiments, the configurator module receives the configuration data from a compiler (also part of the control plane) which generates the configuration data based on a set of instructions that the compiler receives (e.g., from a user designing the functionality of the hardware switch). The compiler and configurator modules of some embodiments are described in more detail below by reference to
While the parser 310 separates the header fields that may be processed by the MAU from the rest of the header fields of the different packet headers, the parser stores the participating header fields in the PPHV (in different registers of the PPHV) and delivers the PPHV to the MAU for further processing of the header data. As described above, the MAU of some embodiments includes a set of different stages, each of which is configured to process a particular set of header fields of the PPHV. In some embodiments, each of these stages is reconfigurable by a controller that is responsible for configuring (and reconfiguring) the stages of the match-action units of the hardware switch to match against various different packet header fields and
In some embodiments, the output PPHV from the parser 310 is delivered to both the Xbar 315 and the VLIW action engine 330. The Xbar 315 of each stage, in some embodiments, includes a set of one or more crossbars (e.g., two crossbars) that identifies which field or fields of the PPHV are used by the match tables of the corresponding stage of the MAU, and delivers the identified fields to the exact match tables and ternary match tables of the stage. For instance if the match tables of a particular stage are configured to match against a source IP address field that is carried by one or more PPHV registers, the Xbar 315 of that particular stage takes the IP source field from the PPHV register(s) and delivers the field to the match tables. In some embodiments, the Xbar 315 operates at a bit level. That is, a particular header field that contains 20 bits might be carried by a 16-bit register and a portion of an 8-bit register of the PPHV. The Xbar of some such embodiments, therefore, passes only 20 bits of the data that is carried by the combination of the 16-bit register and the 8-bit register to its corresponding match tables.
As illustrated in
In some embodiments the ternary match table stores packet header data that can include ternary bits (i.e., bits with values of 0, 1 or wildcard). Wildcarding the bits allow a single table entry to match a wide variety of packet header fields. The exact match table of some embodiments does not allow any wildcarding, hence the packets must exactly match the table entries. When the header field is matched against an entry of a match table (a ternary table or an exact match table), several pointers which together contain the required information to perform the desired actions are retrieved from that entry of the match table. The information, in some embodiments, includes, among other data, an instruction memory address for the action engine 320 and an action memory address and size. The desired actions include simple actions such as setting a field in the PPHV to a particular value or dropping a packet, as well as complex operations, such as adding encapsulations to the packet (e.g., Provider Backbone Bridges (PBB) encapsulation, GRE or GENEVE tunneling, etc.).
In some embodiments, the VLIW action engine 330 includes different action operations that may receive their sources from packet header fields (which is why a copy of the PPHV registers are directly delivered to the action unit), or from an action memory (not shown). An action indicated by a match may be simple and require only a small amount of data from the action memory or complex and require a large amount of data. When the action engine 330 receives the action data (from the action memory or the PPHV), the action engine takes the required action which may include modifying a header field in the PPHV (e.g., to decrement the TTL field of the IP header, change the address of the packet, etc., or taking another action such as assigning the packet to an output port and/or queue, sending the packet to the controller, dropping the packet, etc. After the required action is taken (e.g., when a match is found) in each stage of the MAU, the PPHV (as modified by the action, if such modifications are performed) is delivered to the next stage of the MAU for further processing. In some embodiments, each successive PPHV that includes the packet header data of one packet progresses through the pipeline of match-action stages one clock cycle behind the previous PPHV.
The last match-action stage of the MAU, after processing the PPHV, delivers the processed PPHV to the deparser 360. As described above, after receiving the PPHV of a particular packet from the MAU, the deparser 360 of some embodiments reassembles the packet by putting together the processed header fields that are received from the MAU, with the unprocessed header fields that are received directly from the parser 310 in the SPHV 355 and the payload 350 of the packet that is also received directly from the parser 310. The packet is then either sent out of the switch (if the deparser is an egress deparser), or sent to the queuing system (if the deparser is an ingress deparser) for further processing by the egress pipeline of the switch.
The illustrated example shows that a packet header 415 (e.g., an Ethernet header, IPv4 header, etc.) of the packet 410 includes several participating header fields 450 that the MAU is configured (e.g., by a configurator module of the control plane) to potentially process. At the same time, the packet header 415 also includes several other non-participating header fields 460 that the MAU is not configured to process. In some embodiments, when the parser 420 extracts a particular packet header from the packet 410, the parser must extract the entire contiguous packet header at once (i.e., the parser cannot leave certain fields of a packet header in the payload while placing the other fields of the packet header in the PHV). Because the different participating header fields of the packet header are often not placed next to each other in the packet header (as illustrated in the figure), the parser of some embodiments separates these participating header fields from nonparticipating fields during extraction of the packet header.
For example, the MAU might be configured to process only a particular set of header fields in a UDP packet header, which may not be the first two header fields of the packet header (i.e., the source and destination ports). In such a case, the parser locates the particular header fields in the set, pulls these fields out of the packet header, and stores the header fields in the PPHV. However, the other nonparticipating header fields that are also extracted from the packet have to be dealt with as well. Therefore, in some embodiments, the parser 420 looks at each header field in the packet header and determines whether the identified header field might be processed by the MAU or will definitely not be processed by the MAU. Though not the case in this example, in some embodiments none of the fields of a packet header might be placed in the PPHV, but the parser would extract these fields and place them in the SPHV in order to continue deeper into the packet and place the fields of a higher-layer packet into the PPHV.
If the parser 420 determines that the header field is one of the participating header fields, the parser stores the header field in the PPHV 430 (i.e., in a particular set of registers of the PPHV 430 designated for that header field). On the other hand, if the parser 420 determines that the identified header field is not supposed to be processed by the MAU, the parser stores the header field in the SPHV 440 to be subsequently sent directly to the deparser (not shown) of the pipeline without getting processed.
The parser of some embodiments determines which fields of each packet header may be processed and which fields will not be processed by the MAU, based on the information the parser receives from the packet itself (e.g., by one or more particular packet header of the packet), and based on the configuration data received from a compiler in the control plane. In some embodiments, the compiler receives the data required for configuring the pipeline (e.g., through a programing language code), generates a set of configuration data, and distributes the generated data to a configurator module (also in the control plane). The configurator module then distributes the configuration data to both parser and MAU of the pipeline in the switch (e.g., at run-time or during setup time).
In some embodiments, the compiler 520 generates configuration data for the hardware switch based on a switch configuration received by the compiler 520 (e.g., through code written by a user, such as P4 code for designing switch operations). The configuration data specifies how to program the match-action stages of the MAU 540 to implement the switch configuration specified by the received configuration code, as well as how to program the extractor state machine 560 of the parser to extract the packet header fields correctly and to place the packet header fields into the appropriate PPHV or SPHV registers.
The compiler 520 passes the configuration data to the configurator 530, which provides the configuration data to the MAU 540 so that the MAU can implement the appropriate switch configuration. In addition, the configurator 530 provides the parser configuration data generated by the compiler 520 to the extractor state machine 560 so that the extractor state machine can extract header fields from the packets into the registers of the PPHV and the SPHV.
The extractor state machine 560 receives the packet 585 and (i) separates the packet headers into the PPHV 570 and the SPHV 575 and (ii) separates out the payload 580 of the packet. In some embodiments, the extractor state machine begins at the front of the packet (i.e., the outermost headers) and works inward, extracting each packet header field into either the PPHV or the SPHV. For certain header fields, the extractor state machine looks at the value and compares the value to configuration entries (e.g., TCAM entries), which specify how the next set of packet header fields should be extracted.
The extractor state machine 560 follows a parse graph that specifies numerous states at which a particular packet header field is extracted into either the PPHV or the SPHV, as well as what state of the parse graph to proceed to next. That is, in some embodiments each state specifies which bits of the header to extract for a particular header field, which register(s) of the PPHV or SPHV to put those bits into, and to which state to proceed next. The extractor state machine 560 of some embodiments may also read the data of certain header fields in order to determine which path to take through the set of states of the parse graph. For example, the EtherType field of an Ethernet header indicates the type of protocol encapsulated by the Ethernet header (e.g., IPv4, IPv6, ARP, etc.). The different fields of these protocols will be formatted differently, so for the extractor state machine 560 to properly identify the next state(s) in the parse graph, it needs to know the EtherType value. Similarly, the protocol field of an IPv4 header specifies the transport layer protocol (e.g., TCP, UDP, etc.), which will determine how those fields are extracted.
In some embodiments, the parse graph is implemented in the parser 530 as a set of entries in TCAMs that the extractor state machine matches. The packet header is received as a set of bits stored in, e.g., a buffer, and at any time during the extraction process a pointer points to a particular location in the buffer. The TCAM entries of the parse graph of some embodiments specify which type of header is next based on the value of certain fields of a current header (e.g., the EtherType field of an Ethernet header, the protocol field of an IPv4 header, etc.), and how to extract the header fields of the next header. This entails specifying how many bits to extract for each header field in the next header, to where in the sets of registers of the PPHV and the SPHV each header field should be extracted, and to where in the buffer to move the pointer for the next header field. As mentioned, for certain fields, the header field value is matched against the TCAM entries to determine the next state or set of states based on the determination as to what type of packet headers are contained in the packet.
The parser configuration specifies which packet headers will be extracted into the PPHV and which packet headers are extracted into the SPHV. In some embodiments, any field that is either (i) used as a match field of any match entry in the MAU and/or (ii) modified by any action entry in the MAU is extracted into the PPHV, with only the header fields that are not involved in any way with the MAU extracted into the SPHV. Thus, for some packets, some of the header fields in the PPHV will not actually be used or modified by the MAU (especially if one of the earlier stages instructs the switch to drop the packet). Identifying all of the fields that will be used on a packet-by-packet basis would effectively entail performing the match-action pipeline (because the values of the header fields would have to be considered for each stage to determine which actions to take, and the actions performed to find the new values for the header fields in order to identify which fields are considered at subsequent stages). Thus, the extractor state machine 560 of some embodiments only reads and matches against the values for certain header fields that identify the structure of the subsequent packet headers, so that the subsequent packet headers can be extracted properly according to the parse graph.
Separating the fields that may be processed by the MAU from the rest of the fields in each packet header improves the overall efficiency of the switch in many ways. For instance, this separation helps avoid wasting the valuable resources of the MAU by enabling these resources to only (or primarily) process data that is actually needed for making the packet processing determinations. For example, a TCP packet header typically has a minimum length of five words (twenty bytes). In many cases, the MAU of the pipeline processes only four bytes of the TCP header bytes (i.e., the source and destination port addresses) and the rest of the fields in the TCP header (sixteen bytes) are not used by any of the stages of the MAU. In such cases, by separating the unused data from useful data, the parser does not waste any of the valuable resources of the MAU to process the other sixteen bytes of the TCP header.
In addition, separating the PPHV form the SPHV enables the parser to parse deeper into packets while sending the same amount of data to the MAU (via the PPHV). While using a single PPHV of a fixed size only allows the parser to extract the packet headers up to a certain point (the size of the PPHV), sending some of the unused fields into the SPHV allows the PPHV to carry only the more useful fields, and include deeper packet headers. For example, newer tunneling protocols such as GENEVE add variable length option fields to the packet header, and may be quite long. Similarly, packets sent using multi-layer tunneling may have significant amounts of packet header data that may need to be extracted in order to reach the layer 4 (e.g., TCP) data. By sending the fields that will not be processed by the MAU to the SPHV, the PPHV can include packet header fields that are located deeper into the packet, without sending additional data to the MAU.
The process 600 initiates by receiving (at 610) a packet header. In some embodiments the process receives the packet header from a packet receiver module of the parser, such as the packet receiver 550 of
The process then extracts (at 620) the next header field of the received packet header. As described above, in some embodiments the extractor state machine points to a particular location in a buffer that holds the packet header, and the parser configuration (implementing the parse graph) identifies the length of the next packet header, starting from that particular location. Thus, to extract the next header field, the process extracts the specified next number of bits (and, in some embodiments, moves the pointer to the new location after the last extracted bit).
The process then determines (at 630) whether the extracted field may be processed by any of the match-action stages of the MAU. When the process determines that the extracted field is a participating header field that could be used at some point during the processing of the PPHV through the different stages of the MAU, the process identifies (at 640) a container (e.g., one or more registers of the PPHV) in the PPHV and stores the extracted header field in the identified container of the PPHV. On the other hand, if the process determines that the extracted field is a nonparticipating header field, which will not processed by any match-action stage of the MAU, the process identifies (at 650) a container (e.g., one or more registers of the SPHV) in the SPHV and stores the extracted header field in the identified container of the SPHV.
As described above, in some embodiments operations 620-640 or 620-650 are all performed as a single operation. Specifically, the determination as to whether a particular field may be processed by the MAU is made during the generation of the parse graph, (according to the configuration data) and embedded in the parse graph based on whether the parse graph instructions specify to store the particular header field in the PPHV or the SPHV. Thus, the extractor state machine of some embodiments extracts the header field (i.e., the next X bits of the packet header) into a specific register of either the PPHV or the SPHV, without performing any specific analysis at packet processing time as to whether the header field is a participating or non-participating header field.
After storing the extracted header field in one of the PPHV or the SPHV, the process of some embodiments determines (at 660) whether any additional header fields remain to be extracted. In some embodiments, the parse graph proceeds to the next state according to the instructions of the previous state, and each subsequent state identifies the next set of bits (i.e., the next header field) to extract. Upon reaching the last field to extract, the parse graph state specifies that the extraction process is done, at which point the process ends. Thus, when the parse graph state moves the pointer and specifies the next set of bits to extract, the process 600 returns to 620.
One of ordinary skill in the art will recognize that the specific operations of the process 600 may not be performed in the exact order shown and described above. Additionally, the specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments. For instance, as mentioned above, in some embodiments the process actually extracts the field directly into one of the containers of the PPHV or the SPHV, with the determination at 630 being conceptual. In other embodiments, the process 600 identifies the packet headers first and then performs the extraction of the header fields in the identified packet headers. More specifically, in some such embodiments, the process first extracts the first packet header (e.g., based on the configuration data and the parse graph) and after identifying the packet header, extracts the different header fields of the packet header and stores them either in the PPHV or the SPHV. Furthermore, the process could be implemented using several sub-processes, or as part of a larger macro process.
As mentioned, the compiler of some embodiments generates the configuration data for the different switch elements including both the MAU and the parser. The MAU configuration data specifies entries for match and action tables (implemented in TCAMs, or a combination of TCAMs and RAM) of the packet processing pipelines that enable the switch to modify, forward, etc. packets that it receives. The parser configuration data specifies how the parser processes different types of packets, to extract header fields correctly, and to place the extracted header fields into the appropriate containers of the PPHV and SPHV.
The control and table flow graph generator 710 uses the received code to generate the possible flows through a set of match and action tables that the switch will implement. In some embodiments, the flow graph(s) may be linear or branched, depending on the nature of the code received by the compiler. As shown in the figure, the flow graph generator 710 outputs a flow graph 730, that includes numerous match-action stages. Each match-action stage includes a set of match entries that specify one or more packet header fields (or other data that is not actually part of the packet header, such as ingress or egress ports) over which packets will be matched, as well as corresponding action entries that specify actions to take when a packet matches the associated match entry. These actions may include modifying certain packet header fields, in addition to other actions (e.g., dropping the packet, modifying non-header field data about the packet). The MAU configuration generator 715 uses the control and table flow graphs to generate the MAU configuration entries, in some embodiments.
The parse graph generator 720 of some embodiments uses the received code to generate a parse graph specifying the possible paths that a parser can take to parse a received packet. Though shown here as generated from the code, in some embodiments the parse graph is information stored with the compiler, which specifies how to parse any packet. In other embodiments, some of the information (how any packet might be parsed) is stored with the compiler, but a parse graph for the particular switch is generated based on information in the code that indicates what types of packet may actually be processed by the switch (e.g., if all packets will only have Ethernet as the layer 2 protocol).
As shown, the parse graph generator 720 outputs a parse graph 735. The parse graph, initially, conceptually describes the different types of packet headers that could be received by the switch, and the order in which those packet headers are arranged. The figure also shows a portion of this parse graph, including the Ethernet header. As shown, the parse graph 735 specifies (i) how to parse the current header into fields and (ii) how to proceed from the current header to the next header, depending on the value of one or more of the fields of the current header. For the Ethernet header, the first eight bytes are the preamble (and start frame delimiter), the next twelve bytes are the destination MAC address and the source MAC address, and the last two bytes are the EtherType field. In addition, the edges of the parse graph exiting the Ethernet header node are dependent on the value of the EtherType field. For instance, if the EtherType field value is 800, then the next header is IPv4 (with the IPv4 node of the parse graph specifying how to parse the IPv4 header); if the EtherType field value is 806, then the next header is ARP, etc. The parse graph 735 continues in this manner until reaching a point at which additional data will not be parsed, and this additional data is treated as the payload. In some embodiments, the parse graph (prior to being converted into parser configuration data) continues through the entire packet.
The parser configuration generator 725 uses the parse graph 735 as well as the control and table flow graphs 730 to generate configuration data used to configure the parser in the hardware switch pipeline. The parser configuration data, in some embodiments, includes TCAM entries for each edge of the parse graph that is relevant to the switch (i.e., for each packet header that the switch might need to process). Each of these entries matches over the packet header field values in the current packet header that specify the type of the next packet header (e.g., the EtherType field, the protocol field of an IP packet, etc.). In some embodiments, the TCAM entries point to actions (e.g., in RAM) that specify how to parse the subsequent header (e.g., how to parse the various different fields of an IPv4 packet, an ARP packet, etc.).
In addition, the parser configuration generator 725 determines which fields of each packet header might actually be used in the match-action unit based on the flow graphs 730. In some embodiments, any packet header field that appears in at least one match entry or is modified by at least one action entry is marked for possible use. While the switch will probably not use the field for every packet containing such a header field, it might for at least some such packets (and for certain fields, the switch may use the field for almost every packet that contains the field). Some embodiments annotate the parse graph to identify the participating and non-participating header fields. This information is then included in the configuration data for the parser, which specifies to send the participating header fields to particular registers of the PPHV and the non-participating header fields to particular registers of the SPHV. In some embodiments, the configuration data also specifies when to stop parsing the packet headers and treat the remainder of the packet as payload. This decision may be made based on the amount of data already stored in the PHVs for the current traversal through the nodes of the parse graph, or because the end of relevant packet headers for the switch have been reached (e.g., the end of the innermost layer 4 headers).
The process then generates (at 810) a parse graph from the code and/or pre-defined packet specifications. In some embodiments the parse graph is information stored with the compiler, which specifies how to parse any packet. In other embodiments, some of the information (how any packet might be parsed) is stored with the compiler, but a parse graph for the particular switch is generated based on information in the code that indicates what types of packets may actually be processed by the switch (e.g., if all packets will only have Ethernet as the layer 2 protocol).
The parse graph of some embodiments conceptually describes the different types of packet headers that could be received by the switch, and the order in which those packet headers are arranged. Each node in the parse graph represents a packet header, and the parse graph specifies (i) how to parse the header into packet header fields and (ii) how to proceed from the current header to the next header, depending on the value of one or more of the fields of the current header. For the Ethernet header, for example, the first eight bytes are the preamble (and start frame delimiter), the next twelve bytes are the destination MAC address and the source MAC address, and the last two bytes are the EtherType field. The edges of the parse graph exiting each node are dependent on the value of one or more of the field values of the current field.
The process 800 also generates (at 815) control flow and table flow graphs for defining the match-action stages of the switch. In some embodiments, the flow graph(s) may be linear or branched, depending on the nature of the code received by the compiler. Each match-action stage in the table flow graph includes a set of match entries that specify one or more packet header fields (or other data that is not actually part of the packet header, such as ingress or egress ports) over which packets will be matched, as well as corresponding action entries that specify actions to take when a packet matches the associated match entry. These actions may include modifying certain packet header fields, in addition to other actions (e.g., dropping the packet, modifying non-header field data about the packet).
Based on the control and table flow graphs, the process 800 determines (at 820) whether each packet header field specified in the parse graph participates in the match-action stages. The process annotates (at 825) the parse graph with whether each header field will be placed into the PPHV or the SPHV. In some embodiments, any packet header field that appears in at least one match entry or is modified by at least one action entry is marked for possible use. While the switch will probably not use the field for every packet containing such a header field, it might for at least some such packets (and for certain fields, the switch may use the field for almost every packet that contains the field). Participating packet header fields are marked to be sent to the PPHV, while non-participating packet header fields are marked to be sent to the SPHV.
Finally, the process 800 generates (at 830) configuration entries for the parser based on the annotated parse graph. The parser configuration data, in some embodiments, includes TCAM entries for each edge of the parse graph that is relevant to the switch (i.e., for each packet header that the switch might need to process). Each of these entries matches over the packet header field values in the current packet header that specify the type of the next packet header (e.g., the EtherType field, the protocol field of an IP packet, etc.). In some embodiments, the TCAM entries point to actions (e.g., in RAM) that specify how to parse the subsequent header (e.g., how to parse the various different fields of an IPv4 packet, an ARP packet, etc.).
The configuration data for the parser also specifies to send the participating header fields to particular registers of the PPHV and the non-participating header fields to particular registers of the SPHV. In some embodiments, the configuration data also specifies when to stop parsing the packet headers and treat the remainder of the packet as payload. This decision may be made based on the amount of data already stored in the PHVs for the current traversal through the nodes of the parse graph, or because the end of relevant packet headers for the switch have been reached (e.g., the end of the innermost layer 4 headers).
Some of the above-described features and applications are implemented as software processes that are specified as a set of instructions recorded on a computer readable storage medium (also referred to as computer readable medium). When these instructions are executed by one or more processing unit(s) (e.g., one or more processors, cores of processors, or other processing units), they cause the processing unit(s) to perform the actions indicated in the instructions. Examples of computer readable media include, but are not limited to, CD-ROMs, flash drives, RAM chips, hard drives, EPROMs, etc. The computer readable media does not include carrier waves and electronic signals passing wirelessly or over wired connections.
In this specification, the term “software” is meant to include firmware residing in read-only memory or applications stored in magnetic storage, which can be read into memory for processing by a processor. Also, in some embodiments, multiple software inventions can be implemented as sub-parts of a larger program while remaining distinct software inventions. In some embodiments, multiple software inventions can also be implemented as separate programs. Finally, any combination of separate programs that together implement a software invention described here is within the scope of the invention. In some embodiments, the software programs, when installed to operate on one or more electronic systems, define one or more specific machine implementations that execute and perform the operations of the software programs.
The bus 905 collectively represents all system, peripheral, and chipset buses that communicatively connect the numerous internal devices of the electronic system 900. For instance, the bus 905 communicatively connects the processing unit(s) 910 with the read-only memory 930, the system memory 925, and the permanent storage device 935.
From these various memory units, the processing unit(s) 910 retrieves instructions to execute and data to process in order to execute the processes of the invention. The processing unit(s) may be a single processor or a multi-core processor in different embodiments.
The read-only-memory (ROM) 930 stores static data and instructions that are needed by the processing unit(s) 910 and other modules of the electronic system. The permanent storage device 935, on the other hand, is a read-and-write memory device. This device is a non-volatile memory unit that stores instructions and data even when the electronic system 900 is off. Some embodiments of the invention use a mass-storage device (such as a magnetic or optical disk and its corresponding disk drive) as the permanent storage device 935.
Other embodiments use a removable storage device (such as a floppy disk, flash drive, etc.) as the permanent storage device. Like the permanent storage device 935, the system memory 925 is a read-and-write memory device. However, unlike storage device 935, the system memory is a volatile read-and-write memory, such a random access memory. The system memory stores some of the instructions and data that the processor needs at runtime. In some embodiments, the invention's processes are stored in the system memory 925, the permanent storage device 935, and/or the read-only memory 930. From these various memory units, the processing unit(s) 910 retrieves instructions to execute and data to process in order to execute the processes of some embodiments.
The bus 905 also connects to the input and output devices 940 and 945. The input devices enable the user to communicate information and select commands to the electronic system. The input devices 940 include alphanumeric keyboards and pointing devices (also called “cursor control devices”). The output devices 945 display images generated by the electronic system. The output devices include printers and display devices, such as cathode ray tubes (CRT) or liquid crystal displays (LCD). Some embodiments include devices such as a touchscreen that function as both input and output devices.
Finally, as shown in
Some embodiments include electronic components, such as microprocessors, storage and memory that store computer program instructions in a machine-readable or computer-readable medium (alternatively referred to as computer-readable storage media, machine-readable media, or machine-readable storage media). Some examples of such computer-readable media include RAM, ROM, read-only compact discs (CD-ROM), recordable compact discs (CD-R), rewritable compact discs (CD-RW), read-only digital versatile discs (e.g., DVD-ROM, dual-layer DVD-ROM), a variety of recordable/rewritable DVDs (e.g., DVD-RAM, DVD-RW, DVD+RW, etc.), flash memory (e.g., SD cards, mini-SD cards, micro-SD cards, etc.), magnetic and/or solid state hard drives, read-only and recordable Blu-Ray® discs, ultra density optical discs, any other optical or magnetic media, and floppy disks. The computer-readable media may store a computer program that is executable by at least one processing unit and includes sets of instructions for performing various operations. Examples of computer programs or computer code include machine code, such as is produced by a compiler, and files including higher-level code that are executed by a computer, an electronic component, or a microprocessor using an interpreter.
While the above discussion primarily refers to microprocessor or multi-core processors that execute software, some embodiments are performed by one or more integrated circuits, such as application specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs). In some embodiments, such integrated circuits execute instructions that are stored on the circuit itself.
As used in this specification, the terms “computer”, “server”, “processor”, and “memory” all refer to electronic or other technological devices. These terms exclude people or groups of people. For the purposes of the specification, the terms display or displaying means displaying on an electronic device. As used in this specification, the terms “computer readable medium,” “computer readable media,” and “machine readable medium” are entirely restricted to tangible, physical objects that store information in a form that is readable by a computer. These terms exclude any wireless signals, wired download signals, and any other ephemeral signals.
While the invention has been described with reference to numerous specific details, one of ordinary skill in the art will recognize that the invention can be embodied in other specific forms without departing from the spirit of the invention. In addition, a number of the figures (including
This application is a continuation of U.S. patent application Ser. No. 16/573,847, filed Sep. 17, 2019, which in turn is a continuation of and claims priority to U.S. patent application Ser. No. 15/729,555, filed Oct. 10, 2017, now issued as U.S. Pat. No. 10,432,527, which in turn is a continuation of and claims priority to U.S. patent application Ser. No. 14/836,850, filed Aug. 26, 2015, now issued as U.S. Pat. No. 9,825,862, all of which are incorporated herein by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5243596 | Port et al. | Sep 1993 | A |
| 5642483 | Topper | Jun 1997 | A |
| 5784003 | Dahlgren | Jul 1998 | A |
| 6157955 | Narad et al. | Dec 2000 | A |
| 6442172 | Wallner et al. | Aug 2002 | B1 |
| 6453360 | Muller et al. | Sep 2002 | B1 |
| 6735679 | Herbst et al. | May 2004 | B1 |
| 6836483 | Lee | Dec 2004 | B1 |
| 6948099 | Tallam | Sep 2005 | B1 |
| 6976149 | Brandt et al. | Dec 2005 | B1 |
| 6980552 | Belz et al. | Dec 2005 | B1 |
| 7046685 | Matsuoka et al. | May 2006 | B1 |
| 7177276 | Epps et al. | Feb 2007 | B1 |
| 7203740 | Putzolu et al. | Apr 2007 | B1 |
| 7492714 | Liao et al. | Feb 2009 | B1 |
| 7499941 | Michaeli et al. | Mar 2009 | B2 |
| 7539777 | Aitken | May 2009 | B1 |
| 7643486 | Belz et al. | Jan 2010 | B2 |
| 7826470 | Aloni et al. | Nov 2010 | B1 |
| 7872774 | Okamoto | Jan 2011 | B2 |
| 7873959 | Zhu et al. | Jan 2011 | B2 |
| 7889750 | Parker | Feb 2011 | B1 |
| 7961734 | Panwar et al. | Jun 2011 | B2 |
| 8077611 | Bettink et al. | Dec 2011 | B2 |
| 8155135 | Aloni et al. | Apr 2012 | B2 |
| 8514855 | Robertson et al. | Aug 2013 | B1 |
| 8527613 | Malone et al. | Sep 2013 | B2 |
| 8638793 | Ben-Mayor et al. | Jan 2014 | B1 |
| 8693374 | Murphy et al. | Apr 2014 | B1 |
| 8738860 | Griffin et al. | May 2014 | B1 |
| 8788512 | Asaad et al. | Jul 2014 | B2 |
| 8971338 | Mishra et al. | Mar 2015 | B2 |
| 9049153 | Casado et al. | Jun 2015 | B2 |
| 9049271 | Hobbs et al. | Jun 2015 | B1 |
| 9055004 | Edsall et al. | Jun 2015 | B2 |
| 9055114 | Talaski | Jun 2015 | B1 |
| 9112818 | Arad et al. | Aug 2015 | B1 |
| 9124644 | Patel et al. | Sep 2015 | B2 |
| 9213537 | Bandakka et al. | Dec 2015 | B2 |
| 9258224 | Bosshart et al. | Feb 2016 | B2 |
| 9276846 | Goyal et al. | Mar 2016 | B2 |
| 9294386 | Narad | Mar 2016 | B2 |
| 9298446 | Chang et al. | Mar 2016 | B2 |
| 9450817 | Bahadur et al. | Sep 2016 | B1 |
| 9467363 | Gao | Oct 2016 | B2 |
| 9686209 | Arad et al. | Jun 2017 | B1 |
| 9692690 | Joshi et al. | Jun 2017 | B2 |
| 9712439 | Bosshart et al. | Jul 2017 | B2 |
| 9755932 | Godbole et al. | Sep 2017 | B1 |
| 9825862 | Bosshart | Nov 2017 | B2 |
| 9826071 | Bosshart | Nov 2017 | B2 |
| 9838268 | Mattson | Dec 2017 | B1 |
| 9891898 | Tonsing | Feb 2018 | B1 |
| 9912610 | Bosshart et al. | Mar 2018 | B2 |
| 9923816 | Kim et al. | Mar 2018 | B2 |
| 9960956 | Johnson et al. | May 2018 | B1 |
| 10009276 | Bosshart et al. | Jun 2018 | B2 |
| 10015048 | Gasparakis et al. | Jul 2018 | B2 |
| 10044646 | Detwiler | Aug 2018 | B1 |
| 10091137 | Tran et al. | Oct 2018 | B2 |
| 10135734 | Singh et al. | Nov 2018 | B1 |
| 10225381 | Bosshart | Mar 2019 | B1 |
| 10291555 | K et al. | May 2019 | B2 |
| 10341242 | Srinivasan et al. | Jul 2019 | B2 |
| 10361914 | Gasparakis et al. | Jul 2019 | B2 |
| 10412018 | Feng et al. | Sep 2019 | B1 |
| 10419242 | Tonsing et al. | Sep 2019 | B1 |
| 10419366 | Kim et al. | Sep 2019 | B1 |
| 10432527 | Bosshart | Oct 2019 | B1 |
| 10686735 | Watson | Jun 2020 | B1 |
| 10892939 | Castaldelli et al. | Jan 2021 | B2 |
| 20010043611 | Kadambi et al. | Nov 2001 | A1 |
| 20020001356 | Shenoi | Jan 2002 | A1 |
| 20020136163 | Kawakami et al. | Sep 2002 | A1 |
| 20020172210 | Wolrich et al. | Nov 2002 | A1 |
| 20030009466 | Ta et al. | Jan 2003 | A1 |
| 20030043825 | Magnussen et al. | Mar 2003 | A1 |
| 20030046414 | Pettyjohn et al. | Mar 2003 | A1 |
| 20030046429 | Sonksen | Mar 2003 | A1 |
| 20030063345 | Fossum et al. | Apr 2003 | A1 |
| 20030107996 | Black et al. | Jun 2003 | A1 |
| 20030118022 | Kulkarni et al. | Jun 2003 | A1 |
| 20030147401 | Kyronaho et al. | Aug 2003 | A1 |
| 20030154358 | Seong et al. | Aug 2003 | A1 |
| 20030167373 | Winters et al. | Sep 2003 | A1 |
| 20030219026 | Sun et al. | Nov 2003 | A1 |
| 20040024894 | Osman et al. | Feb 2004 | A1 |
| 20040031029 | Lee et al. | Feb 2004 | A1 |
| 20040042477 | Bitar et al. | Mar 2004 | A1 |
| 20040105384 | Gallezot et al. | Jun 2004 | A1 |
| 20040123220 | Johnson et al. | Jun 2004 | A1 |
| 20040165588 | Pandya | Aug 2004 | A1 |
| 20040213156 | Smallwood et al. | Oct 2004 | A1 |
| 20050013251 | Wang et al. | Jan 2005 | A1 |
| 20050041590 | Olakangil et al. | Feb 2005 | A1 |
| 20050060428 | Corl et al. | Mar 2005 | A1 |
| 20050078651 | Lee et al. | Apr 2005 | A1 |
| 20050086353 | Shirakawa et al. | Apr 2005 | A1 |
| 20050108518 | Pandya | May 2005 | A1 |
| 20050120173 | Minowa | Jun 2005 | A1 |
| 20050129059 | Jiang et al. | Jun 2005 | A1 |
| 20050149823 | Lee | Jul 2005 | A1 |
| 20050198531 | Kaniz et al. | Sep 2005 | A1 |
| 20050243852 | Bitar et al. | Nov 2005 | A1 |
| 20060002386 | Yik et al. | Jan 2006 | A1 |
| 20060039374 | Belz et al. | Feb 2006 | A1 |
| 20060050690 | Epps et al. | Mar 2006 | A1 |
| 20060072480 | Deval et al. | Apr 2006 | A1 |
| 20060092857 | Ansari et al. | May 2006 | A1 |
| 20060114895 | Anand | Jun 2006 | A1 |
| 20060114914 | Anand et al. | Jun 2006 | A1 |
| 20060117126 | Leung et al. | Jun 2006 | A1 |
| 20060174242 | Zhu et al. | Aug 2006 | A1 |
| 20060277346 | Doak et al. | Dec 2006 | A1 |
| 20070008985 | Lakshmanamurthy et al. | Jan 2007 | A1 |
| 20070050426 | Dubal et al. | Mar 2007 | A1 |
| 20070055664 | Michaeli et al. | Mar 2007 | A1 |
| 20070104102 | Opsasnick | May 2007 | A1 |
| 20070104211 | Opsasnick | May 2007 | A1 |
| 20070153796 | Kesavan et al. | Jul 2007 | A1 |
| 20070195761 | Tatar et al. | Aug 2007 | A1 |
| 20070195773 | Tatar et al. | Aug 2007 | A1 |
| 20070208876 | Davis | Sep 2007 | A1 |
| 20070230493 | Dravida et al. | Oct 2007 | A1 |
| 20070236734 | Okamoto | Oct 2007 | A1 |
| 20070280277 | Lund et al. | Dec 2007 | A1 |
| 20080130670 | Kim et al. | Jun 2008 | A1 |
| 20080144662 | Marcondes et al. | Jun 2008 | A1 |
| 20080175449 | Fang et al. | Jul 2008 | A1 |
| 20090006605 | Chen et al. | Jan 2009 | A1 |
| 20090096797 | Du et al. | Apr 2009 | A1 |
| 20090106523 | Steiss | Apr 2009 | A1 |
| 20090180475 | Hashimoto | Jul 2009 | A1 |
| 20100085891 | Kind et al. | Apr 2010 | A1 |
| 20100128735 | Lipschutz | May 2010 | A1 |
| 20100135158 | Adams | Jun 2010 | A1 |
| 20100140364 | Nordberg et al. | Jun 2010 | A1 |
| 20100145475 | Bartels et al. | Jun 2010 | A1 |
| 20100150164 | Ma | Jun 2010 | A1 |
| 20100182920 | Matsuoka | Jul 2010 | A1 |
| 20100191951 | Malone et al. | Jul 2010 | A1 |
| 20100228733 | Harrison et al. | Sep 2010 | A1 |
| 20100238812 | Boutros et al. | Sep 2010 | A1 |
| 20100312941 | Aloni et al. | Dec 2010 | A1 |
| 20110149960 | Gutierrez | Jun 2011 | A1 |
| 20120159235 | Suganthi et al. | Jun 2012 | A1 |
| 20120170585 | Mehra et al. | Jul 2012 | A1 |
| 20120173661 | Mahaffey et al. | Jul 2012 | A1 |
| 20120177047 | Roitshtein | Jul 2012 | A1 |
| 20120284438 | Zievers | Nov 2012 | A1 |
| 20130003556 | Boden et al. | Jan 2013 | A1 |
| 20130028265 | Ronchetti et al. | Jan 2013 | A1 |
| 20130100951 | Ishizuka | Apr 2013 | A1 |
| 20130108264 | Deruijter et al. | May 2013 | A1 |
| 20130163426 | Beliveau | Jun 2013 | A1 |
| 20130163427 | Beliveau | Jun 2013 | A1 |
| 20130163475 | Beliveau | Jun 2013 | A1 |
| 20130166703 | Hammer et al. | Jun 2013 | A1 |
| 20130227051 | Khakpour et al. | Aug 2013 | A1 |
| 20130227519 | Maleport | Aug 2013 | A1 |
| 20130315054 | Shamis et al. | Nov 2013 | A1 |
| 20130318107 | Asaad | Nov 2013 | A1 |
| 20130346814 | Zadigian et al. | Dec 2013 | A1 |
| 20140033489 | Kawashima | Feb 2014 | A1 |
| 20140040527 | Kanigicherla et al. | Feb 2014 | A1 |
| 20140043974 | Kwan et al. | Feb 2014 | A1 |
| 20140082302 | Rommelmann et al. | Mar 2014 | A1 |
| 20140115571 | Wang et al. | Apr 2014 | A1 |
| 20140115666 | Garcia Morchon et al. | Apr 2014 | A1 |
| 20140181232 | Manula et al. | Jun 2014 | A1 |
| 20140204943 | Palmer | Jul 2014 | A1 |
| 20140241359 | Bosshart et al. | Aug 2014 | A1 |
| 20140241361 | Bosshart | Aug 2014 | A1 |
| 20140241362 | Bosshart et al. | Aug 2014 | A1 |
| 20140244966 | Bosshart et al. | Aug 2014 | A1 |
| 20140269432 | Goyal et al. | Sep 2014 | A1 |
| 20140301192 | Lee et al. | Oct 2014 | A1 |
| 20140321473 | Chen et al. | Oct 2014 | A1 |
| 20140328180 | Kim et al. | Nov 2014 | A1 |
| 20140328344 | Bosshart | Nov 2014 | A1 |
| 20140334489 | Bosshart et al. | Nov 2014 | A1 |
| 20150003259 | Gao | Jan 2015 | A1 |
| 20150009796 | Koponen et al. | Jan 2015 | A1 |
| 20150020060 | Bandakka et al. | Jan 2015 | A1 |
| 20150023147 | Lee et al. | Jan 2015 | A1 |
| 20150081833 | Pettit et al. | Mar 2015 | A1 |
| 20150092539 | Sivabalan et al. | Apr 2015 | A1 |
| 20150121355 | Chang et al. | Apr 2015 | A1 |
| 20150131666 | Kang et al. | May 2015 | A1 |
| 20150131667 | Ko | May 2015 | A1 |
| 20150142932 | Hallivuori et al. | May 2015 | A1 |
| 20150142991 | Zaloom | May 2015 | A1 |
| 20150156288 | Lu et al. | Jun 2015 | A1 |
| 20150172198 | Levy | Jun 2015 | A1 |
| 20150178395 | Tiwari et al. | Jun 2015 | A1 |
| 20150180769 | Wang et al. | Jun 2015 | A1 |
| 20150222560 | Kakadia et al. | Aug 2015 | A1 |
| 20150249572 | Mack-Crane et al. | Sep 2015 | A1 |
| 20150256465 | Mack-Crane | Sep 2015 | A1 |
| 20150319086 | Tripathi et al. | Nov 2015 | A1 |
| 20150363522 | Maurya | Dec 2015 | A1 |
| 20150381418 | Fausak et al. | Dec 2015 | A1 |
| 20150381495 | Cherian et al. | Dec 2015 | A1 |
| 20160014073 | Reddy et al. | Jan 2016 | A1 |
| 20160019161 | Patel et al. | Jan 2016 | A1 |
| 20160094460 | Shelar et al. | Mar 2016 | A1 |
| 20160139892 | Atreya | May 2016 | A1 |
| 20160149784 | Zhang et al. | May 2016 | A1 |
| 20160173371 | Bays | Jun 2016 | A1 |
| 20160173383 | Liu et al. | Jun 2016 | A1 |
| 20160188313 | Dubal et al. | Jun 2016 | A1 |
| 20160188320 | Chang et al. | Jun 2016 | A1 |
| 20160191306 | Gasparakis et al. | Jun 2016 | A1 |
| 20160191370 | Wood | Jun 2016 | A1 |
| 20160191384 | Shelar et al. | Jun 2016 | A1 |
| 20160191406 | Xiao et al. | Jun 2016 | A1 |
| 20160197852 | Hutchison | Jul 2016 | A1 |
| 20160212012 | Young et al. | Jul 2016 | A1 |
| 20160232019 | Shah et al. | Aug 2016 | A1 |
| 20160234067 | Dolganow et al. | Aug 2016 | A1 |
| 20160234097 | Chang | Aug 2016 | A1 |
| 20160234102 | Kotalwar et al. | Aug 2016 | A1 |
| 20160234103 | Kotalwar | Aug 2016 | A1 |
| 20160241459 | Zheng et al. | Aug 2016 | A1 |
| 20160301601 | Anand et al. | Oct 2016 | A1 |
| 20160323243 | LeVasseur et al. | Nov 2016 | A1 |
| 20160330127 | Kim et al. | Nov 2016 | A1 |
| 20160330128 | Wang | Nov 2016 | A1 |
| 20160342510 | Pani | Nov 2016 | A1 |
| 20160344629 | Gray | Nov 2016 | A1 |
| 20160357534 | Krishnamoorthi et al. | Dec 2016 | A1 |
| 20160359685 | Yadav et al. | Dec 2016 | A1 |
| 20170005951 | Labonte et al. | Jan 2017 | A1 |
| 20170013452 | Mentze et al. | Jan 2017 | A1 |
| 20170019329 | Kozat | Jan 2017 | A1 |
| 20170034082 | Pfaff | Feb 2017 | A1 |
| 20170041209 | Joshi et al. | Feb 2017 | A1 |
| 20170048144 | Liu | Feb 2017 | A1 |
| 20170053012 | Levy et al. | Feb 2017 | A1 |
| 20170063690 | Bosshart | Mar 2017 | A1 |
| 20170064047 | Bosshart | Mar 2017 | A1 |
| 20170070416 | Narayanan et al. | Mar 2017 | A1 |
| 20170075692 | Naresh et al. | Mar 2017 | A1 |
| 20170085414 | Castaldelli et al. | Mar 2017 | A1 |
| 20170085477 | Li | Mar 2017 | A1 |
| 20170085479 | Wang | Mar 2017 | A1 |
| 20170091258 | Rajahalme | Mar 2017 | A1 |
| 20170093707 | Kim et al. | Mar 2017 | A1 |
| 20170093986 | Kim et al. | Mar 2017 | A1 |
| 20170093987 | Kaushalram et al. | Mar 2017 | A1 |
| 20170118041 | Bhattacharya et al. | Apr 2017 | A1 |
| 20170118042 | Bhattacharya et al. | Apr 2017 | A1 |
| 20170126588 | Anand et al. | May 2017 | A1 |
| 20170134282 | Agarwal et al. | May 2017 | A1 |
| 20170134310 | Koladi et al. | May 2017 | A1 |
| 20170142000 | Cai et al. | May 2017 | A1 |
| 20170142011 | Zhang et al. | May 2017 | A1 |
| 20170180273 | Daly et al. | Jun 2017 | A1 |
| 20170195229 | Ulas et al. | Jul 2017 | A1 |
| 20170208015 | Volkening et al. | Jul 2017 | A1 |
| 20170220499 | Gray | Aug 2017 | A1 |
| 20170222881 | Holbrook et al. | Aug 2017 | A1 |
| 20170223575 | Duda et al. | Aug 2017 | A1 |
| 20170251077 | Eerpini et al. | Aug 2017 | A1 |
| 20170264571 | Aibester et al. | Sep 2017 | A1 |
| 20170289034 | Bosshart et al. | Oct 2017 | A1 |
| 20180006945 | Flajslik et al. | Jan 2018 | A1 |
| 20180006950 | Flajslik et al. | Jan 2018 | A1 |
| 20180054385 | Dharmapurikar et al. | Feb 2018 | A1 |
| 20180115478 | Kim et al. | Apr 2018 | A1 |
| 20180124183 | Kozat et al. | May 2018 | A1 |
| 20180191640 | Calderon et al. | Jul 2018 | A1 |
| 20180234340 | Kim et al. | Aug 2018 | A1 |
| 20180234355 | Kim et al. | Aug 2018 | A1 |
| 20180262424 | Roeland et al. | Sep 2018 | A1 |
| 20180287819 | Mayer-Wolf et al. | Oct 2018 | A1 |
| 20180316549 | Gasparakis et al. | Nov 2018 | A1 |
| 20180375755 | Joshi et al. | Dec 2018 | A1 |
| 20190394086 | Gasparakis et al. | Dec 2019 | A1 |
| 20200007473 | Kim et al. | Jan 2020 | A1 |
| 20200021486 | Gasparakis et al. | Jan 2020 | A1 |
| 20200076737 | Bosshart | Mar 2020 | A1 |
| 20200084093 | Gasparakis et al. | Mar 2020 | A1 |
| 20200099617 | Bosshart | Mar 2020 | A1 |
| 20200099618 | Bosshart | Mar 2020 | A1 |
| 20200099619 | Bosshart | Mar 2020 | A1 |
| 20200228433 | Lee | Jul 2020 | A1 |
| 20200244576 | Wetterwald et al. | Jul 2020 | A1 |
| 20200280428 | Kovacs et al. | Sep 2020 | A1 |
| 20200280518 | Lee et al. | Sep 2020 | A1 |
| Number | Date | Country |
|---|---|---|
| 3229424 | Oct 2017 | EP |
| Entry |
|---|
| Bosshart, Patrick, et al., “Forwarding Metamorphosis: Fast Programmable Match-Action Processing in Hardware or SDN,” SIGCOMM'13, Aug. 12-16, 2013,12 pages, ACM, Hong Kong, China. |
| Kaufmann, Antoine, et al., “High Performance Packet Processing with FlexNIC,” ASPLOS'16, Apr. 2-6, 2016, 15 pages, ACM, Atlanta, GA, USA. |
| Non-Published commonly owned U.S. Appl. No. 15/678,549, filed Aug. 16, 2017, 41 pages, Barefoot Networks, Inc. |
| Non-Published commonly owned U.S. Appl. No. 15/678,556, filed Aug. 16, 2017, 42 pages, Barefoot Networks, Inc. |
| Non-Published commonly owned U.S. Appl. No. 15/678,565, filed Aug. 16, 2017, 42 pages, Barefoot Networks, Inc. |
| Non-published commonly owned U.S. Appl. No. 16/288,074, filed Feb. 27, 2019, 47 pages, Barefoot Networks, Inc. |
| Advisory Action for U.S. Appl. No. 15/835,238, dated Nov. 22, 2019, 3 pages. |
| Advisory Action for U.S. Appl. No. 15/888,054, dated Feb. 10, 2020. |
| Final Office Action for U.S. Appl. No. 15/784,191, dated Feb. 26, 2021. |
| Final Office Action for U.S. Appl. No. 15/784,191, dated May 7, 2020, 13 pages. |
| Final Office Action for U.S. Appl. No. 15/784,192, dated Jun. 1, 2020, 14 pages. |
| Final Office Action for U.S. Appl. No. 15/888,050, dated Dec. 12, 2019. |
| Non-Final Office Action for U.S. Appl. No. 16/569,554, dated Feb. 19, 2021. |
| Notice of Allowance for U.S. Appl. No. 14/583,664, dated Feb. 28, 2018. |
| Notice of Allowance for U.S. Appl. No. 14/836,850, dated Jun. 20, 2017. |
| Notice of Allowance for U.S. Appl. No. 14/836,855, dated Jun. 30, 2017. |
| Notice of Allowance for U.S. Appl. No. 15/678,549, dated Apr. 8, 2020. |
| Notice of Allowance for U.S. Appl. No. 15/678,549, dated Dec. 27, 2019. |
| Notice of Allowance for U.S. Appl. No. 15/678,556, dated Feb. 4, 2020. |
| Notice of Allowance for U.S. Appl. No. 15/729,555, dated May 2, 2019. |
| Notice of Allowance for U.S. Appl. No. 15/729,593, dated Nov. 15, 2018. |
| Notice of Allowance for U.S. Appl. No. 15/784,190, dated May 10, 2019, 20 pages. |
| Notice of Allowance for U.S. Appl. No. 15/784,191, dated Apr. 19, 2019, 7 pages. |
| Notice of Allowance for U.S. Appl. No. 15/784,191, dated Aug. 21, 2019, 8 pages. |
| Notice of Allowance for U.S. Appl. No. 15/784,191, dated Aug. 31, 2021. |
| Notice of Allowance for U.S. Appl. No. 15/784,191, dated May 5, 2021. |
| Notice of Allowance for U.S. Appl. No. 15/784,192, dated Mar. 17, 2021. |
| Notice of Allowance for U.S. Appl. No. 15/784,192, dated Jun. 30, 2021. |
| Notice of Allowance for U.S. Appl. No. 15/784,192, dated Sep. 30, 2021. |
| Notice of Allowance for U.S. Appl. No. 15/835,233, dated Jul. 3, 2019, 8 pages. |
| Notice of Allowance for U.S. Appl. No. 15/835,233, dated Oct. 29, 2019. |
| Notice of Allowance for U.S. Appl. No. 15/835,238, dated Sep. 30, 2020. |
| Notice of Allowance for U.S. Appl. No. 15/835,249, dated Jul. 25, 2019. |
| Notice of Allowance for U.S. Appl. No. 16/026,318, dated Mar. 12, 2019. |
| Notice of Allowance for U.S. Appl. No. 16/519,873, dated Aug. 30, 2021. |
| Notice of Allowance for U.S. Appl. No. 16/582,798 U.S. Appl. No. 16/582,798, dated Aug. 27, 2021. |
| Notice of Allowance for U.S. Appl. No. 16/687,271, dated Aug. 30, 2021. |
| Notice of Allowance for U.S. Appl. No. 16/789,339, dated Jul. 29, 2021. |
| Office Action for U.S. Appl. No. 14/583,664, dated Feb. 27, 2017. |
| Office Action for U.S. Appl. No. 14/583,664, dated Jul. 28, 2016. |
| Office Action for U.S. Appl. No. 14/583,664, dated Oct. 18, 2017. |
| Office Action for U.S. Appl. No. 14/863,961, dated Jun. 16, 2017. |
| Office Action for U.S. Appl. No. 14/864,032, dated Feb. 14, 2017. |
| Office Action for U.S. Appl. No. 15/678,549, dated Feb. 26, 2019. |
| Office Action for U.S. Appl. No. 15/678,549, dated Jul. 30, 2019. |
| Office Action for U.S. Appl. No. 15/678,556, dated Jun. 19, 2019. |
| Office Action for U.S. Appl. No. 15/678,565, dated Jun. 13, 2019. |
| Office Action for U.S. Appl. No. 15/729,593, dated Aug. 10, 2018. |
| Office Action for U.S. Appl. No. 15/784,191, dated Aug. 26, 2020, 14 pages. |
| Office Action for U.S. Appl. No. 15/784,191, dated Dec. 19, 2018, 11 pages. |
| Office Action for U.S. Appl. No. 15/784,191, dated Jan. 24, 2020, 12 pages. |
| Office Action for U.S. Appl. No. 15/784,192, dated Sep. 19, 2019, 14 pages. |
| Office Action for U.S. Appl. No. 15/835,233, dated Feb. 8, 2019, 17 pages. |
| Office Action for U.S. Appl. No. 15/835,238, dated Dec. 11, 2019. |
| Office Action for U.S. Appl. No. 15/835,238, dated Feb. 7, 2019. |
| Office Action for U.S. Appl. No. 15/835,238, dated Jun. 19, 2019. |
| Office Action for U.S. Appl. No. 15/835,238, dated Jun. 5, 2020. |
| Office Action for U.S. Appl. No. 15/835,247, dated Dec. 31, 2018, 18 pages. |
| Office Action for U.S. Appl. No. 15/835,247, dated Jul. 10, 2019. |
| Office Action for U.S. Appl. No. 15/835,249, dated Dec. 31, 2018. |
| Office Action for U.S. Appl. No. 15/888,050, dated Jun. 11, 2019. |
| Office Action for U.S. Appl. No. 16/026,318, dated Sep. 20, 2018. |
| Office Action for U.S. Appl. No. 16/288,074, dated Oct. 7, 2020. |
| Office Action for U.S. Appl. No. 16/288,074, dated Mar. 5, 2020. |
| Office Action for U.S. Appl. No. 16/519,873, dated Jun. 11, 2021. |
| Office Action for U.S. Appl. No. 16/569,554, dated Aug. 18, 2020. |
| Office Action for U.S. Appl. No. 16/569,554, dated Jul. 2, 2021. |
| Office Action for U.S. Appl. No. 16/569,554, dated Sep. 27, 2021. |
| Office Action for U.S. Appl. No. 16/573,847 dated Jan. 6, 2021. |
| Office Action for U.S. Appl. No. 16/573,847, dated Aug. 2, 2021. |
| Office Action for U.S. Appl. No. 16/582,798, dated Jun. 24, 2021. |
| Office Action for U.S. Appl. No. 16/687,271, dated Jun. 24, 2021. |
| Office Action for U.S. Appl. No. 16/695,049, dated Jul. 21, 2021. |
| Office Action for U.S. Appl. No. 16/695,053 dated Aug. 4, 2021. |
| Office Action for U.S. Appl. No. 16/804,960, dated Aug. 19, 2021. |
| Office Action for U.S. Appl. No. 16/804,960, dated May 12, 2021. |
| “Selection of Cyclic Redundancy Code and Checksum Algorithms to Ensure Critical Data Integrity”, Federal Aviation Administration William J. Hughes Technical Center Aviation Research Division Atlantic City International Airport New Jersey 08405, DOT/FAA/TC-14/49, Mar. 2015, 111 pages. |
| Arashloo, Mina Tahmasbi , et al. , “SNAP: Stateful Network-Wide Abstractions for Packet Processing”, SIGCOMM '16, Aug. 22-26, 2016, 27 pages, ACM, Florianopolis, Brazil. |
| Moshref, Masoud , et al. , “Flow-level State Transition as a New Switch Primitive for SON”, HotSDN'14, Aug. 22, 2014, 6 pages, ACM, Chicago, IL, USA. |
| Sivaraman, A. , et al. , “Towards Programmable Packet Scheduling”, HotNets'15, Nov. 16-17, 2015, 7 pages, ACM, Philadelphia, PA, USA. |
| Sivaraman, Anirudh , et al. , “Packet Transactions: A Programming Model for Data-Plane Algorithms at Hardware Speed”, arXiv:1512.05023v1, Dec. 16, 2015, 22 pages. |
| Sivaraman, Anirudh , et al. , “Packet Transactions: High-level Programming for Line-Rate Switches”, ?rXiv:1512.05023v2, Jan. 30, 2016, 16 pages. |
| Sivaraman, Anirudh , et al. , “Packet Transactions: High-level Programming for Line-Rate Switches”, SIGCOMM'16, Aug. 22-26, 2016, 14 pages, ACM, Florianopolis, Brazil. |
| Sivaraman, Anirudh , et al. , “Programmable Packet Scheduling at Line Rate”, SIGCOMM'16, Aug. 22-26, 2016, 14 pages, ACM, Florianopolis, Brazil. |
| Song , “Protocol-Oblivious Forwarding: Unleashe the Power of SDN through a Future-Proof Forwarding Plane”, Huawei Technologies, USA, 6 pages. |
| Notice of Allowance for U.S. Appl. No. 15/835,247 dated Dec. 29, 2021. |
| Notice of Allowance for U.S. Appl. No. 16/519,873, dated Dec. 3, 2021. |
| Notice of Allowance for U.S. Appl. No. 16/519,873, dated Mar. 17, 2022. |
| Notice of Allowance for U.S. Appl. No. 16/573,847, dated Dec. 15, 2021. |
| Notice of Allowance for U.S. Appl. No. 16/582,798, dated Dec. 1, 2021. |
| Notice of Allowance for U.S. Appl. No. 16/687,271, dated Dec. 1, 2021. |
| Notice of Allowance for U.S. Appl. No. 16/695,049, dated Jan. 5, 2022. |
| Notice of Allowance for U.S. Appl. No. 17/318,890, dated Mar. 3, 2022. |
| Office Action for U.S. Appl. No. 16/569,554, dated Mar. 14, 2022. |
| Office Action for U.S. Appl. No. 16/695,053 dated Jan. 5, 2022. |
| Office Action for U.S. Appl. No. 16/804,960, dated Dec. 13, 2021. |
| Final Office Action for U.S. Appl. No. 16/804,960, dated Apr. 14, 2022. |
| Notice of Allowance for U.S. Appl. No. 15/835,247, dated Apr. 7, 2022. |
| Notice of Allowance for U.S. Appl. No. 16/573,847, dated Apr. 14, 2022. |
| Notice of Allowance for U.S. Appl. No. 16/582,798, dated Mar. 22, 2022. |
| Notice of Allowance for U.S. Appl. No. 16/687,271, dated Mar. 22, 2022. |
| Number | Date | Country | |
|---|---|---|---|
| 20200099617 A1 | Mar 2020 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 16573847 | Sep 2019 | US |
| Child | 16695044 | US | |
| Parent | 15729555 | Oct 2017 | US |
| Child | 16573847 | US | |
| Parent | 14836850 | Aug 2015 | US |
| Child | 15729555 | US |
