Third-party service chaining using packet encapsulation in a flow-based forwarding element

Information

  • Patent Grant
  • 11012420
  • Patent Number
    11,012,420
  • Date Filed
    Wednesday, November 15, 2017
    8 years ago
  • Date Issued
    Tuesday, May 18, 2021
    5 years ago
Abstract
A method of enforcing security rules for a packet on a host is provided. The method at a security service dispatcher, determines a dispatching action on a packet for each of a group of security services. Each security service is for enforcing a set of security rules on each packet. The method for each security service, sends the packet to the security service when the dispatch rule for the security service indicates that the set of security rules of the security service has to be enforced on the packet. The method for each security service, bypasses the enforcement of the security rules of the security service when the dispatch rule for the security service indicates that the set of security rules of the security service has to be bypassed for the packet.
Description
BACKGROUND

A flow-based software switch operates on a host by matching incoming packets with one or more flow entries. Each flow entry includes a set of matching criteria and a set of actions. The matching criteria specify a subset of the packet header values for which it requires a match. When a packet matches the set of matching criteria of a flow entry, the action or actions specified by the corresponding set of actions are performed on the packet.


Distributed firewalls provide the ability to specify firewall rules for enforcement at different enforcement points within a network. Distributed firewall rules are specified at the management plane of the flow-based software switch and pushed down to the virtualization software of the host. It is desirable to allow third party networking services to provide security and firewall rules and enforce them in the same pipeline that enforces the distributed firewall rules on the host.


BRIEF SUMMARY

Some embodiments provide a method that enables third party services to impose their network security policies within the virtualization software (e.g., the hypervisor) of a host machine. The method allows different services to impose their own criteria for whether to accept or drop a packet. The service-specific security logic for these embodiments resides in a service virtual machine (SVM) local to the virtualization software of a host or at a remote virtual or physical computing node. This is unlike the typical distributed firewall (DFW) rules, which are specified at the management plane (MP) and pushed down to the virtualization software. Packets are sent to the SVM or the remote computing node in order to obtain a security verdict.


In some embodiments, the packet processing operations (e.g., classification operations, forwarding actions, etc.) are performed by a managed forwarding element (MFE) that operates as a software forwarding element. Some embodiments use a set of application programming interfaces (APIs) that is integrated into the MFE to provide third party services access to network data flows. The DFW and the third party security rules work together and a packet has to pass both the MP specified rules of the DFW and the logic of one or more third party services in order to be accepted.


Some embodiments provide a set of dispatch rules that decides whether a packet should be sent to a security service machine or not in the first place. These dispatch rules are co-located within the DFW pipeline and determine whether a packet should be (i) sent to a local service VM, (ii) sent to a remote computing node, or (iii) just copied to the next stage in the DFW pipeline. These dispatch actions are not the ultimate packet accept or drop decisions and just determine whether the packet is sent to a service VM or remote service box. Only when a service VM or a remote computing node processes the packet and decides to accept the packet, the packet is sent back, and the pipeline goes on from where it left off.


The dispatch rules in some embodiments are stateful. For a stateful dispatch rule, the same dispatch operation that is performed for a packet is also performed for the corresponding response packet. Some embodiments keep a separate connection tracker entry per service. In some embodiments a security service can write an action overwrite into a connection tracker entry out of band in order to accept or deny the connection packets without sending the packets to the security service anymore.


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 of the 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 Drawing, 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.





BRIEF DESCRIPTION OF THE DRAWINGS

The novel features of the invention are set forth in the appended claims. However, for purposes of explanation, several embodiments of the invention are set forth in the following figures.



FIG. 1 conceptually illustrates a host with a firewall and security pipeline that allows third party services to impose their network security policies in a host in some embodiments.



FIG. 2 conceptually illustrates the ordering of DFW rules versus the third party security service rules in some embodiments.



FIG. 3 conceptually illustrates the ordering of DFW and several third party security services in the switch-ingress direction in some embodiments.



FIG. 4 conceptually illustrates the ordering of DFW and several third party security services in the switch-egress direction in some embodiments.



FIG. 5 conceptually illustrates a process for prioritizing the enforcement of the distributed firewall rules and the third party security service rules for a packet in some embodiments.



FIG. 6 conceptually illustrates a DFW pipeline that does not include third party security services.



FIG. 7 conceptually illustrates a DFW pipeline that includes third party security services in some embodiments.



FIG. 8 conceptually illustrates the information passed from the service VMs (or the remote security service machines) to the NetX module in some embodiments



FIG. 9 conceptually illustrates a process for enforcing third party security rules for a packet in some embodiments.



FIG. 10 conceptually illustrates an electronic system with which some embodiments of the invention are implemented.





DETAILED DESCRIPTION OF THE INVENTION

In the following detailed description of the invention, numerous details, examples, and embodiments of the invention are set forth and described. However, it should be understood that the invention is not limited to the embodiments set forth and that the invention may be practiced without some of the specific details and examples discussed.


Some embodiments provide a method that enables third party services to impose their network security policies within the virtualization software of a host machine. The method allows different services to impose their own criteria for whether to accept or drop a packet. The service-specific security logic for these embodiments resides in an SVM local to the virtualization software of a host or at a remote dedicated box such as a physical or virtual computing node outside the host. This is unlike the typical distributed firewall rules, which are specified at the management plane and pushed down to the virtualization software. Packets are sent to the SVM or the remote dedicated box in order to obtain a security verdict.


I. Chaining of the Third Party Security Rules with the Distributed Firewall Rules


In some embodiments, the packet processing operations (e.g., classification operations, forwarding actions, etc.) are performed by a managed forwarding element (MFE) that operates as a software forwarding element. Open vSwitch (OVS) is an example of a flow entry-based software forwarding element. In some embodiments, MFEs operate on host machines that host virtual machines or other data compute nodes that serve as the sources and destinations for packets (e.g., in the virtualization software of such a host machine). For example, an MFE might operate on a host machine that hosts virtual machines for several different logical networks, and would implement the several logical networks for each of the virtual machines residing on the host. The MFE in some embodiments is configured and managed by a network controller.


Some embodiments provide a distributed firewall with the ability to specify for a particular firewall rule to be enforced at a set of enforcement points such as network nodes and virtual interfaces inside the network. Some of these embodiments also provide a set of tools that enable third party services that do not have direct access to the virtualization software of a host to impose their network security policies within the virtualization software of a host machine by using the provided tools.



FIG. 1 conceptually illustrates a host 100 with a firewall and security pipeline that allows third party services to impose their network security policies in a host in some embodiments. As shown, the host 100 is hosting several virtual machines (VMs) 101-102. A VM is an emulation (or software implementation) of a particular computer system.


In some embodiments, the VMs execute on top of virtualization software (not shown) that is executing on the host. The host also includes a managed forwarding element (MFE) 110, a firewall and security pipeline that includes a firewall engine 170, a set of firewall rules 171, and a security service dispatcher 115 with a set of one or more service rules 172-174, a connection tracker (CT) 180, and a set of local security service nodes such as service VMs (SVMs) 112-113.


The MFE executes on the host to communicatively couple the VMs of the host to each other and to other devices outside of the host (e.g., other VMs on other hosts) through one or more forwarding elements (e.g., switches and/or routers) that operate outside of the host. As shown, MFE 110 includes a port 130 to connect to a physical network interface card (PNIC) 113 of the host, and one or more ports 135 to connect to the virtual network interface card (VNIC) 125 of each VM.


In some embodiments, the VNICs are software abstractions of the PNIC that are implemented by the virtualization software of the host. Each VNIC is responsible for exchanging data messages between its VM and the MFE 110 through its corresponding MFE port. As shown, a VM's egress data path for its data messages includes (1) the VM's VNIC 125, (2) the MFE port 135 that connects to this VNIC, (3) the MFE 110, and (4) the MFE port 130 that connects to the host's PNIC.


Through its port 130 and a NIC driver (not shown), the MFE 110 connects to the host's PNIC 113 to send outgoing packets and to receive incoming packets. As shown in FIG. 1, the host 100 includes hardware 107 (although the figure shows a software architecture diagram, the hardware 107 is displayed in order to represent the PNIC 113 of the host machine). The MFE 110 forwards messages that it receives on one of its ports to another one of its ports. In some embodiments, the MFE 110 is a software switch, while in other embodiments it is a software router or a combined software switch/router.


The MFE performs packet-processing operations to forward packets that it receives on one of its ports to another one of its ports. For example, in some embodiments, the MFE tries to use data in the packet (e.g., data in the packet header) to match a packet to flow based rules, and upon finding a match, to perform the action specified by the matching rule.


Also, in some embodiments, the MFE of one host can form multiple logical forwarding elements (LFEs) with MFEs of other hosts, with each LFE serving a conceptual switch that services a logical network. In other words, different LFEs can be defined to specify different logical networks for different users, and each LFE can be defined by multiple MFEs on multiple hosts. Overlay networks provide one manner for creating such LFEs.


An overlay network is a network virtualization technology that achieves multi-tenancy in a computing environment. Examples of overlay networks include Virtual eXtensible LAN (VXLAN), Generic Network Virtualization Encapsulation (GENEVE), and Network Virtualization using Generic Routing Encapsulation (NVGRE). For instance, VXLAN is a Layer 2 (L2) overlay scheme over a Layer 3 (L3) network. VXLAN encapsulates an Ethernet L2 frame in IP (MAC-in-UDP encapsulation) and allows VMs to be a part of virtualized L2 subnets operating in separate physical L3 networks. Similarly, NVGRE uses Generic Routing Encapsulation (GRE) to tunnel L2 packets over L3 networks. GENEVE encapsulates packets in a GENEVE header to tunnel L2 packets over L3 networks.


The MFE ports 135 in some embodiments include one or more function calls to one or more modules that implement special input/output (I/O) operations on incoming and outgoing packets that are received at the ports. One of these function calls for a port (as shown by lines 136) is to the firewall engine 170.


The firewall engine 170 performs firewall operations on incoming and/or outgoing packets (i.e., on packets that are received by the host for one of the VMs or on packets that are sent by one of the VMs). Also, in some embodiments, other virtual interfaces (VIFs) in the data path (such as the VNICs, etc.) implement the I/O function call operations (such as the firewall function calls). In some embodiments, the firewall engine 170 can also be called by the port 130 that connects to the physical NIC's driver (e.g., for incoming packets).


The firewall engine tries to match the received packets' identifiers (e.g., five-tuple identifiers extracted from the packet header) with the associated identifiers (e.g., five-tuple identifiers) of the firewall rules 171 of the VNIC that is the destination of an incoming packet or the source of an outgoing packet. In other words, to match a rule with a packet, the firewall engine 170 identifies n-data tuples for a packet (e.g., extracts these tuples from the packet's header) and compares the identified tuples with the n-data tuples of each rule.


Some embodiments allow different third party services to impose their own security criteria on packets. For instance, each service can have a set of rules to determine whether to accept or drop a packet. The third party services are typically provided by entities that do not have direct access to the virtualization of the host machine. Examples of these services are the services provided by vendors other than the vendor of the virtualization software or the firewall, services that are provided by a tenant in a multi-tenant host, etc.


Unlike the distributed firewall rules, which are specified at the management plane and pushed down to the virtualization software of the host and implemented, each service-specific security logic resides either in a local security service node 112-113 (such as a service VM (SVM) local to the host) or at a remote dedicated box 121-122 (such as a physical or virtual data compute node outside of the host 100).


The software to enforce the third party security service rules is packaged as an open virtualization format (OVF) package and is downloaded and installed in a service VM 112-113 or in a remote security service machine 121-122. The software in some embodiments communicates with the network using representational state transfer (REST) APIs.


Packets are sent (as shown by lines 141) to the corresponding security service machine of each service to obtain a verdict. For instance, each port 191-192 on the MFE 110 is used to send packets to one of the local security service machines 112-113 (through a corresponding VNIC 126127) or to one of the remote security service machines 121-122 in order to enforce security rules on the packets and send the verdicts back to the security service dispatcher 115. A packet should pass both the MP specified rules (i.e., the DFW rules) and the security services logic in order to be accepted.


Different embodiments forward the packets from a service dispatch rules module 172-174 to the service VM 127-127 differently. For instance, in some embodiments, the service dispatch rules module encapsulates the packets with an overlay network header and sends the encapsulated packet through one of the MFE ports 191-192410 to the service VM's VNIC 126-127 through an overlay network 160. Since the service VM is on the same host as the service rule module, the packets do not leave the host and are delivered to the service VM by the MFE through an overlay tunnel in the host.


In other embodiments, the service VM 112-113 and the corresponding service dispatch rules module 172-174 have access to a common memory. In these embodiments, the service rule module places the packets that are copied to the service VM in memory and the service VM accesses the packets from memory. Similarly, the service VM places the returned packet in memory and the service rules module accesses the packet from memory.


In alternative embodiments, the security service is implemented as a process that runs on the host operating system. These embodiments remove the overhead of using a service VM, as the security service process can interact with other processes in the host, e.g., through the control plane. In these embodiments, each security service process also communicates with the corresponding service rules module through the MFE or a common memory that is accessible by both the security service process and the service rules module.


Some embodiments use a set of APIs that is integrated into the MFE to provide third party services access to network data flows. Network Extensibility (NetX) is an example of such APIs. The NetX APIs allow third party partners to insert their security service rules in the corresponding service VM or remote service machine. Each NetX service provides a service VM (or a remote service machine) as well as a set of rules 172-174 that decides whether a packet should be sent to the corresponding service VM (or the remote service machine) or not in the first place.


The NetX service dispatch rules 172-174, on the other hand, are co-located with the DFW pipeline and are implemented similar to the DFW rules using OVS flows. The NSX service dispatch rules can reside in the same or in a separate table than DFW rule flows. In contrast to the security service rules that reside in machines 112-113 and 121-122 (that decide whether a packet should be accepted or dropped), the NetX service dispatch rules 172-174 (that decide whether or not the security services should be activated) are specified through the management plane and are pushed down to the virtualization software. Although several examples are provided herein by reference to NetX, it should be understood that other APIs can be used to provide third party services access to network data flows.


Flow entries of the MFE 110 in some embodiments are stateless. The flow entry rules are written over only the stateless fields and metadata of the packet that are being processed. However, to implement a firewall, some firewall rules require knowledge of connection state. For instance, a firewall rule may require packets received from outside the host of the MFE on a new connection to be dropped while packets received from outside the host of the MFE on established connections to be allowed.


When a firewall rule requires the packet connection status, the matching criteria in the flow entry that defines the firewall rule refer to the packet connection status. As a result, the incoming packets are sent to the connection tracker 180 when packet matches a flow entry that specifies an action that requires accessing the connection tracker. The connection tracker 180 has a connection table 185. Each stateful entry in the connection table 185 represents a connection that can be used to match packets in the ingress or egress directions.


A. Priority of DFW and NetX Rules


NetX rules in some embodiments are similar to DFW rules but have new action types. Examples of NetX action types include PUNT, REDIRECT and COPY. PUNT sends a packet to a local security service machine, REDIRECT sends a packet to a remote service box, and COPY just copies the packet to the next entity in the firewall and security pipeline. As described above, PUNT, REDIRECT and COPY actions are not the ultimate packet accept or drop decisions, but determine whether or not a packet is sent to a security service machine 112-113 or 121-122. Only when a security service machine processes the packet and decides to accept the packet, the packet is sent back to the firewall and security pipeline and the pipeline goes on from where it left off.



FIG. 2 conceptually illustrates the ordering of DFW rules versus the third party security service rules in some embodiments. The figure shows an MFE 205 that sends packets to and receives packets from a virtual interface (VIF) 220. A VIF is an abstraction of a network interface that allows the applications to access the interface independent of the physical interface involved. Examples of the VIF 220 include a port 135 that connects a VNIC 125 to the MFE, a port 130 that connects the MFE to a PNIC of the host 100, and a VNIC 125.


As shown, the priority of DFW with respect to the third party security services changes depending on the direction of the traffic. In the switch-ingress direction (when a packet travels from VIF 220 to MFE 204), DFW rules 215 are executed first. On the other hand, in the switch-egress direction, security service rules 210 are executed first.


In addition, the DFW rules and NetX rules in some embodiments have priorities that are determined based on whether a packet is travelling in ingress or egress direction. The relative ordering of security services among themselves, however, do not depend on the packet direction. FIG. 3 conceptually illustrates the ordering of DFW and several third party security services in the switch-ingress direction in some embodiments. As shown, the DFW rules 215 are performed first followed by the security service rules 305. Each service specifies its rules as if it is a standalone firewall module. Once a service allows the packet, the next service with the lower priority is executed.


Security service rules that belong to the same service have priority numbers that are meaningful only within the same service. Security services also have priority ordering among them. For instance, Service 1 305 in FIG. 3 has the highest priority among the security services 305-315 and service n 315 has the lowest priority. When the DFW and all services allow a packet, the packet goes through. Otherwise, the packet is dropped.



FIG. 4 conceptually illustrates the ordering of DFW and several third party security services in the switch-egress direction in some embodiments. As shown, the security service rules 305 are enforced first, followed by the DFW rules 215. Similar to FIG. 3, each service specifies its rules as if it is a standalone firewall module. Once a service allows the packet, the next service with the lower priority is executed. After the lowest priority service 305 allows that packet, the DFW rules 215 are enforced on the packet.


The priority of the third party service rules 305-615 shown in FIGS. 3 and 4 can change over time. For instance, the priority of the service rules may change by a user in the management plane similar to the DFW rules using OVS flows.



FIG. 5 conceptually illustrates a process 500 for prioritizing the enforcement of the distributed firewall rules and the third party security service rules for a packet in some embodiments. The process in some embodiments is performed by the firewall engine 170 in FIG. 1. As shown, the process determines (at 505) whether the packet is in the MFE's ingress direction. For instance, the process determines whether the packet is sent from the VIF 220 to the MFE 205 in FIG. 2. If the packet is not in the MFE ingress direction, the process proceeds to 520, which is described below.


Otherwise, the process enforces (at 510) the distributed firewall rules. For instance, the process activates a set of modules to enforce the distributed firewall rules. Next, the process enforces (at 515) the third party security rules. For instance, the process activates one or more security service modules to enforce the corresponding third party security rules. Details of enforcing the third party security rules are described below by reference to FIG. 7. The process then ends.


When the packet is in the MFE's egress path, the process enforces (at 520) the third party security rules. For instance, the process activates one or more security service modules to enforce the corresponding security service. Next, the process enforces (at 525) the distributed firewall rules. For instance, the process activates a set of modules to check the distributed firewall rules. The process then ends.


B. Firewall and Security Pipeline


In order to incorporate third party security rules, some embodiments provide repetition logic in the DFW pipeline. Instead of a single firewall table, there has to be a conjunction of a variable number of firewall and security tables, one per service. As a result of this semantic change, a packet has to be sent to connection tracker module multiple times. Similarly, rule lookup has to be done multiple times, once per service.



FIG. 6 conceptually illustrates a DFW pipeline 600 that does not include third party security services. The figure shows different modules that activate/access each other in order to process the DFW rules. The figure shows an ingress path and an egress packet (both from the MFE view point) for a VIF 605.


In the ingress path, the vif_ingress module 620 sends the packets to the connection tracker 615. The connection tracker 615 checks connection table (table 0) 610 to determine the status of the packet flow (e.g., new or established connection). The connection tracker 615 also stores the information about the new connections in the connection table 610. For instance, after a packet that belongs to a new flow is accepted, the connection tracker receives a conntrack_commit from the firewall engine and stores the connection information for the new flow.


The connection information in some embodiments includes the connection n-tuple (e.g., source IP address, source port address, destination IP address, destination port number, and protocol used). Since there may be multiple third party security services and each service may require stateful connection information, the connection table maintains one entry per service for each connection. Each entry, therefore, includes the identification of the corresponding security service.


A connection entry may include other information such as a zone filed that stores the identification of a corresponding VIF, a matching rule identification (stored in a “connmark” field), etc., that is used in different firewall rules. In the example of FIG. 6, all lookups for the connection tracker returns to a single table, i.e., table 0 610. It is also possible to resubmit the returned packet to any connection table.


As shown, the vif_ingress module 620 sends packet to exclude_list 630 to check the packets against an exclude list. Similarly, in the egress path vif_egress module 625 sends packet to exclude_list 630 to check the packets against an exclude list. If the VIF is in the exclude list, the enforcement of the firewall rules are bypassed.


Next in either ingress or egress path, network Layer 2 (L2) firewall rules are checked by dfw_l2 module 640 for the packets that are not in the exclude list. The dfw_l2 module 640 activates addr_lookup module 641 to lookup the source and destination addresses of the packets. The addr_lookup module 641 examines a packet's header and stores the source and destination addresses of the packet in temporary storage (in this example register 6 is used to store the source address and register 7 is used to store the destination address).


Next, the dfw_l2 rules module 642 is activated to use the source and destination addresses of the packet and lookup the rule identification and the action for enforcing L2 firewall rules on the packet. The dfw_l2 rules module 642 stores the rule identification and the action to perform on the packet in temporary storage (in this example register 6 is reused to store the action and register 7 is reused to store the rule identification). Next, log_and_stats module 643 is activated to update the log files and the flow statistics.


If a packet is not dropped by dfw_l2 module 640, the packet is passed to dfw_l3 module 650 to check network Layer 3 (L3) firewall rules. As described above, vif_ingress module 620 activates connection tracker 615 to check the packet flow's connection status. On the other hand, the vif_egress module 625 does not activate the connection tracker 615. Therefore, in the egress path, the dfw_l3 module 650 passes the packet to the connection tracker 615 to check the connection's status. In the ingress path, the dfw_l3 module 650 does not activate the connection tracker module 615.


The connection tracker 615 (activated in the egress path by the dfw_l3 module 650) checks connection table (table 0) 610 to determine the status of the packet flow. The connection tracker 615 also updates the information about the information in the connection table 610.


The dfw_l3 module 650 activates addr_lookup module 641 to lookup the source and destination addresses of the packets. The addr_lookup module 641 examines a packet's header and stores the source and destination addresses of the packet in temporary storage (in this example register 6 is used to store the source address and register 7 is used to store the destination address).


Next, the dfw_l3 rules module 652 is activated to use the source and destination addresses of the packet and lookup the rule identification and the action for enforcing L3 firewall rules on the packet. The dfw_l3 rules module 652 stores the rule identification and the action to perform on the packet in temporary storage (in this example register 6 is reused to store the action and register 7 is reused to store the rule identification). Next, log_and_stats module 643 is activated to update the log files and the flow statistics.


Based on whether or not a packet passes firewall rules, dfw_l3 module 650 performs typical firewall actions such as accept, deny, or reject on the packet. If the connection is accepted, a conntrack_commit command is issued to commit the connection into the connection table.


As can be seen, there is no repetition semantics and the connection tracker 615 and rules lookup 641 are done at most twice (if the packet's source and destination VMs are hosted in same host). The connection tracker lookup is done a maximum of two times (as the packet gets off the VIF and at dfw_l3 egress stage). L2 and L3 rules are looked up only once per ingress or egress direction.



FIG. 7 conceptually illustrates a DFW pipeline 700 that includes third party security services in some embodiments. The figure shows different modules that activate/access each other in order to process the DFW and the third party security service rules. NetX security services are examples of the third party security services. The figure shows an ingress path and an egress packet (both from the MFE view point) for a VIF 705.


The packets in the ingress path (i.e., packets going into the MFE from the VIF 705) are intercepted by vif_ingress module 711 while the packets in the egress path (i.e., packets leaving the MFE to the VIF 705) are intercepted by the vif_egress module 712. The vif_ingress module 711 the vif_egress module 712 pass the packets to initial firewall stage 710, which selects the sequence depending on the ingress or egress direction of a packet.


As described above by reference to FIGS. 2-4, for the packets in the ingress path the firewall rules are enforced first. For these packets, the initial firewall module 710 passes the packets to the mp_rules module 715 to enforce the firewall rules that are defined at the management plane. Once the firewall rules that are defined at the management plane are enforced for the ingress packets, the netx_rules module 720 is activated to enforce the rules that are defined by the third party service providers for these packets.


For the packets in the egress path, on the other hand, the third party security service rules are enforced first. For these packets, the initial firewall module 710 passes the packets to the netx_rules module 720 to enforce the rules that are defined by the third party service providers. Once the firewall rules that are defined rules that are defined by the third party service providers are enforced for the egress packets, the mp_rules module 715 is activated to enforce the firewall rules that are defined at the management plane for these packets.


As shown, the exclude list 725 does not apply to the third party service rules NetX. Therefore, only the mp_rules module 715 checks the packets against the exclude list by activating the exclude_list module 725. The operations of dfw_l2 760 and dfw_l3 770 modules are similar to the operations of dfw_l2 640 and dfw_l3 650 described above by reference to FIG. 6. The dfw_l2 module 760 activates addr_lookup module 730, dfw_l2_rules module 761, and log_and_stats module 780 similar to what was described above by reference to FIG. 6 for the dfw_l2 module 640. The dfw_l3 module 770 activates addr_lookup module 730, dfw_l3_rules module 771, and log_and_stats module 780 similar to what was described above by reference to FIG. 6 for the dfw_l3 module 650.


The NetX repetitive semantics is implemented at netx_l2 740 and netx_l3 750 stages in order to enforce the security rules of multiple services. The NetX rules can have all the fields and attributes as a DFW rule. Since there are L2 and L3 NetX rules per service, the L3 rules for the higher priority services are executed before the L2 rules of the lower priority services. For instance, the execution sequence in FIG. 3 is DFW L2 rules, DFW 215 L3 rules, Service 1 305 L2 rules, Service 1 305 L3 rules, Service 2 310 DFW L2 rules, Service 2 310 DFW L3 rules, and so on.


The netx_l2 module 740 performs L2 security rule enforcement for each service by activating netx_l2 rules module 741, followed by log_and_stats module 742, followed by send_to_service module 743 for each service. Multiple calls can be performed to each of these modules as indicated by a * mark on the arrows.


In this example, a temporary storage (e.g., reg10) keeps the service ID to be verified. As the rules for a service are verified, the next service ID is populated by netx_rules 710 in reg10 and netx_l2 and netx_l3 resubmit to themselves. Packets are sent to send_to_service module 742 to encapsulate with overlay network header and metadata required to enforce each service rule. The packets are sent by send_to_service module 743 to the service VM port (e.g., through port 191, VNIC 126, to SVM 112. The SVM then checks the packet information against the service rules and come with a verdict such as accept, drop, etc.


The netx_l3 module 750 performs L3 security rule enforcement for each service by activating netx_l3 rules module 751, followed by log_and_stats module 742, followed by send_to_service module 743 for each service. Multiple calls can be performed to each of these modules as indicated by a * mark on the arrows. Packets are sent to send_to_service module 742 to encapsulate with overlay network header and metadata required to enforce each service rule.



FIG. 8 conceptually illustrates the information passed from the service VMs (or the remote security service machines) to the NetX module in some embodiments. As shown, the service machine (e.g., SVM 112 or the remote security service 121 in FIG. 1) includes information such as service identification 805, input port identification 810, packet direction (ingress into the MFE or egress from the MFE) 815, the rule identification 820, the rule type (L2 or L3) 825, and whether the packet is accepted or not 830 in the overlay header that encapsulates the packets. The encapsulated packet is received by the netx_l2 740 and netx_l3 750 modules. The metadata 805-825 included in the overlay encapsulation header is used by the netx_l2 740 and netx_l3 750 modules in order to decide what to do next with the packet (e.g., drop the packet, send the packet to the next service, etc.).


Some embodiments perform packet logging for every NetX rule hit. As a result, a packet might be logged many times as it is possible that multiple service rules hit the same packet. Similarly, these embodiments keep the statistics (the stats) per-rule. In some embodiments, the connection entries in the connection tracker table are marked (using “connmark” by the matching the NetX rule for that service.


The send_to_service module 743 sends the packets to the service VM port (e.g., through port 191, VNIC 126, to SVM 112) for either L2 or L3 rule enforcement. Alternatively, the packet is sent through a port such as 192, port 130, the overlay network tunnel 150 in the network 145 to a remote security service machine 121-122. The SVM (or the remote service) then checks the packet information against the service rules and comes up with a verdict such as accept, drop, etc.


When a packet comes back from the SVM or the remote service, the overlay network encapsulation is used to reroute the packet back to netx_l2 or netx_l3 module with the relevant register values. One register (e.g., reg8) is always set to ACCEPT when packet comes from the security service (if the packet is not accepted, the security service drops the back without sending it back). Therefore netx_l2 or netx_l3 module knows that it should not run the rules again for this service (i.e. for the serviceId indicated by reg10). The netx_l2 or netx_l3 module, therefore, directly accepts that packet, performs connection tracker lookup and commit if required, and moves to the next service.


If reg8 is empty, then netx_l2 or netx_l3 module will execute the rules of the service indicated in reg10. All service rules reside in netx_l2 rules (stored in reg6 by netx_l2 rules module 741) and netx_l3 rules (stored in reg6 by netx_l3 rules module 751). The current service identification is also stored in reg10. Therefore, a resubmit to rules table will only match the rules of a specific service at a time.


The NetX rules can be stateful, which means, the response packets in a connection should not lookup the rules again. For instance, assume an initial packet PI has hit service 1's rule R1 and was sent (based on a PUNT decision) to service 1 VM. When the response packet P2 comes, the same action (i.e., the PUNT) should be executed again to send the response packet P2 to service 1 VM without running any NetX rules (e.g., activating netx_l3 rules 751) for service 1. The netX rules for other service are not skipped though since other services might have hit stateless rules. As a result, a separate connection tracker entry is kept per service.


As shown, the netx_l3 module 750 always performs the connection tracker lookup by activating conntrack_lookup 745 module for each service. The connection tracker zone parameter for connection table lookup is constructed by concatenating the service number and the VIF (e.g., port 135 in FIG. 1) context. For instance, in some embodiments the zone is 16 bits with the first 5 bits used for service ID and the remaining 11 bits for the VIF context. As a result, each service has its own connection tracker space and the information for the services is not mixed.


Some embodiments support an action-overwrite operation. This is a special case for NetX, which is different from the DFW. The SVM (or the remote service machine) that is enforcing the service rules can write into the connection tracker entry in an out of band manner in order to ACCEPT or DENY the connection packets, without sending them to service VM (or the remote service machine).


This means, the service VM (or the remote service machine) that is enforcing the service rules is not interested in inspecting the packets of that connection anymore and is instructing the pipeline to just accept/deny those packets without executing any NetX rules for that service (hence not punting/redirecting/copying) any more. Therefore, if the result of connection tracker lookup shows that there is an “action-overwrite”, no rule lookups is performed. The packet is either directly accepted and control is moved on to the next service (in case of ACCEPT overwrite), or the packet is dropped (in case of DENY overwrite).


In order to provide the action-overwrite operation, some embodiments provide a control channel between the SVM or the remote service machine (e.g., in one of the functions of a software development kit (SDK) used by the SVM or the remote service machine) and the L3 domain (L3D) that controls the connection tracker to make changes to the connection tracker entries as well as pull the information about the existing entries.



FIG. 9 conceptually illustrates a process 900 for enforcing third party security rules for a packet in some embodiments. The process in some embodiments is performed by a set of modules such as the netx_rules 720 and modules 740-751 in FIG. 7 after a packet is passed to the netx_rules 720 module. As shown, the process sets (at 905) the current security service to the highest priority security service in the pipeline. For instance, the process starts with the highest priority security service such as the security service associated with Service 1 rules 305 in FIGS. 3 and 4.


Next, the process determines (at 910) the dispatch rule for the current security service. For instance, netx_l2 rules module 741 or netx_l3 rules module 751 in FIG. 7 use the current serviceID to identify ruleID to perform for the current security service. When the dispatch rule indicates the packet has to be sent to the local security service machine corresponding to the current security service, the process proceeds to 915. For instance, when the dispatch rule is PUNT, the security service is performed by a local machine such as the SVM 112 in the host in FIG. 1.


The process then performs (at 915) logs and updates the statistics for the packet. For instance, log_and_stats module 742 performs log and updates the statistics for the packet as described above by reference to FIG. 7. The process then encapsulates (at 920) the packet with overlay network header and forwards the packet to the local machine that enforces the third party's security service rules. For instance, the send_to_service module 743 in FIG. 7 encapsulate the packet with the overlay network header and sends the packet to an SVM 112-113 local to the host 100 in FIG. 1. The process then proceeds to 935, which is described below.


When the dispatch rule indicates the packet has to be copied to the next stage in the firewall and security service pipeline (e.g., when the dispatch rule is COPY), the process proceeds to 950, which is described below. When the dispatch rule indicates the packet has to be redirected to the remote security service machine corresponding to the current security service, the process proceeds to 925. For instance, when the dispatch rule is REDIRECT, the security service is performed by a remote machine such as the SVM 112 in FIG. 1. The process then performs (at 925) logs and updates the statistics for the packet. For instance, log_and_stats module 742 performs log and updates the statistics for the packet as described above by reference to FIG. 7. The process then encapsulates (at 930) the packet with overlay network header and forwards the packet to the local machine that enforces the third party's security service rules. For instance, the send_to_service module 743 in FIG. 7 encapsulate the packet with the overlay network header and sends the packet to an SVM 112-113 local to the host 100 in FIG. 1. The process then determines (at 935) whether the packet is received back from the security service machine before a predetermined timeout expires. If not, the process assumes that the security service has dropped the packet. The process updates (At 940) the logs to indicate the packet is dropped by the security service machine. The process then ends.


Otherwise, the process uses (at 945) the metadata in the encapsulated response packet to determine the current stage in the pipeline. For instance, the process uses the metadata included in the overlay encapsulation header as described above by reference to FIG. 8 to determine the current stage in the pipeline and to determine what to do with the packet next. For instance, if the current stage was checking the packet against L2 rules of a security service, the next stage may be checking the packet against L3 rules by the same security service. On the other hand, if the current stage was checking the L3 rules by a security service, the next stage may be checking the L2 rules by the next highest priority security service, checking the packet against the distributed firewall rules if the current security service is the lowest priority security service and the packet is in the MFE's egress direction. Alternatively, if the current security service is the lowest priority security service and the packet is in the MFE's ingress direction, the next stage is to send the packet back to the MFE to forward the packet to its destination.


The process then determines (at 950) whether the dispatch rules for all security services are examined. If yes, the process ends. Otherwise, the process sets (at 960) the current security service to the next highest security service in the pipeline. The process then proceeds to 910, which was described above.


II. Electronic System


Many 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.



FIG. 10 conceptually illustrates an electronic system 1000 with which some embodiments of the invention are implemented. The electronic system 1000 can be used to execute any of the control, virtualization, or operating system applications described above. The electronic system 1000 may be a computer (e.g., a desktop computer, personal computer, tablet computer, server computer, mainframe, a blade computer etc.), phone, PDA, or any other sort of electronic device. Such an electronic system includes various types of computer readable media and interfaces for various other types of computer readable media. Electronic system 1000 includes a bus 1005, processing unit(s) 1010, a system memory 1020, a read-only memory (ROM) 1030, a permanent storage device 1035, input devices 1040, and output devices 1045.


The bus 1005 collectively represents all system, peripheral, and chipset buses that communicatively connect the numerous internal devices of the electronic system 1000. For instance, the bus 1005 communicatively connects the processing unit(s) 1010 with the read-only memory 1030, the system memory 1020, and the permanent storage device 1035.


From these various memory units, the processing unit(s) 1010 retrieve 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 1030 stores static data and instructions that are needed by the processing unit(s) 1010 and other modules of the electronic system. The permanent storage device 1035, 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 1000 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 1035.


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 1035, the system memory 1020 is a read-and-write memory device. However, unlike storage device 1035, the system memory is a volatile read-and-write memory, such as 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 1020, the permanent storage device 1035, and/or the read-only memory 1030. From these various memory units, the processing unit(s) 1010 retrieve instructions to execute and data to process in order to execute the processes of some embodiments.


The bus 1005 also connects to the input and output devices 1040 and 1045. The input devices enable the user to communicate information and select commands to the electronic system. The input devices 1040 include alphanumeric keyboards and pointing devices (also called “cursor control devices”). The output devices 1045 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 FIG. 10, bus 1005 also couples electronic system 1000 to a network 1025 through a network adapter (not shown). In this manner, the computer can be a part of a network of computers (such as a local area network (“LAN”), a wide area network (“WAN”), or an Intranet, or a network of networks, such as the Internet. Any or all components of electronic system 1000 may be used in conjunction with the invention.


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 or transitory 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 FIGS. #08 and #09) conceptually illustrate processes. The specific operations of these processes may not be performed in the exact order shown and described. The specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments. Furthermore, the process could be implemented using several sub-processes, or as part of a larger macro process.


This specification refers throughout to computational and network environments that include virtual machines (VMs). However, virtual machines are merely one example of data compute nodes (DCNs) or data compute end nodes, also referred to as addressable nodes. DCNs may include non-virtualized physical hosts, virtual machines, containers that run on top of a host operating system without the need for a hypervisor or separate operating system, and hypervisor kernel network interface modules.


VMs, in some embodiments, operate with their own guest operating systems on a host using resources of the host virtualized by virtualization software (e.g., a hypervisor, virtual machine monitor, etc.). The tenant (i.e., the owner of the VM) can choose which applications to operate on top of the guest operating system. Some containers, on the other hand, are constructs that run on top of a host operating system without the need for a hypervisor or separate guest operating system. In some embodiments, the host operating system uses name spaces to isolate the containers from each other and therefore provides operating-system level segregation of the different groups of applications that operate within different containers. This segregation is akin to the VM segregation that is offered in hypervisor-virtualized environments that virtualize system hardware, and thus can be viewed as a form of virtualization that isolates different groups of applications that operate in different containers. Such containers are more lightweight than VMs.


Hypervisor kernel network interface module, in some embodiments, is a non-VM DCN that includes a network stack with a hypervisor kernel network interface and receive/transmit threads. One example of a hypervisor kernel network interface module is the vmknic module that is part of the ESXi™ hypervisor of VMware, Inc.


One of ordinary skill in the art will recognize that while the specification refers to VMs, the examples given could be any type of DCNs, including physical hosts, VMs, non-VM containers, and hypervisor kernel network interface modules. In fact, the example networks could include combinations of different types of DCNs in some embodiments.


In view of the foregoing, one of ordinary skill in the art would understand that the invention is not to be limited by the foregoing illustrative details, but rather is to be defined by the appended claims.

Claims
  • 1. A method of performing services on a packet associated with a machine executing on a host computer, the method comprising: at a security service dispatcher executing on the host computer:receiving the packet from a module along (i) an ingress path of the packet into the host computer to the machine which is a destination of the packet or (ii) an egress path of the packet out of the host computer from the machine which is a source of the packet, the module executing on the host computer;identifying, for the packet, a plurality of service dispatch rules for a plurality of candidate services to perform on the packet, each service dispatch rule of the plurality of service dispatch rules specifying a dispatch action for a candidate service of the plurality of candidate services that is associated with each service dispatch rule of the plurality of service dispatch rules; anditeratively processing each service dispatch rule of the plurality of service dispatch rules by:when a particular service dispatch rule of the plurality of service dispatch rules specifies that a particular candidate service of the plurality of candidate services that is associated with the particular service dispatch rule of the plurality of service dispatch rules has to be performed on the packet, forwarding the packet to a particular service machine to perform the particular candidate service, the particular service machine returning the packet to the security service dispatcher after the particular service machine performs the particular candidate service and when performance of the particular candidate service by the particular service machine does not result in dropping of the packet;when the particular service dispatch rule of the plurality of service dispatch rules specifies that the particular candidate service does not have to be performed on the packet, forgoing forwarding the packet to the particular service machine to perform the particular candidate service; andafter processing the particular service dispatch rule, proceeding to a next service dispatch rule in the plurality of service dispatch rules until all of the plurality of service dispatch rules have been processed.
  • 2. The method of claim 1, wherein at least one of the plurality of candidate services determines whether the packet has to be accepted or dropped.
  • 3. The method of claim 1, wherein the host computer comprises a flow-based managed forwarding element (MFE) implementing a software switch and stores a plurality of distributed firewall rules, the method further comprising: when the packet is along the ingress path, enforcing the plurality of distributed firewall rules on the packet before the security service dispatcher receives the packet; andwhen the packet is along the egress path, enforcing the plurality of distributed firewall rules after the security service dispatcher has processed all of the plurality of service dispatch rules.
  • 4. The method of claim 1, wherein a set of the plurality of service dispatch rules are stateful, wherein the packet is communicated over a network connection between a source node and a destination node, the method further comprising: for each service dispatch rule of the set of the plurality of service dispatch rules that are stateful, storing (i) an identification of a particular associated candidate service and (ii) an identification of the network connection in a connection tracking table, wherein the connection tracking table is used to enforce the set of the plurality of service dispatch rules that are stateful for the packet.
  • 5. The method of claim 4, wherein particular candidate services that are associated with the set of the plurality of service dispatch rules are stateful, wherein the connection tracking table is used to enforce the particular candidate services that are stateful for the packet.
  • 6. The method of claim 1, wherein the security service dispatcher encapsulates the packet in a header when forwarding the packet to the particular service machine for at least one service dispatch rule.
  • 7. The method of claim 1, wherein the particular service machine returning the packet to the security service dispatcher comprises the particular service machine encapsulating the packet in a header before returning the packet to the security service dispatcher, the method further comprising using the header to identify the next service dispatch rule.
  • 8. The method of claim 7, wherein the particular service machine is one of a service data compute node executing on the host computer and a remote computing node executing outside of the host computer.
  • 9. The method of claim 1, wherein the packet is forwarded to a destination of the packet when no service machine drops the packet.
  • 10. The method of claim 1, wherein the host computer comprises a flow-based managed forwarding element (MFE) implementing a software switch, wherein the security service dispatcher receives packets sent and received at each of a set of MFE ports.
  • 11. A non-transitory machine readable medium storing a security service dispatcher which when executed by at least one processing unit of a host computer performs services on a packet associated with a machine executing on the host computer, the security service dispatcher comprising sets of instructions for: receiving the packet from a module along (i) an ingress path of the packet into the host computer to the machine which is a destination of the packet or (ii) an egress path of the packet out of the host computer from the machine which is a source of the packet, the module executing on the host computer;identifying, for the packet, a plurality of service dispatch rules for a plurality of candidate services to perform on the packet, each service dispatch rule of the plurality of service dispatch rules specifying a dispatch action for a candidate service of the plurality of candidate services that is associated with each service dispatch rule of the plurality of service dispatch rules; anditeratively processing each service dispatch rule of the plurality of service dispatch rules by:forwarding the packet to a particular service machine to perform a particular candidate service of the plurality of candidate services that is associated with a particular service dispatch rule of the plurality of service dispatch rules, when the particular service dispatch rule of the plurality of service dispatch rules specifies that the particular candidate service has to be performed on the packet, the particular service machine returning the packet to the security service dispatcher after the particular service machine performs the particular candidate service and when performance of the particular candidate service by the particular service machine does not result in dropping of the packet;forgoing forwarding the packet to the particular service machine to perform the particular candidate service when the particular service dispatch rule of the plurality of service dispatch rules specifies that the particular candidate service does not have to be performed on the packet; andproceeding to a next service dispatch rule in the plurality of service dispatch rules after processing the particular service dispatch rule until all of the plurality of service dispatch rules have been processed.
  • 12. The non-transitory machine readable medium of claim 11, wherein at least one of the plurality of candidate services determines whether the packet has to be accepted or dropped.
  • 13. The non-transitory machine readable medium of claim 11, wherein forwarding the packet to the particular service machine comprises encapsulating the packet in a header and forwarding the packet to the particular service machine.
  • 14. The non-transitory machine readable medium of claim 11, wherein a set of the plurality of service dispatch rules are stateful, wherein the packet is communicated over a network connection between a source node and a destination node, the security service dispatcher further comprising a set of instructions for: storing, for each service dispatch rule of the set of the plurality of service dispatch rules that are stateful, (i) an identification of a particular associated candidate service and (ii) an identification of the network connection in a connection tracking table, wherein the connection tracking table is used to enforce the set of the plurality of service dispatch rules that are stateful for the packet.
  • 15. The non-transitory machine readable medium of claim 14, wherein particular candidate services that are associated with the set of the plurality of service dispatch rules are stateful, wherein the connection tracking table is used to enforce the particular candidate services that are stateful for the packet.
  • 16. The non-transitory machine readable medium of claim 11, wherein the security service dispatcher comprises a set of instructions for encapsulating the packet in a header when forwarding the packet to the particular service machine for at least one service dispatch rule.
  • 17. The non-transitory machine readable medium of claim 11, wherein the particular service machine returning the packet to the security service dispatcher comprises the particular service machine encapsulating the packet in a header before returning the packet to the security service dispatcher, wherein the security service dispatcher further comprises a set of instructions for using the header to identify the next service dispatch rule.
  • 18. The non-transitory machine readable medium of claim 17, wherein the particular service machine is one of a service data compute node executing on the host computer and a remote computing node executing outside of the host computer.
  • 19. The non-transitory machine readable medium of claim 11, wherein the packet is forwarded to a destination of the packet when no service machine drops the packet.
  • 20. The non-transitory machine readable medium of claim 11, wherein the host computer comprises a flow-based managed forwarding element (MFE) implementing a software switch, wherein the security service dispatcher receives packets that are sent and received at each of a set of MFE ports.
US Referenced Citations (524)
Number Name Date Kind
6006264 Colby et al. Dec 1999 A
6104700 Haddock et al. Aug 2000 A
6154448 Petersen et al. Nov 2000 A
6772211 Lu et al. Aug 2004 B2
6779030 Dugan et al. Aug 2004 B1
6880089 Bommareddy et al. Apr 2005 B1
6985956 Luke et al. Jan 2006 B2
7013389 Srivastava et al. Mar 2006 B1
7209977 Acharya et al. Apr 2007 B2
7239639 Cox et al. Jul 2007 B2
7379465 Aysan et al. May 2008 B2
7406540 Acharya et al. Jul 2008 B2
7447775 Zhu et al. Nov 2008 B1
7480737 Chauffour et al. Jan 2009 B2
7487250 Siegel Feb 2009 B2
7649890 Mizutani et al. Jan 2010 B2
7818452 Matthews et al. Oct 2010 B2
7898959 Arad Mar 2011 B1
7948986 Ghosh et al. May 2011 B1
8078903 Parthasarathy et al. Dec 2011 B1
8094575 Vadlakonda et al. Jan 2012 B1
8175863 Ostermeyer et al. May 2012 B1
8190767 Maufer et al. May 2012 B1
8201219 Jones Jun 2012 B2
8223634 Tanaka et al. Jul 2012 B2
8230493 Davidson et al. Jul 2012 B2
8266261 Akagi Sep 2012 B2
8339959 Moisand et al. Dec 2012 B1
8451735 Li May 2013 B2
8484348 Subramanian et al. Jul 2013 B2
8488577 Macpherson Jul 2013 B1
8521879 Pena et al. Aug 2013 B1
8615009 Ramamoorthi et al. Dec 2013 B1
8707383 Bade et al. Apr 2014 B2
8743885 Khan et al. Jun 2014 B2
8804720 Rainovic et al. Aug 2014 B1
8804746 Wu et al. Aug 2014 B2
8811412 Shippy Aug 2014 B2
8830834 Sharma et al. Sep 2014 B2
8832683 Heim Sep 2014 B2
8849746 Candea et al. Sep 2014 B2
8856518 Sridharan et al. Oct 2014 B2
8862883 Cherukuri et al. Oct 2014 B2
8868711 Skjolsvold et al. Oct 2014 B2
8873399 Bothos et al. Oct 2014 B2
8874789 Zhu Oct 2014 B1
8892706 Dalal Nov 2014 B1
8914406 Haugsnes et al. Dec 2014 B1
8971345 McCanne et al. Mar 2015 B1
8989192 Foo et al. Mar 2015 B2
8996610 Sureshchandra et al. Mar 2015 B1
9094464 Scharber et al. Jul 2015 B1
9104497 Mortazavi Aug 2015 B2
9148367 Kandaswamy et al. Sep 2015 B2
9191293 Iovene et al. Nov 2015 B2
9203748 Jiang et al. Dec 2015 B2
9225638 Jain et al. Dec 2015 B2
9225659 McCanne et al. Dec 2015 B2
9232342 Seed et al. Jan 2016 B2
9258742 Pianigiani et al. Feb 2016 B1
9264313 Manuguri et al. Feb 2016 B1
9277412 Freda et al. Mar 2016 B2
9397946 Yadav Jul 2016 B1
9407540 Kumar et al. Aug 2016 B2
9407599 Koponen et al. Aug 2016 B2
9479358 Klosowski et al. Oct 2016 B2
9503530 Niedzielski Nov 2016 B1
9531590 Jain et al. Dec 2016 B2
9577845 Thakkar et al. Feb 2017 B2
9602380 Strassner Mar 2017 B2
9686192 Sengupta et al. Jun 2017 B2
9686200 Pettit et al. Jun 2017 B2
9705702 Foo et al. Jul 2017 B2
9705775 Zhang et al. Jul 2017 B2
9755898 Jain et al. Sep 2017 B2
9755971 Wang et al. Sep 2017 B2
9774537 Jain et al. Sep 2017 B2
9787605 Zhang et al. Oct 2017 B2
9804797 Ng et al. Oct 2017 B1
9825810 Jain et al. Nov 2017 B2
9860079 Cohn et al. Jan 2018 B2
9900410 Dalal Feb 2018 B2
9935827 Jain et al. Apr 2018 B2
9979641 Jain et al. May 2018 B2
9985896 Koponen et al. May 2018 B2
10013276 Fahs et al. Jul 2018 B2
10075470 Vaidya et al. Sep 2018 B2
10079779 Zhang et al. Sep 2018 B2
10084703 Kumar et al. Sep 2018 B2
10091276 Bloomquist et al. Oct 2018 B2
10104169 Moniz et al. Oct 2018 B1
10129077 Jain et al. Nov 2018 B2
10129180 Zhang et al. Nov 2018 B2
10135636 Jiang et al. Nov 2018 B2
10135737 Jain et al. Nov 2018 B2
10187306 Nainar et al. Jan 2019 B2
10200493 Bendapudi et al. Feb 2019 B2
10212071 Kancherla et al. Feb 2019 B2
10225137 Jain et al. Mar 2019 B2
10237379 Kumar et al. Mar 2019 B2
10250501 Ni Apr 2019 B2
10257095 Jain et al. Apr 2019 B2
10284390 Kumar et al. May 2019 B2
10320679 Jain et al. Jun 2019 B2
10333822 Jeuk et al. Jun 2019 B1
10341233 Jain et al. Jul 2019 B2
10341427 Jalan et al. Jul 2019 B2
10375155 Cai et al. Aug 2019 B1
10397275 Jain et al. Aug 2019 B2
10516568 Jain et al. Dec 2019 B2
10594743 Hong et al. Mar 2020 B2
10609091 Hong et al. Mar 2020 B2
10659252 Boutros et al. May 2020 B2
10693782 Jain et al. Jun 2020 B2
10708229 Sevinc et al. Jul 2020 B2
10757077 Rajahalme et al. Aug 2020 B2
10797910 Boutros et al. Oct 2020 B2
10797966 Boutros et al. Oct 2020 B2
10805181 Boutros et al. Oct 2020 B2
10805192 Boutros et al. Oct 2020 B2
10812378 Nainar et al. Oct 2020 B2
20020078370 Tahan Jun 2002 A1
20020097724 Halme et al. Jul 2002 A1
20020194350 Lu et al. Dec 2002 A1
20030065711 Acharya et al. Apr 2003 A1
20030093481 Mitchell et al. May 2003 A1
20030097429 Wu et al. May 2003 A1
20030105812 Flowers et al. Jun 2003 A1
20030236813 Abjanic Dec 2003 A1
20040066769 Ahmavaara et al. Apr 2004 A1
20040210670 Anerousis et al. Oct 2004 A1
20040215703 Song et al. Oct 2004 A1
20050021713 Dugan et al. Jan 2005 A1
20050089327 Ovadia et al. Apr 2005 A1
20050091396 Nilakantan et al. Apr 2005 A1
20050114429 Caccavale May 2005 A1
20050114648 Akundi May 2005 A1
20050132030 Hopen et al. Jun 2005 A1
20050198200 Subramanian et al. Sep 2005 A1
20050249199 Albert et al. Nov 2005 A1
20060069776 Shim et al. Mar 2006 A1
20060112297 Davidson May 2006 A1
20060130133 Andreev et al. Jun 2006 A1
20060155862 Kathi et al. Jul 2006 A1
20060195896 Fulp Aug 2006 A1
20060233155 Srivastava Oct 2006 A1
20070061492 Riel Mar 2007 A1
20070121615 Weill et al. May 2007 A1
20070214282 Sen Sep 2007 A1
20070260750 Feied et al. Nov 2007 A1
20070288615 Keohane et al. Dec 2007 A1
20070291773 Khan et al. Dec 2007 A1
20080005293 Bhargava et al. Jan 2008 A1
20080031263 Ervin et al. Feb 2008 A1
20080046400 Shi et al. Feb 2008 A1
20080049614 Briscoe et al. Feb 2008 A1
20080049619 Twiss Feb 2008 A1
20080049786 Ram et al. Feb 2008 A1
20080072305 Casado et al. Mar 2008 A1
20080084819 Parizhsky et al. Apr 2008 A1
20080095153 Fukunaga Apr 2008 A1
20080104608 Hyser et al. May 2008 A1
20080195755 Lu et al. Aug 2008 A1
20080225714 Denis Sep 2008 A1
20080239991 Applegate et al. Oct 2008 A1
20080247396 Hazard Oct 2008 A1
20080276085 Davidson et al. Nov 2008 A1
20080279196 Friskney et al. Nov 2008 A1
20090003349 Havemann et al. Jan 2009 A1
20090003364 Fendick et al. Jan 2009 A1
20090003375 Havemann et al. Jan 2009 A1
20090019135 Eswaran et al. Jan 2009 A1
20090063706 Goldman et al. Mar 2009 A1
20090129271 Ramankutty et al. May 2009 A1
20090172666 Yahalom et al. Jul 2009 A1
20090199268 Ahmavaara et al. Aug 2009 A1
20090235325 Dimitrakos et al. Sep 2009 A1
20090238084 Nadeau et al. Sep 2009 A1
20090249472 Litvin et al. Oct 2009 A1
20090265467 Peles et al. Oct 2009 A1
20090271586 Shaath Oct 2009 A1
20090299791 Blake et al. Dec 2009 A1
20090300210 Ferris Dec 2009 A1
20090303880 Maltz et al. Dec 2009 A1
20090307334 Maltz et al. Dec 2009 A1
20090327464 Archer et al. Dec 2009 A1
20100031360 Seshadri et al. Feb 2010 A1
20100036903 Ahmad et al. Feb 2010 A1
20100100616 Bryson et al. Apr 2010 A1
20100131638 Kondamuru May 2010 A1
20100223364 Wei Sep 2010 A1
20100223621 Joshi et al. Sep 2010 A1
20100235915 Memon et al. Sep 2010 A1
20100265824 Chao et al. Oct 2010 A1
20100281482 Pike et al. Nov 2010 A1
20100332595 Fullagar et al. Dec 2010 A1
20110010578 Dominguez et al. Jan 2011 A1
20110016348 Pace et al. Jan 2011 A1
20110022695 Dalal et al. Jan 2011 A1
20110022812 Van Der Linden et al. Jan 2011 A1
20110035494 Pandey et al. Feb 2011 A1
20110040893 Karaoguz et al. Feb 2011 A1
20110055845 Nandagopal et al. Mar 2011 A1
20110058563 Saraph et al. Mar 2011 A1
20110090912 Shippy Apr 2011 A1
20110164504 Bothos et al. Jul 2011 A1
20110194563 Shen et al. Aug 2011 A1
20110211463 Matityahu et al. Sep 2011 A1
20110225293 Rathod Sep 2011 A1
20110235508 Goel et al. Sep 2011 A1
20110261811 Battestilli et al. Oct 2011 A1
20110268118 Schlansker et al. Nov 2011 A1
20110271007 Wang et al. Nov 2011 A1
20110276695 Maldaner Nov 2011 A1
20110283013 Grosser et al. Nov 2011 A1
20110295991 Aida Dec 2011 A1
20110317708 Clark Dec 2011 A1
20120005265 Ushioda et al. Jan 2012 A1
20120014386 Xiong et al. Jan 2012 A1
20120023231 Ueno Jan 2012 A1
20120054266 Kazerani et al. Mar 2012 A1
20120089664 Igelka Apr 2012 A1
20120137004 Smith May 2012 A1
20120140719 Hui et al. Jun 2012 A1
20120144014 Natham et al. Jun 2012 A1
20120147894 Mulligan et al. Jun 2012 A1
20120155266 Patel et al. Jun 2012 A1
20120176932 Wu et al. Jul 2012 A1
20120185588 Error Jul 2012 A1
20120195196 Ghai et al. Aug 2012 A1
20120207174 Shieh Aug 2012 A1
20120213074 Goldfarb et al. Aug 2012 A1
20120230187 Tremblay et al. Sep 2012 A1
20120239804 Liu et al. Sep 2012 A1
20120246637 Kreeger et al. Sep 2012 A1
20120281540 Khan et al. Nov 2012 A1
20120287789 Aybay et al. Nov 2012 A1
20120303784 Zisapel et al. Nov 2012 A1
20120303809 Patel et al. Nov 2012 A1
20120311568 Jansen Dec 2012 A1
20120317260 Husain et al. Dec 2012 A1
20120317570 Dalcher et al. Dec 2012 A1
20120331188 Riordan et al. Dec 2012 A1
20130003735 Chao et al. Jan 2013 A1
20130031544 Sridharan et al. Jan 2013 A1
20130039218 Narasimhan et al. Feb 2013 A1
20130044636 Koponen et al. Feb 2013 A1
20130058346 Sridharan et al. Mar 2013 A1
20130073743 Ramasamy et al. Mar 2013 A1
20130125120 Zhang et al. May 2013 A1
20130136126 Wang et al. May 2013 A1
20130142048 Gross, IV et al. Jun 2013 A1
20130148505 Koponen et al. Jun 2013 A1
20130151661 Koponen et al. Jun 2013 A1
20130159487 Patel et al. Jun 2013 A1
20130160024 Shtilman et al. Jun 2013 A1
20130163594 Sharma et al. Jun 2013 A1
20130166703 Hammer et al. Jun 2013 A1
20130170501 Egi et al. Jul 2013 A1
20130201989 Hu et al. Aug 2013 A1
20130227097 Yasuda et al. Aug 2013 A1
20130227550 Weinstein et al. Aug 2013 A1
20130287026 Davie Oct 2013 A1
20130311637 Kamath et al. Nov 2013 A1
20130318219 Kancherla Nov 2013 A1
20130332983 Koorevaar et al. Dec 2013 A1
20130343378 Veteikis et al. Dec 2013 A1
20140003422 Mogul et al. Jan 2014 A1
20140010085 Kavunder et al. Jan 2014 A1
20140046997 Dain et al. Feb 2014 A1
20140046998 Dain et al. Feb 2014 A1
20140052844 Nayak et al. Feb 2014 A1
20140059204 Nguyen et al. Feb 2014 A1
20140059544 Koganty et al. Feb 2014 A1
20140068602 Gember et al. Mar 2014 A1
20140092738 Grandhi et al. Apr 2014 A1
20140092914 Kondapalli Apr 2014 A1
20140096183 Jain Apr 2014 A1
20140101226 Khandekar et al. Apr 2014 A1
20140101656 Zhu et al. Apr 2014 A1
20140115578 Cooper et al. Apr 2014 A1
20140129715 Mortazavi May 2014 A1
20140164477 Springer et al. Jun 2014 A1
20140169168 Jalan et al. Jun 2014 A1
20140169375 Khan et al. Jun 2014 A1
20140195666 Dumitriu et al. Jul 2014 A1
20140207968 Kumar et al. Jul 2014 A1
20140254374 Janakiraman et al. Sep 2014 A1
20140269724 Mehler et al. Sep 2014 A1
20140281029 Danforth Sep 2014 A1
20140282526 Basavaiah et al. Sep 2014 A1
20140301388 Jagadish et al. Oct 2014 A1
20140304231 Kamath et al. Oct 2014 A1
20140307744 Dunbar et al. Oct 2014 A1
20140310391 Sorenson et al. Oct 2014 A1
20140310418 Sorenson et al. Oct 2014 A1
20140317677 Vaidya et al. Oct 2014 A1
20140321459 Kumar Oct 2014 A1
20140330983 Zisapel et al. Nov 2014 A1
20140334485 Jain et al. Nov 2014 A1
20140351452 Bosch et al. Nov 2014 A1
20140362705 Pan Dec 2014 A1
20140369204 Anand et al. Dec 2014 A1
20140372567 Ganesh et al. Dec 2014 A1
20140372616 Arisoylu et al. Dec 2014 A1
20140372702 Subramanyam et al. Dec 2014 A1
20150003453 Sengupta et al. Jan 2015 A1
20150003455 Haddad et al. Jan 2015 A1
20150009995 Gross, IV et al. Jan 2015 A1
20150016279 Zhang Jan 2015 A1
20150023354 Li et al. Jan 2015 A1
20150026345 Ravinoothala et al. Jan 2015 A1
20150030024 Venkataswami et al. Jan 2015 A1
20150052262 Chanda et al. Feb 2015 A1
20150052522 Chanda et al. Feb 2015 A1
20150063102 Mestery et al. Mar 2015 A1
20150063364 Thakkar et al. Mar 2015 A1
20150071301 Dalal Mar 2015 A1
20150078384 Jackson et al. Mar 2015 A1
20150103645 Shen et al. Apr 2015 A1
20150103679 Tessmer et al. Apr 2015 A1
20150109901 Tan et al. Apr 2015 A1
20150124608 Agarwal et al. May 2015 A1
20150124622 Kovvali et al. May 2015 A1
20150124840 Bergeron May 2015 A1
20150139041 Bosch et al. May 2015 A1
20150146539 Mehta et al. May 2015 A1
20150156035 Foo et al. Jun 2015 A1
20150188770 Naiksatam et al. Jul 2015 A1
20150195197 Yong et al. Jul 2015 A1
20150213087 Sikri Jul 2015 A1
20150215819 Bosch et al. Jul 2015 A1
20150222640 Kumar et al. Aug 2015 A1
20150237013 Bansal et al. Aug 2015 A1
20150242197 Alfonso et al. Aug 2015 A1
20150271102 Antich Sep 2015 A1
20150280959 Vincent Oct 2015 A1
20150281089 Marchetti Oct 2015 A1
20150281098 Pettit et al. Oct 2015 A1
20150281125 Koponen et al. Oct 2015 A1
20150281179 Raman et al. Oct 2015 A1
20150281180 Raman et al. Oct 2015 A1
20150288671 Chan et al. Oct 2015 A1
20150288679 Ben-Nun et al. Oct 2015 A1
20150295831 Kumar et al. Oct 2015 A1
20150365322 Shatzkamer et al. Dec 2015 A1
20150370596 Fahs et al. Dec 2015 A1
20150372840 Benny et al. Dec 2015 A1
20150372911 Yabusaki et al. Dec 2015 A1
20150381494 Cherian et al. Dec 2015 A1
20150381495 Cherian et al. Dec 2015 A1
20160006654 Fernando et al. Jan 2016 A1
20160028640 Zhang et al. Jan 2016 A1
20160043901 Sankar et al. Feb 2016 A1
20160057050 Ostrom et al. Feb 2016 A1
20160057687 Horn et al. Feb 2016 A1
20160080253 Wang et al. Mar 2016 A1
20160087888 Jain et al. Mar 2016 A1
20160094384 Jain et al. Mar 2016 A1
20160094389 Jain et al. Mar 2016 A1
20160094451 Jain et al. Mar 2016 A1
20160094452 Jain et al. Mar 2016 A1
20160094453 Jain et al. Mar 2016 A1
20160094454 Jain et al. Mar 2016 A1
20160094455 Jain et al. Mar 2016 A1
20160094456 Jain et al. Mar 2016 A1
20160094457 Jain et al. Mar 2016 A1
20160094631 Jain et al. Mar 2016 A1
20160094632 Jain et al. Mar 2016 A1
20160094633 Jain et al. Mar 2016 A1
20160094642 Jain et al. Mar 2016 A1
20160094643 Jain et al. Mar 2016 A1
20160094661 Jain et al. Mar 2016 A1
20160105333 Lenglet Apr 2016 A1
20160119226 Guichard et al. Apr 2016 A1
20160127564 Sharma et al. May 2016 A1
20160134528 Lin et al. May 2016 A1
20160149816 Roach et al. May 2016 A1
20160164776 Biancaniello Jun 2016 A1
20160164787 Roach et al. Jun 2016 A1
20160164826 Riedel et al. Jun 2016 A1
20160173373 Guichard et al. Jun 2016 A1
20160182684 Connor et al. Jun 2016 A1
20160197839 Li et al. Jul 2016 A1
20160205015 Halligan et al. Jul 2016 A1
20160226700 Zhang et al. Aug 2016 A1
20160226754 Zhang et al. Aug 2016 A1
20160226762 Zhang et al. Aug 2016 A1
20160248685 Pignataro et al. Aug 2016 A1
20160277210 Lin et al. Sep 2016 A1
20160277294 Akiyoshi Sep 2016 A1
20160294612 Ravinoothala et al. Oct 2016 A1
20160294933 Hong et al. Oct 2016 A1
20160294935 Hong et al. Oct 2016 A1
20160308758 Li et al. Oct 2016 A1
20160337189 Liebhart et al. Nov 2016 A1
20160337249 Zhang et al. Nov 2016 A1
20160344565 Batz et al. Nov 2016 A1
20160344621 Roeland et al. Nov 2016 A1
20160352866 Gupta et al. Dec 2016 A1
20160366046 Anantharam et al. Dec 2016 A1
20160373364 Yokota Dec 2016 A1
20160378537 Zou Dec 2016 A1
20170005920 Previdi et al. Jan 2017 A1
20170005923 Babakian Jan 2017 A1
20170005988 Bansal et al. Jan 2017 A1
20170019329 Kozat et al. Jan 2017 A1
20170033939 Bragg et al. Feb 2017 A1
20170063683 Li et al. Mar 2017 A1
20170063928 Jain et al. Mar 2017 A1
20170064749 Jain et al. Mar 2017 A1
20170078176 Lakshmikantha et al. Mar 2017 A1
20170126497 Dubey et al. May 2017 A1
20170126522 McCann et al. May 2017 A1
20170134538 Mahkonen et al. May 2017 A1
20170142012 Thakkar et al. May 2017 A1
20170149582 Cohn et al. May 2017 A1
20170149675 Yang May 2017 A1
20170163531 Kumar et al. Jun 2017 A1
20170195255 Pham et al. Jul 2017 A1
20170208011 Bosch et al. Jul 2017 A1
20170230333 Glazemakers Aug 2017 A1
20170230467 Salgueiro et al. Aug 2017 A1
20170237656 Gage Aug 2017 A1
20170250902 Rasanen et al. Aug 2017 A1
20170250917 Ruckstuhl et al. Aug 2017 A1
20170264677 Li Sep 2017 A1
20170273099 Zhang et al. Sep 2017 A1
20170279938 You et al. Sep 2017 A1
20170295021 Gutiérrez et al. Oct 2017 A1
20170295100 Hira et al. Oct 2017 A1
20170310588 Zuo Oct 2017 A1
20170310611 Kumar et al. Oct 2017 A1
20170317926 Penno et al. Nov 2017 A1
20170317954 Masurekar et al. Nov 2017 A1
20170324651 Penno et al. Nov 2017 A1
20170331672 Fedyk et al. Nov 2017 A1
20170339110 Ni Nov 2017 A1
20170339600 Roeland et al. Nov 2017 A1
20170346764 Tan et al. Nov 2017 A1
20170364794 Mahkonen et al. Dec 2017 A1
20170373990 Jeuk et al. Dec 2017 A1
20180041524 Reddy et al. Feb 2018 A1
20180063018 Bosch et al. Mar 2018 A1
20180091420 Drake et al. Mar 2018 A1
20180115471 Curcio Apr 2018 A1
20180124061 Raman et al. May 2018 A1
20180139098 Sunavala et al. May 2018 A1
20180145899 Rao May 2018 A1
20180159733 Poon et al. Jun 2018 A1
20180159943 Poon et al. Jun 2018 A1
20180176177 Bichot et al. Jun 2018 A1
20180176294 Vacaro et al. Jun 2018 A1
20180184281 Tamagawa et al. Jun 2018 A1
20180198692 Ansari et al. Jul 2018 A1
20180198705 Wang et al. Jul 2018 A1
20180198791 Desai et al. Jul 2018 A1
20180213040 Pak et al. Jul 2018 A1
20180227216 Hughes Aug 2018 A1
20180234360 Narayana et al. Aug 2018 A1
20180248755 Hecker et al. Aug 2018 A1
20180248986 Dalal Aug 2018 A1
20180262427 Jain et al. Sep 2018 A1
20180262434 Koponen et al. Sep 2018 A1
20180278530 Connor et al. Sep 2018 A1
20180295053 Leung et al. Oct 2018 A1
20180302242 Hao et al. Oct 2018 A1
20180337849 Sharma et al. Nov 2018 A1
20180349212 Liu et al. Dec 2018 A1
20180351874 Abhigyan et al. Dec 2018 A1
20190020580 Boutros et al. Jan 2019 A1
20190020600 Zhang et al. Jan 2019 A1
20190020684 Qian et al. Jan 2019 A1
20190036819 Kancherla et al. Jan 2019 A1
20190068500 Hira Feb 2019 A1
20190089679 Kahalon et al. Mar 2019 A1
20190097838 Sahoo et al. Mar 2019 A1
20190132220 Boutros et al. May 2019 A1
20190132221 Boutros et al. May 2019 A1
20190140947 Zhuang et al. May 2019 A1
20190149516 Rajahalme et al. May 2019 A1
20190149518 Sevinc et al. May 2019 A1
20190166045 Peng et al. May 2019 A1
20190173778 Faseela et al. Jun 2019 A1
20190229937 Nagarajan et al. Jul 2019 A1
20190238363 Boutros et al. Aug 2019 A1
20190238364 Boutros et al. Aug 2019 A1
20190288947 Jain et al. Sep 2019 A1
20190306036 Boutros et al. Oct 2019 A1
20190306086 Boutros et al. Oct 2019 A1
20190342175 Wan et al. Nov 2019 A1
20190379578 Mishra et al. Dec 2019 A1
20190379579 Mishra et al. Dec 2019 A1
20200007388 Johnston et al. Jan 2020 A1
20200036629 Roeland et al. Jan 2020 A1
20200076684 Naveen et al. Mar 2020 A1
20200076734 Naveen et al. Mar 2020 A1
20200145331 Bhandari et al. May 2020 A1
20200162318 Patil et al. May 2020 A1
20200204492 Sarva et al. Jun 2020 A1
20200213366 Hong et al. Jul 2020 A1
20200272493 Lecuyer et al. Aug 2020 A1
20200272494 Gokhale et al. Aug 2020 A1
20200272495 Rolando et al. Aug 2020 A1
20200272496 Mundaragi et al. Aug 2020 A1
20200272497 Kavathia et al. Aug 2020 A1
20200272498 Mishra et al. Aug 2020 A1
20200272499 Feng et al. Aug 2020 A1
20200272500 Feng et al. Aug 2020 A1
20200272501 Chalvadi et al. Aug 2020 A1
20200274757 Rolando et al. Aug 2020 A1
20200274769 Naveen et al. Aug 2020 A1
20200274778 Lecuyer et al. Aug 2020 A1
20200274779 Rolando et al. Aug 2020 A1
20200274795 Rolando et al. Aug 2020 A1
20200274808 Mundaragi et al. Aug 2020 A1
20200274809 Rolando et al. Aug 2020 A1
20200274810 Gokhale et al. Aug 2020 A1
20200274826 Mishra et al. Aug 2020 A1
20200274944 Naveen et al. Aug 2020 A1
20200274945 Rolando et al. Aug 2020 A1
20200322271 Jain et al. Oct 2020 A1
20200366526 Boutros et al. Nov 2020 A1
20200366584 Boutros et al. Nov 2020 A1
Foreign Referenced Citations (15)
Number Date Country
1689369 Oct 2005 CN
101729412 Jun 2010 CN
103516807 Jan 2014 CN
103795805 May 2014 CN
2426956 Mar 2012 EP
2005311863 Nov 2005 JP
9918534 Apr 1999 WO
2008095010 Aug 2008 WO
2014182529 Nov 2014 WO
2016053373 Apr 2016 WO
2016054272 Apr 2016 WO
2019084066 May 2019 WO
2019147316 Aug 2019 WO
2020046686 Mar 2020 WO
2020171937 Aug 2020 WO
Non-Patent Literature Citations (18)
Entry
Author Unknown, “Datagram,” Jun. 22, 2012, 2 pages, retrieved from https://web.archive.org/web/20120622031055/https://en.wikipedia.org/wiki/datagram.
Author Unknown, “AppLogic Features,” Jul. 2007, 2 pages. 3TERA, Inc.
Author Unknown, “Enabling Service Chaining on Cisco Nexus 1000V Series,” Month Unknown, 2012, 25 pages, CISCO.
Casado, Martin, et al., “Virtualizing the Network Forwarding Plane,” Dec. 2010, 6 pages.
Dixon, Colin, et al., “An End to the Middle,” Proceedings of the 12th Conference on Hot Topics in Operating Systems, May 2009, 5 pages, USENIX Association, Berkeley, CA, USA.
Dumitriu, Dan Mihai, et al., (U.S. Appl. No. 61/514,990), filed Aug. 4, 2011, 31 pages.
Greenberg, Albert, et al., “VL2: A Scalable and Flexible Data Center Network,” SIGCOMM '09, Aug. 17-21, 2009, 12 pages, ACM, Barcelona, Spain.
Guichard, J., et al., “Network Service Chaining Problem Statement,” Network Working Group, Jun. 13, 2013, 14 pages, Cisco Systems, Inc.
Halpern, J., et al., “Service Function Chaining (SFC) Architecture,” draft-ietf-sfc-architecture-02, Sep. 20, 2014, 26 pages, IETF.
Joseph, Dilip Anthony, et al., “A Policy-aware Switching Layer for Data Centers,” Jun. 24, 2008, 26 pages, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA.
Karakus, Murat, et al., “Quality of Service (QoS) in Software Defined Networking (SDN): A Survey,” Journal of Network and Computer Applications, Dec. 9, 2016, 19 pages, vol. 80, Elsevier, Ltd.
Kumar, S., et al., “Service Function Chaining Use Cases in Data Centers,” draft-ietf-sfc-dc-use-cases-01, Jul. 21, 2014, 23 pages, IETF.
Liu, W., et al., “Service Function Chaining (SFC) Use Cases,” draft-liu-sfc-use-cases-02, Feb. 13, 2014, 17 pages, IETF.
Non-Published Commonly Owned U.S. Appl. No. 16/905,909, filed Jun. 18, 2020, 36 pages, Nicira, Inc.
Salsano, Stefano, et al., “Generalized Virtual Networking: An Enabler for Service Centric Networking and Network Function Virtualization,” 2014 16th International Telecommunications Network Strategy and Planning Symposium, Sep. 17-19, 2014, 7 pages, IEEE, Funchal, Portugal.
Sekar, Vyas, et al., “Design and Implementation of a Consolidated Middlebox Architecture,” 9th USENIX Symposium on Networked Systems Design and Implementation, Apr. 25-27, 2012, 14 pages, USENIX, San Jose, CA, USA.
Sherry, Justine, et al., “Making Middleboxes Someone Else's Problem: Network Processing as a Cloud Service,” In Proc. of SIGCOMM '12, Aug. 13-17, 2012, 12 pages, Helsinki, Finland.
Siasi, N., et al., “Container-Based Service Function Chain Mapping,” 2019 SoutheastCon, Apr. 11-14, 2019, 6 pages, IEEE, Huntsville, AL, USA.
Related Publications (1)
Number Date Country
20190149512 A1 May 2019 US