Fast distribution of port identifiers for rule processing

Information

  • Patent Grant
  • 11539659
  • Patent Number
    11,539,659
  • Date Filed
    Monday, August 30, 2021
    3 years ago
  • Date Issued
    Tuesday, December 27, 2022
    2 years ago
Abstract
Some embodiments of the invention provide a method for managing logical forwarding elements (LFEs) implemented by multiple physical forwarding elements (PFEs) operating on multiple devices, each LFE including multiple logical ports. On a host computer executing a particular machine connected to the LFE and a PFE implementing the LFE, the method identifies an address discovery message associating a particular network address of the particular machine with another network address of the particular machine. The method identifies an LFE logical port associated with the particular machine, stores in an encapsulation header an identifier that identifies this port, and then forwards the encapsulated message to a set of one or more devices implementing the LFE for the devices to use in processing data messages associated with the particular machine.
Description
BACKGROUND

Several context-based service and forward architectures have been proposed in recent years. One of these architectures uses logical port identifiers associated with the machines as the contextual attributes used for performing match classification operations on service and/or forwarding rules. This architecture uses control plane (e.g., a cluster of controllers) to distribute the logical port identifiers. However, control plane distribution of logical port identifiers can be slow in some embodiments as it requires data to be first provided to the control plane, and then to be distributed from the control plane to host computers.


SUMMARY

Some embodiments of the invention provide a method for implementing a logical network with one or more logical forwarding elements (LFEs), each with multiple logical ports. Each LFE in some embodiments is implemented by several physical forwarding elements (PFEs) operating on several devices. On a host computer executing a particular machine connected to a PFE implementing a particular LFE, the method identifies an address discovery message associating a particular network address (e.g., a layer 2 (L2) address or media access control (MAC) address) of the particular machine with a another network address (e.g., a layer 3 (L3) or an Internet Protocol (IP) address) of the particular machine. The network addresses (e.g., L2 and L3 addresses) in some embodiments are defined in a logical address space of the logical network.


In some embodiments, the method identifies the address discovery message by identifying this message as the message traverses along the egress datapath of the particular machine. The address discovery message is different in different embodiments. For instance, in some embodiments, the address discovery message is an address resolution protocol (ARP) message (e.g., an ARP reply or gratuitous ARP message), while in other embodiments it is neighbor discovery (ND) message.


The method identifies an LFE logical port associated with the particular machine, and stores in an encapsulation header an identifier that identifies this port. The method encapsulates the address discovery data message with this encapsulation header. Different embodiments use different encapsulating headers. For instance, in some embodiments, the method uses a Generic Network Virtualization Encapsulation (GENEVE) header, and stores the logical port identifier in a Type-Length-Value (TLV) field of this header.


After encapsulating the data message, the method forwards the message to a set of one or more devices implementing the LFE. Each device in the set of devices extracts the logical port identifier from the encapsulation header and stores this logical port identifier for use in processing data messages associated with the particular machine. In some embodiments, the set of devices uses the logical port identifier to identify service or forwarding rules for performing service or forwarding operations on data messages to or from the particular machine. For instance, in some embodiments, the set of devices uses the logical port identifier to apply a security policy associated with the particular logical port to data messages to or from the particular machine.


In some embodiments, the set of devices includes a device that sends an address resolution request to identify one network address (e.g., an L2 or L3 address) of the particular machine based on another network address (e.g., an L3 or L2 address) of the particular machine. For instance, the device in some embodiments sends an address resolution protocol (ARP) request in order to identify a MAC address of the particular machine based on an IP address of the particular machine. In these embodiments, the message identified by the method is an ARP reply message that provides the MAC address for an IP address provided in the ARP request.


In other embodiments, the set of devices includes several devices that execute several machines connected to the LFE. The address discovery message in some of these embodiments is a gratuitous address discovery message that is sent when the particular machine connects to the LFE or receives an updated network address for the LFE. For instance, the gratuitous address discovery message in some embodiments is a gratuitous ARP message sent in response to a change of the particular machine's L3 network address from a previous IP address to an updated IP address. In some embodiments, the new or updated IP address is assigned by a dynamic host configuration protocol (DHCP) process or server to the particular machine.


When a device in some embodiments receives the encapsulated message with the logical port identifier stored in the encapsulating header, the device removes the encapsulating header, extracts the identifier from the header, and passes the address discovery message to its intended destination (e.g., a machine or module executing on the device). The device in some embodiments also identifies the IP address of the particular machine from the received message, and stores an association of the particular IP address with the logical-port identifier. When the received data message provides an updated address for the particular machine, the device replaces the previous IP address in the previously created association with the new IP address in order to associate the new IP address with the logical port identifier.


After creating or updating the association between the IP address and the logical port identifier, the device receives a data message with the particular IP address as a source or destination address. For such a message, the device uses the stored association to identify the logical-port identifier associated with the data message, uses the logical port-identifier to identify a service or forwarding rule associated with the particular logical port, and then performs a service or forwarding operation on the data message based on the identified service rule.


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, the Detailed Description, the Drawings and the Claims is needed. Moreover, the claimed subject matters are not to be limited by the illustrative details in the Summary, the Detailed Description and the Drawing.





BRIEF DESCRIPTION OF FIGURES

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 illustrates a process of some embodiments of the invention.



FIG. 2 illustrates several machines that execute on several host computers along with several software switches that implement a logical switch.



FIG. 3 illustrates an example of a logical switch, which is part of a logical network 300.



FIG. 4 illustrates a Generic Network Virtualization Encapsulation (GENEVE) header.



FIG. 5 illustrates a process that a device in some embodiments performs when it receives an encapsulated address discovery message with the logical port identifier stored in the encapsulating header.



FIG. 6 illustrates an example of a service engine identifying and using a logical-port identifier to perform a service operation.



FIG. 7 illustrates a computer system used for some embodiments of the invention.





DETAILED DESCRIPTION

In the following detailed description of the invention, numerous details, examples, and embodiments of the invention are set forth and described. However, it will be clear and apparent to one skilled in the art 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 of the invention provide a method for implementing a logical network with one or more logical forwarding elements (LFEs), each with multiple logical ports. Each LFE in some embodiments is implemented by several physical forwarding elements (PFEs) operating on several devices. On a host computer executing a particular machine connected to a PFE implementing a particular LFE, the method identifies an address discovery message associating a particular network address (e.g., a layer 2 (L2) address or media access control (MAC) address) of the particular machine with a another network address (e.g., a layer 3 (L3) or an Internet Protocol (IP) address) of the particular machine.


The method then identifies an LFE logical port associated with the particular machine, encapsulates the address discovery message with an encapsulation header that stores the identified LFE logical port, and forwards the encapsulated message to a set of one or more devices implementing the LFE. Each device in the set of devices extracts the logical port identifier from the encapsulation header and store this logical port identifier for use in processing data messages associated with the particular machine. This method allows for datapath distribution of mapping between a logical port identifier and its associated network addresses, which is much faster than the traditional method of distributing this information through the control plane.


As used in this document, data messages refer to a collection of bits in a particular format sent across a network. One of ordinary skill in the art will recognize that the term data message is used in this document to refer to various formatted collections of bits that are sent across a network. The formatting of these bits can be specified by standardized protocols or non-standardized protocols. Examples of data messages following standardized protocols include Ethernet frames, IP packets, TCP segments, UDP datagrams, etc. Also, as used in this document, references to L2, L3, L4, and L7 layers (or layer 2, layer 3, layer 4, and layer 7) are references respectively to the second data link layer, the third network layer, the fourth transport layer, and the seventh application layer of the OSI (Open System Interconnection) layer model.



FIG. 1 illustrates a process 100 of some embodiments of the invention. This process will be explained by reference to FIG. 2, which illustrates a network 200 with several machines 205 that execute on several host computers 210 along with several software switches 215. Each host computer has an encapsulator/decapsulator module 235, a service storage 275 and a service module 285. The network 200 also includes a cluster of gateways 270 and a cluster of controllers 280.


The software switches 215 on the host computers 210 implement one or more logical switches to which the machines 205 connect. Each host also executes a software router (not shown) that along with other software routers implements one or more logical routers. FIG. 3 illustrates a logical network 300 formed by two logical switches 330, one logical router 310 and one logical gateway 320. In some embodiments, the logical gateway is implemented by software gateways executing on host computers and/or hardware gateways operating as standalone devices. In some embodiments, multiple physical switches, routers and gateways are configured to implement one or more logical switches, logical routers and logical gateways by cluster of controllers 280, which provide part of the control plane functionality of the network.


The process 100 in some embodiments is performed by the encapsulator/decapsulator module 235 called by an uplink port 230 of a software switch 215 executing on a host computer. As shown, the process 100 starts when the process identifies (at 105) an address discovery message that associates a particular layer 2 (L2) network address (e.g., a MAC address) of a particular machine 205 executing on the same host computer 210 with a layer 3 (L3) network address (e.g., an IP address) of the particular machine 205. The L2 and L3 addresses in some embodiments are defined in a logical address space of the logical network. The address discovery message is different in different embodiments. For instance, in some embodiments, the address discovery message is an address resolution protocol (ARP) message (e.g., an ARP reply or gratuitous ARP message), while in other embodiments it is neighbor discovery (ND) message.


In some embodiments, the process identifies the address discovery message as the message traverses along an egress datapath of the particular machine. For instance, in some embodiments, the identified address discovery message is sent by a machine 205a executing on a host computer 210a in response to an ARP or ND request received by the machine. In other embodiments, the address discovery message is a gratuitous address discovery message when a new or updated IP address has been assigned to the machine 205a. In some embodiments, another module (i.e., a module other than the machine 205a) executing on the host computer 210a sends the address discovery message when a new or updated IP address is assigned to the machine 205a.


In some embodiments, the encapsulator 235a executing on host computer 210a identifies the address discovery message associated with the machine 205a by receiving a notification from the uplink port 230a on this computer 210a. In these embodiments, the encapsulator 235a registers a hook with the uplink port 230a to have this port call the encapsulator to examine each address discovery message received at the uplink port for passing to the computer's NIC (not shown) for forwarding along the physical network 295. In other embodiments, the hook is set to provide to the encapsulator 235a each data message received at the uplink port, or the first set of one or more data messages of a flow received at the uplink port.


The uplink port 230a or the encapsulator 235a determines that a data message is an address discovery message based on header values of the data message (e.g., the header values that indicate that the data message is an ARP reply message, a gratuitous ARP message or an ND message). In the embodiments that the encapsulator is notified of the data messages received at the uplink port 230a, the encapsulator 235a examines the identified message to determine whether the message is an address discovery message. If the data message is not an address discovery message, the encapsulator does not perform the process 100.


For the particular machine with which the address discovery message is associated, the process identifies (at 110) a logical port of the logical switch to which the particular machine connects. For instance, in the examples illustrated in FIGS. 2 and 3, the encapsulator identifies the logical port 350 of the logical switch 330 as the logical port associated with the machine 205a that is associated with the address discovery message identified at 105. This logical port 350 corresponds to the port 250a of switch 215a of the host computer 210a. The uplink port 230a in some embodiments identifies this logical port by using the source IP address and/or source MAC address to lookup a record on the host computer 210a that associated one or both of these addresses with the identifier of the logical port.


At 115, the process stores the identified logical port identifier in an encapsulation header that it uses to encapsulate the identified address discovery message. Different embodiments use different encapsulating headers. For instance, in some embodiments, the process uses a Generic Network Virtualization Encapsulation (GENEVE) header 400 illustrated in FIG. 4, and stores the logical port identifier in a Type-Length-Value (TLV) field 420 of this header 400. As shown, the tunnel header 400 includes an outer header 405, a protocol field 410, a Geneve base header 415, and an option TLV 420.


The outer portion 405 of the tunnel header 400 includes the network addresses (e.g., source and destination IP addresses of the two endpoints of the tunnel, with the source and destination designation depending on the direction of the message flow) in the underlay network that allow the encapsulated data message to traverse the underlay network and reach the tunnel destination endpoint. The protocol field 410 specifies a UDP protocol as well as attributes associated with this protocol. The option TLV 420 includes a four-byte option header and a variable amount of option data interpreted according to the option type. The option data in some embodiments includes the identified logical port identifier.


After defining the encapsulation header at 115, the process encapsulates (at 120) the address discovery message with this header, and then forwards (at 125) the encapsulated message to a set of one or more destination devices for this message. For instance, in the example illustrated in FIG. 2, the encapsulator 235a encapsulates the address discovery message associated with the machine 205a, and directs the uplink port 230a to pass this message to the NIC (not shown) of the host computer 210a for forwarding along the physical network 295.


In some cases, the encapsulated data message has one destination and thereby is addressed to one destination device, while in other cases the encapsulated data message has multiple destinations and is a broadcast or multi-case message addressed to multiple destination devices. For example, in some embodiments, the set of destination devices includes a machine 205b that sends an ARP request to identify a MAC address associated with an IP address of the machine 205a. In these embodiments, the address discovery message is an ARP reply message that provides the MAC address for the IP address provided in the ARP request.


In some embodiments, the set of destination devices can include several devices that execute several machines connected to the LFE. The address discovery message in some embodiments is a gratuitous address discovery message that is sent when the particular machine (e.g., machine 205a) receives a new or updated network address for an LFE (e.g., logical switch 330) to which the machine connects. For instance, the gratuitous address discovery message in some embodiments is a gratuitous ARP message sent in response to a change of the IP address of machine 205a from a previous IP address to an updated IP address. In some embodiments, the machine that gets the new or updated IP address is the machine that sends the gratuitous address discovery message, while in other embodiments a module executing on the same host computer as this machine sends this message. In some embodiments, the new or updated IP address is assigned to the particular machine by a dynamic host configuration protocol (DHCP) process or server.


In some embodiments, the set of devices that receive the encapsulated address discovery message can also include controllers 280 and gateways 270. When the encapsulated address discovery message is for just one destination, the message is a unicast message that has a single destination address associated with one network node (e.g., one machine). On the other hand, when the encapsulated address discovery message has multiple destinations, the message in some embodiments is a broadcast or multi-case message addressed to broadcast or multi-cast address that is associated with multiple network nodes.


In the set of devices that receives the encapsulated address discovery message, each device in some embodiments extracts the logical port identifier from the encapsulation header and stores this logical port identifier for use in processing data messages associated with the particular machine. In some embodiments, the device uses the logical port identifier to identify service or forwarding rules for performing service or forwarding operations on data messages to or from the particular machine. For instance, in some embodiments, the set of devices uses the logical port identifier to apply a security policy (associated with the particular logical port) to data messages to or from the particular machine.



FIG. 5 illustrates a process 500 that a device in some embodiments performs when it receives an encapsulated address discovery message with the logical port identifier stored in the encapsulating header. In some embodiments, the process 500 is performed by the encap/decap processor 235 on a host computer that executes a machine that is the destination of the address discovery message. For instance, when the machine 205b on host computer 210b is the destination for an ARP reply (e.g., when the machine 205b sent an ARP request packet) or a gratuitous ARP packet, the encap/decap processor 235b performs the process 500 after the uplink port 230b receives the data message from the MC on this host computer and calls the encap/decap processor 235b.


As shown in FIG. 5, the process 500 initially removes (at 505) the encapsulating header from the received message, and extracts (at 510) the logical-port identifier from this header. It also extracts (at 515) the source IP address from the received address discovery message. This IP address is the IP address of the machine (e.g., machine 205a) connected to the logical port (e.g., the logical port 350) identified by the extracted logical port identifier.


Next, at 520, the process creates a record associating the extracted IP address with the extracted logical-port identifier, and stores this record in a mapping storage structure (e.g., storage 275b on host computer 210b). When the received data message provides an updated address for the particular machine, the device replaces the previous IP address in the previously created record with the new IP address in order to associate the new IP address with the logical port identifier. After creating or updating the record associating the extracted IP address and logical-port identifier, the process 500 passes (at 525) the decapsulated address discovery message to its destination (e.g., the encap/decap processor 235b passes the decapsulated ARP or ND packet back to the uplink port 230b so that it can pass this message to the destination machine 205b through the software switch 215b), and then ends.


The record created or updated at 520 is used subsequently to perform service and/or forwarding operations on the device that receives the encapsulated address discovery message in some embodiments. For instance, as shown in FIG. 2, a service engine 285b in some embodiments accesses the mapping storage structure 275b to identify the logical-port identifier associated with a data message that the service engine receives after the record is created or updated at 520. The service engine in some embodiments uses the received data message's source or destination IP address as an index into the mapping storage structure to identify the logical-port identifier associated with this IP address.


The service engine then uses the logical-port identifier retrieved from the mapping storage structure to perform a classification operation that matches the logical-port identifier with a set of match attributes of a service or forwarding rule that specifies a service or forwarding action for the engine to perform. FIG. 6 illustrates an example of such a classification operation. This figure illustrates a service engine 285 that includes a logical port identifying module 605, a group identifying module 610 and a service module 615.


The logical port identifying module 605 matches the source IP addresses and/or destination IP addresses of data messages with records in the mapping data storage 275, in order to identify source logical ports and/or destination logical ports that associates with these IP addresses. It then provides any identified logical port identifier(s) to the group identification module 610. The module 610 then matches the received logical port identifier(s) with records in a group identifier storage 625 that provides the group identifier for each logical port identifier. For each group, the group identifier storage in some embodiments includes a group member list that includes the logical port identifiers in that group.


After a source group identifier and/or a destination group identifier has been identified for a data message, the service operation then uses the source and destination group identifiers to identify the service rule to execute. The service engine uses service rules stored in a service rule storage 630 to perform service operations. Each service rule has (1) a set of match criteria defined in terms of one or more data message attributes, such as L2-L4 header values, group identifiers, contextual attributes, etc., and (2) one or more action parameters that specify the action that the service engine has to perform on a matching data message. FIG. 6 shows several service rules, each of which has a set of match criteria defined in terms of group identifiers. After matching a service rule match criteria with one or more logical port identifiers that it identifies for a data message, the service engine performs a service operation on the data message based on the matching service rule's action parameter.


In other embodiments, the records in the mapping-storage structure 275 are used to pre-process and convert service or forwarding rules that have match attributes defined in terms of logical port identifiers to service or forwarding rules that have match attributes defined in terms of IP addresses. In other embodiments, the service or forwarding rules are initially defined in terms of group identifiers, which are in turn defined in terms of one or more logical port identifiers. In some of these embodiments, the records in the mapping-storage structure are used to pre-process and convert service or forwarding rules that have match attributes defined in terms of group identifiers to service or forwarding rules that have match attributes defined in terms of IP addresses. In this pre-processing, the group identifiers are first resolved to their associated logical-port identifiers, which are then resolved to their IP addresses based on the records in the mapping storage structure.


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. 7 conceptually illustrates a computer system 700 with which some embodiments of the invention are implemented. The computer system 700 can be used to implement any of the above-described hosts, controllers, and managers. As such, it can be used to execute any of the above described processes. This computer system includes various types of non-transitory machine readable media and interfaces for various other types of machine readable media. Computer system 700 includes a bus 705, processing unit(s) 710, a system memory 725, a read-only memory 730, a permanent storage device 735, input devices 740, and output devices 745.


The bus 705 collectively represents all system, peripheral, and chipset buses that communicatively connect the numerous internal devices of the computer system 700. For instance, the bus 705 communicatively connects the processing unit(s) 710 with the read-only memory 730, the system memory 725, and the permanent storage device 735.


From these various memory units, the processing unit(s) 710 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 (ROM) 730 stores static data and instructions that are needed by the processing unit(s) 710 and other modules of the computer system. The permanent storage device 735, 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 computer system 700 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 735.


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


The bus 705 also connects to the input and output devices 740 and 745. The input devices enable the user to communicate information and select requests to the computer system. The input devices 740 include alphanumeric keyboards and pointing devices (also called “cursor control devices”). The output devices 745 display images generated by the computer 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 touchscreens that function as both input and output devices.


Finally, as shown in FIG. 7, bus 705 also couples computer system 700 to a network 765 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 computer system 700 may be used in conjunction with the invention.


Some embodiments include electronic components, such as microprocessors, 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” mean 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. For instance, in some embodiments, the logical port identifiers are used for other purposes than those described above. In some embodiments, the logical port identifiers are used as machine (VM or Pod) identifiers that are used to perform any number of forwarding or middlebox operations associated with the machines. Also, in some embodiments, other attributes of the machines are forwarded through the encapsulation headers that are used to forward the address discovery messages (e.g., the ARP replies, gratuitous ARP messages, ND messages, etc.). Thus, 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 for managing a logical forwarding element (LFE) implemented by a plurality of physical forwarding elements (PFEs) operating on a plurality of devices, the LFE used to forward data messages between a plurality of machines, the method comprising: on a host computer executing a particular machine in the plurality of machines and a PFE implementing the LFE: identifying an address discovery message associating a first network address of the particular machine with a second network address of the machine;identifying an attribute associated with the particular machine that is not a network address of the particular machine;storing the identified attribute in an encapsulation header; andforwarding the address discovery message encapsulated with the encapsulation header to a set of one or more devices implementing the LFE for the devices to use the stored attribute in processing data messages associated with the particular machine.
  • 2. The method of claim 1, wherein the set of devices use the attribute to identify service or forwarding rules for performing a service operation or a forwarding operation on data messages to or from the particular machine.
  • 3. The method of claim 1, wherein the set of devices use the attribute to apply a security policy to data messages to or from the particular machine.
  • 4. The method of claim 1, wherein identifying the address discovery message comprises receiving the address discovery message from the particular machine.
  • 5. The method of claim 1, wherein the set of devices comprises one device that sent an address resolution request to identify one network address of the particular machine based on another network address of the particular machine.
  • 6. The method of claim 5, wherein the message is an address resolution protocol (ARP) reply message, and the address resolution request is an ARP request message sent by the device in order to identify a MAC address of the particular machine based on an IP address of the particular machine.
  • 7. The method of claim 1, wherein the set of devices comprises a plurality of devices that execute a plurality of machines connected to the LFE, the address discovery message being a gratuitous address discovery message that is sent when particular machine connects to the LFE or receives an updated network address for the LFE.
  • 8. The method of claim 1, wherein the first network address is a layer 2 network address while the second network address is a layer 3 network address.
  • 9. The method of claim 8, wherein the gratuitous address discovery message is a gratuitous ARP message sent in response to a change of the particular machine's layer 3 network address from a previous IP address to an updated IP address.
  • 10. The method of claim 8, wherein the LFE is part of a logical network defined over a shared physical network, and the layers 2 and 3 network addresses are defined in layers 2 and 3 network addresses space of the logical network.
  • 11. A non-transitory machine readable medium storing a program for execution by at least one processing unit of a host computer and for managing a logical forwarding element (LFE) implemented by a plurality of physical forwarding elements (PFEs) operating on a plurality of devices, the LFE used to forward data messages between a plurality of machines, the host computer executing (i) a particular machine from the plurality of machines and (ii) a PFE implementing the LFE, the program comprising sets of instructions for: identifying an address discovery message associating a first network address of the particular machine with a second network address of the machine;identifying an attribute associated with the particular machine that is not a network address of the particular machine;storing the identified attribute in an encapsulation header; andforwarding the address discovery message encapsulated with the encapsulation header to a set of one or more devices implementing the LFE for the devices to use the stored attribute in processing data messages associated with the particular machine.
  • 12. The non-transitory machine readable medium of claim 11, wherein the set of devices use the identified attribute to identify service or forwarding rules for performing a service operation or a forwarding operation on data messages to or from the particular machine.
  • 13. The non-transitory machine readable medium of claim 11, wherein the set of devices use the identified attribute to apply a security policy to data messages to or from the particular machine.
  • 14. The non-transitory machine readable medium of claim 11, wherein identifying the address discovery message comprises receiving the address discovery message from the particular machine.
  • 15. The non-transitory machine readable medium of claim 11, wherein the set of devices comprises one device that sent an address resolution request to identify one network address of the particular machine based on another network address of the particular machine.
  • 16. The non-transitory machine readable medium of claim 15, wherein the message is an address resolution protocol (ARP) reply message, and the address resolution request is an ARP request message sent by the device in order to identify a MAC address of the particular machine based on an IP address of the particular machine.
  • 17. The non-transitory machine readable medium of claim 11, wherein the set of devices comprises a plurality of devices that execute a plurality of machines connected to the LFE, the address discovery message being a gratuitous address discovery message that is sent when particular machine connects to the LFE or receives an updated network address for the LFE.
  • 18. The non-transitory machine readable medium of claim 11, wherein the first network address is a layer 2 network address while the second network address is a layer 3 network address.
  • 19. The non-transitory machine readable medium of claim 18, wherein the gratuitous address discovery message is a gratuitous ARP message sent in response to a change of the particular machine's layer 3 network address from a previous IP address to an updated IP address.
  • 20. The non-transitory machine readable medium of claim 18, wherein the LFE is part of a logical network defined over a shared physical network, and the layers 2 and 3 network addresses are defined in layers 2 and 3 network addresses space of the logical network.
CLAIM OF BENEFIT TO PRIOR APPLICATIONS

The present Application is a continuation application of U.S. patent application Ser. No. 16/938,697, filed Jul. 24, 2020, now issued as U.S. Pat. No. 11,108,728. U.S. patent application Ser. No. 16/938,697, now issued as U.S. Pat. No. 11,108,728, is incorporated herein by reference.

US Referenced Citations (254)
Number Name Date Kind
5826051 Porter et al. Oct 1998 A
5950195 Stockwell et al. Sep 1999 A
6363477 Fletcher et al. Mar 2002 B1
6430188 Kadambi et al. Aug 2002 B1
6496935 Fink et al. Dec 2002 B1
6781990 Puri et al. Aug 2004 B1
6880089 Bommareddy et al. Apr 2005 B1
7055173 Chaganty et al. May 2006 B1
7349382 Marimuthu et al. Mar 2008 B2
7543054 Bansod et al. Jun 2009 B1
7639613 Ghannadian et al. Dec 2009 B1
7818452 Matthews et al. Oct 2010 B2
7843843 Papp, III et al. Nov 2010 B1
7948986 Ghosh et al. May 2011 B1
8031599 Duffield et al. Oct 2011 B2
8032933 Turley et al. Oct 2011 B2
8095662 Lappas et al. Jan 2012 B1
8190767 Maufer et al. May 2012 B1
8365294 Ross Jan 2013 B2
8381209 Reumann et al. Feb 2013 B2
8418249 Nucci et al. Apr 2013 B1
8484739 Seshadri Jul 2013 B1
8621556 Bharali et al. Dec 2013 B1
8655307 Walker et al. Feb 2014 B1
8660129 Brendel et al. Feb 2014 B1
8953453 Xiao et al. Feb 2015 B1
8966035 Casado et al. Feb 2015 B2
9009836 Yarykin et al. Apr 2015 B1
9015823 Koponen et al. Apr 2015 B2
9215214 Bansal et al. Dec 2015 B2
9317696 Ayres et al. Apr 2016 B2
9413667 Beliveau et al. Aug 2016 B2
9444841 Feroz et al. Sep 2016 B2
9565202 Kindlund et al. Feb 2017 B1
9596135 Thomas et al. Mar 2017 B1
9762619 Vaidya et al. Sep 2017 B1
9891940 Feroz et al. Feb 2018 B2
9893964 Mai Feb 2018 B2
9912699 Hebbar et al. Mar 2018 B1
9948611 Kumar et al. Apr 2018 B2
9996697 Mahaffey et al. Jun 2018 B2
9998955 MacCarthaigh Jun 2018 B1
10033693 Sengupta et al. Jul 2018 B2
10228959 Anderson et al. Mar 2019 B1
10324746 Kumar et al. Jun 2019 B2
10333983 Vaidya et al. Jun 2019 B2
10503536 Gunda Dec 2019 B2
10581960 Gunda et al. Mar 2020 B2
10606626 Feroz et al. Mar 2020 B2
10609160 Poon et al. Mar 2020 B2
10715607 Poon et al. Jul 2020 B2
10778651 Gunda et al. Sep 2020 B2
10798058 Sengupta et al. Oct 2020 B2
10802857 Gunda et al. Oct 2020 B2
10802858 Gunda Oct 2020 B2
10802893 Chanda et al. Oct 2020 B2
10803173 Gunda et al. Oct 2020 B2
10805332 Gunda et al. Oct 2020 B2
10812451 Gunda et al. Oct 2020 B2
10862773 Chanda et al. Dec 2020 B2
10938837 Kumar et al. Mar 2021 B2
11032246 Gunda et al. Jun 2021 B2
11108728 Boutros et al. Aug 2021 B1
11281485 Kumar et al. Mar 2022 B2
11327784 Gunda et al. May 2022 B2
20020116523 Warrier et al. Aug 2002 A1
20020122422 Kenney et al. Sep 2002 A1
20030005118 Williams Jan 2003 A1
20030093481 Mitchell et al. May 2003 A1
20030093672 Cichowlas May 2003 A1
20040049701 Pennec et al. Mar 2004 A1
20040098620 Shay May 2004 A1
20040117407 Kumar et al. Jun 2004 A1
20040162901 Mangipudi et al. Aug 2004 A1
20050080898 Block Apr 2005 A1
20050114711 Hesselink et al. May 2005 A1
20050198125 Beck et al. Sep 2005 A1
20050257244 Joly et al. Nov 2005 A1
20050286457 Foster et al. Dec 2005 A1
20060092861 Corday et al. May 2006 A1
20060109852 Hadjiahmad May 2006 A1
20070061492 Riel Mar 2007 A1
20070101432 Carpenter May 2007 A1
20070143851 Nicodemus et al. Jun 2007 A1
20080059474 Lim Mar 2008 A1
20080072305 Casado et al. Mar 2008 A1
20080267177 Johnson et al. Oct 2008 A1
20080289028 Jansen et al. Nov 2008 A1
20080298274 Takashige et al. Dec 2008 A1
20080301630 Arnold et al. Dec 2008 A1
20080316922 Riddle et al. Dec 2008 A1
20080320550 Strassner et al. Dec 2008 A1
20090007251 Abzarian et al. Jan 2009 A1
20090055427 Kulasingam et al. Feb 2009 A1
20090070442 Kacin et al. Mar 2009 A1
20090129271 Ramankutty et al. May 2009 A1
20090150521 Tripathi Jun 2009 A1
20090158432 Zheng et al. Jun 2009 A1
20090178061 Sandoval et al. Jul 2009 A1
20090187963 Bori Jul 2009 A1
20090193497 Kikuchi et al. Jul 2009 A1
20090228951 Ramesh et al. Sep 2009 A1
20090235325 Dimitrakos et al. Sep 2009 A1
20090249470 Litvin et al. Oct 2009 A1
20090249472 Litvin et al. Oct 2009 A1
20090254990 McGee et al. Oct 2009 A1
20090265414 Bryan Oct 2009 A1
20090281996 Liu et al. Nov 2009 A1
20090327781 Tripathi Dec 2009 A1
20100037311 He et al. Feb 2010 A1
20100100616 Bryson et al. Apr 2010 A1
20100125667 Soundararajan May 2010 A1
20100138515 Ruiz-Velasco et al. Jun 2010 A1
20100228819 Wei Sep 2010 A1
20100251363 Todorovic Sep 2010 A1
20110016467 Kane Jan 2011 A1
20110022695 Dalal et al. Jan 2011 A1
20110055848 Vainionpääet al. Mar 2011 A1
20110072486 Hadar et al. Mar 2011 A1
20110103259 Aybay et al. May 2011 A1
20110113467 Agarwal et al. May 2011 A1
20110126196 Cheung et al. May 2011 A1
20110208960 Flood Aug 2011 A1
20110225624 Sawhney et al. Sep 2011 A1
20110238581 Severson et al. Sep 2011 A1
20110246637 Murakami Oct 2011 A1
20120124126 Alcazar et al. May 2012 A1
20120158626 Zhu et al. Jun 2012 A1
20120207174 Shieh Aug 2012 A1
20120210423 Friedrichs et al. Aug 2012 A1
20120222114 Shanbhogue Aug 2012 A1
20120240182 Narayanaswamy et al. Sep 2012 A1
20120317570 Dalcher et al. Dec 2012 A1
20130007740 Kikuchi et al. Jan 2013 A1
20130007879 Esteban et al. Jan 2013 A1
20130013669 Chun et al. Jan 2013 A1
20130018994 Flavel et al. Jan 2013 A1
20130019276 Biazetti et al. Jan 2013 A1
20130073743 Ramasamy et al. Mar 2013 A1
20130085880 Roth et al. Apr 2013 A1
20130163594 Sharma et al. Jun 2013 A1
20130205366 Luna et al. Aug 2013 A1
20130219176 Akella et al. Aug 2013 A1
20130227097 Yasuda et al. Aug 2013 A1
20130227550 Weinstein et al. Aug 2013 A1
20130268751 Preiss et al. Oct 2013 A1
20130332983 Koorevaar et al. Dec 2013 A1
20140007222 Qureshi et al. Jan 2014 A1
20140020045 Kabat et al. Jan 2014 A1
20140040182 Gilder et al. Feb 2014 A1
20140059163 Herbrich et al. Feb 2014 A1
20140067779 Ojha Mar 2014 A1
20140068602 Gember et al. Mar 2014 A1
20140115578 Cooper et al. Apr 2014 A1
20140136681 Greenlee et al. May 2014 A1
20140143863 Deb et al. May 2014 A1
20140155043 Gell et al. Jun 2014 A1
20140173624 Kurabayashi Jun 2014 A1
20140195666 Dumitriu et al. Jul 2014 A1
20140215226 Litty et al. Jul 2014 A1
20140226820 Chopra et al. Aug 2014 A1
20140230008 Feroz et al. Aug 2014 A1
20140233385 Beliveau et al. Aug 2014 A1
20140237119 Chung et al. Aug 2014 A1
20140281030 Cui et al. Sep 2014 A1
20140282539 Sonnek Sep 2014 A1
20140282855 Clark et al. Sep 2014 A1
20150009995 Gross, IV Jan 2015 A1
20150012964 Xie et al. Jan 2015 A1
20150067818 Molander et al. Mar 2015 A1
20150082301 Garg et al. Mar 2015 A1
20150096007 Sengupta et al. Apr 2015 A1
20150106438 Fan et al. Apr 2015 A1
20150121061 Goyal et al. Apr 2015 A1
20150134822 Bhagwat et al. May 2015 A1
20150154293 Lu Jun 2015 A1
20150163117 Lambeth et al. Jun 2015 A1
20150169345 DeCusatis et al. Jun 2015 A1
20150172208 DeCusatis et al. Jun 2015 A1
20150229656 Shieh Aug 2015 A1
20150269383 Lang et al. Sep 2015 A1
20150281073 Kotha et al. Oct 2015 A1
20150350807 Andrews et al. Dec 2015 A1
20150358231 Zhang et al. Dec 2015 A1
20150358344 Mumcuoglu et al. Dec 2015 A1
20150379279 Feroz et al. Dec 2015 A1
20150381578 Thota et al. Dec 2015 A1
20160057014 Thakkar Feb 2016 A1
20160057167 Bach Feb 2016 A1
20160065456 Muley et al. Mar 2016 A1
20160072669 Saavedra Mar 2016 A1
20160087905 Liu et al. Mar 2016 A1
20160119194 Lopez et al. Apr 2016 A1
20160142287 Yang May 2016 A1
20160173329 Latham et al. Jun 2016 A1
20160191413 Feroz et al. Jun 2016 A1
20160191521 Feroz et al. Jun 2016 A1
20160212167 Dotan et al. Jul 2016 A1
20160224789 Feroz et al. Aug 2016 A1
20160226700 Zhang Aug 2016 A1
20160232024 Hamilton et al. Aug 2016 A1
20160234250 Ashley et al. Aug 2016 A1
20160241389 Saint et al. Aug 2016 A1
20160294923 Fan et al. Oct 2016 A1
20160315864 Tan et al. Oct 2016 A1
20160330138 Thomason Nov 2016 A1
20160337236 Hsu Nov 2016 A1
20160359658 Yadav et al. Dec 2016 A1
20170063883 Martinez Mar 2017 A1
20170063903 Muddu et al. Mar 2017 A1
20170093664 Lynam et al. Mar 2017 A1
20170099197 Raney Apr 2017 A1
20170118241 Call et al. Apr 2017 A1
20170126677 Kumar et al. May 2017 A1
20170170990 Gaddehosur et al. Jun 2017 A1
20170171143 Ge et al. Jun 2017 A1
20170171159 Kumar et al. Jun 2017 A1
20170230419 Prafullchandra et al. Aug 2017 A1
20170264628 Treat et al. Sep 2017 A1
20170302685 Ladnai et al. Oct 2017 A1
20170317978 Diaz-Cuellar et al. Nov 2017 A1
20180063160 Kumar Mar 2018 A1
20180063194 Vaidya et al. Mar 2018 A1
20180103011 Li et al. Apr 2018 A1
20180159733 Poon et al. Jun 2018 A1
20180159943 Poon et al. Jun 2018 A1
20180181423 Gunda et al. Jun 2018 A1
20180181754 Gunda Jun 2018 A1
20180181763 Gunda Jun 2018 A1
20180183759 Gunda et al. Jun 2018 A1
20180183761 Gunda et al. Jun 2018 A1
20180183764 Gunda Jun 2018 A1
20180183866 Gunda et al. Jun 2018 A1
20180191763 Hillard et al. Jul 2018 A1
20180212788 Iszlai Jul 2018 A1
20180212818 Ide et al. Jul 2018 A1
20180241761 Bania et al. Aug 2018 A1
20180331948 Jiang Nov 2018 A1
20180351912 Sengupta et al. Dec 2018 A1
20190034454 Gangumalla et al. Jan 2019 A1
20190036956 Gunda et al. Jan 2019 A1
20190075052 Chirreddy Mar 2019 A1
20190149525 Gunda et al. May 2019 A1
20190235934 Chanda et al. Aug 2019 A1
20190238429 Chanda et al. Aug 2019 A1
20190266004 Kumar et al. Aug 2019 A1
20190394302 Kristiansson et al. Dec 2019 A1
20200014662 Chanda et al. Jan 2020 A1
20200036608 Chanda et al. Jan 2020 A1
20200225978 Feroz et al. Jul 2020 A1
20200364074 Gunda et al. Nov 2020 A1
20210036990 Sengupta et al. Feb 2021 A1
20210081461 Zhou et al. Mar 2021 A1
20210218758 Jain et al. Jul 2021 A1
Foreign Referenced Citations (11)
Number Date Country
102446118 May 2012 CN
2748750 Jul 2014 EP
2016514295 May 2016 JP
2008095010 Aug 2008 WO
2013074828 May 2013 WO
2014126574 Aug 2014 WO
2014168936 Oct 2014 WO
2016161799 Oct 2016 WO
2018044352 Mar 2018 WO
2018106612 Jun 2018 WO
2018118465 Jun 2018 WO
Non-Patent Literature Citations (24)
Entry
Author Unknown, “CISCO Identity-Based Firewall Security,” Month Unknown 2011, 2 pages, CISCO Systems, Inc.
Author Unknown, “Enabling Service Chaining on Cisco Nexus 1000V Series,” Month Unknown, 2012, 25 pages, CISCO.
Author Unknown, “Next-Generation Firewalls,” Month Unknown 2013, 1 page, Palo Alto Networks.
Basak, Debashis, et al., “Virtualizing Networking and Security in the Cloud,” Month Unknown 2010, 9 pages, VMware, Inc., Palo Alto, CA.
Brownlee, N., et al., “Traffic Flow Measurement: Architecture,” RFC 2722, Oct. 1999, 48 pages, The Internet Society.
Casado, Martin, et al., “SANE: A Protection Architecture for Enterprise Networks,” Proceedings of the 15th USENIX Security Symposium, Jul. 31-Aug. 4, 2006, 15 pages, USENIX, Vancouver, Canada.
Deri, Luca, et al., “nDPI: Open-Source High-Speed Deep Packet Inspection,” 2014 International Wireless Communications and Mobile Computing Conference (IWCMC), Aug. 4-8, 2014, 6 pages, IEEE, Nicosia, Cyprus.
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.
Flegkas, Paris, et al., “On Policy-Based Extensible Hierarchical Network Management in QoS-Enabled IP Networks,” POLICY '01 Proceedings of the International Workshop on Policies for Distributed Systems and Networks, Jan. 29-31, 2011, 17 pages, Spring-Verlag, London, UK.
Guichard, J., et al., “Network Service Chaining Problem Statement,” Network Working Group, Jun. 13, 2013, 14 pages, Cisco Systems, Inc.
Ioannidis, Sotiris, et al., “Implementing a Distributed Firewall,” CCS '00, Month Unknown 2000, 10 pages, ACM, Athens, Greece.
Johnson, Maritza L., et al., “Laissez-faire File Sharing: Access Control Designed for Individuals at the Endpoints,” NSPW '09: Proceedings of the 2009 Workshop on New Security Paradigms Workshop, Sep. 8-11, 2009, 9 pages, ACM, Oxford, United Kingdom.
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.
Moshref, Masoud, et al., “vCRIB: Virtualized Rule Management in the Cloud,” HotCloud'12, Jun. 12-13, 2012, 6 pages.
Nance, Kara, et al., “Virtual Machine Introspection: Observation or Interference?,” IEEE Security and Privacy, Sep. 1, 2008, 6 pages, vol. 6, No. 5, IEEE Service Center, Los Alamitos, CA, US.
Rubino, Roberto D., “An Open System for Transparent Firewall Authentication and User Traffic Identification within Corporate Intranets,” SIGITE '08, Oct. 16-18, 2008, 5 pages, ACM, Cincinnati, OH, USA.
Scarfone, Karen, et al., “Guidelines on Firewalls and Firewall Policy: Recommendations of the National Institute of Standards and Technology,” Special Publication 800-41, Revision 1, Sep. 2009, 48 pages, NIST, U.S. Department of Commerce.
Schulz-Zander, Julius, et al., “Realizing Software-Defined Wireless Networks: Acheiving Fine-Grained Wi-Fi Programmability with Off-the-Shelf Hardware,” Apr. 20, 2016, 126 pages.
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.
Stojanovski, Nenad, et al., “Analysis of Identity Based Firewall Systems,” Jun. 2010, 9 pages.
Stojanovski, Nenad, et al., “Architecture Of A Identity Based Firewall System,” Jul. 2011, 9 pages.
Non-Published Commonly Owned U.S. Appl. No. 17/739,534, filed May 9, 2022, 99 pages, Nicira, Inc.
Related Publications (1)
Number Date Country
20220029950 A1 Jan 2022 US
Continuations (1)
Number Date Country
Parent 16938697 Jul 2020 US
Child 17461900 US