Today, many server clusters exist in datacenters to provide certain compute or service operations. Examples of these clusters include Webservers, Application Servers, Database Servers, middlebox services (e.g., firewalls, intrusion detection systems, intrusion prevention systems, etc.). Datacenters typically associate each server cluster with a shared virtual IP (VIP) address, and use extensible load balancer clusters to distribute the load across the servers in each cluster by selecting different servers for different data message flows and forwarding the data message flows to the selected servers. To perform their load balancing operations, the load balancers perform a network address translation (NAT) operation to replace the shared VIP address with the address of the selected servers so that the data messages can be forwarded to the severs.
Many stateful load balancers also perform another NAT operation that replaces the source IP address of the data messages from the IP addresses of the client machines that sent the data messages to the IP address of the stateful load balancers to ensure that the return traffic from the servers comes back to the load balancers so that they can perform their stateful services. By performing this other NAT operation, the load balancer hides the client IP address from the servers. However, many servers need to know the client IP addresses in order to perform their operations properly (e.g., for persistent application delivery). As a result of the removed client IP, existing servers and/or supporting infrastructure have developed complex techniques (such as cookie persistence) or use additional header information to support the server operations that need the client IP data.
Some embodiments of the invention provide a method for forwarding data messages between a client and a server (e.g., between client and server machines and/or applications). In some embodiments, the method receives a data message that a load balancer has directed from a particular client to a particular server after selecting the particular server from a set of several candidate servers for the received data message's flow. The method stores an association between an identifier associated with the load balancer and a flow identifier associated with the message flow, and then forwards the received data message to the particular server.
The method subsequently uses the load balancer identifier in the stored association to forward to the particular load balancer a data message that is sent by the particular server. In some embodiments, the data message that is sent by the particular server is addressed to the particular client. The load balancer in some embodiments is a particular load balancer from a set of two or more load balancers each of which select servers for data message flows from the set of candidate servers. The particular load balancer is selected for the received data message's flow by another network element, e.g., by a front-end load balancer. As further described below, the method in some embodiments is implemented by an intervening forwarding element (e.g., a router) between the load balancer set and the server set.
To store the association between the load balancer identifier and the received message's flow identifier, the method in some embodiments creates and stores an L2 or L3 redirection record (i.e., a record that specifies a layer 2 or 3 redirection) for data messages sent from the particular server to the particular client in response to the received data message. For instance, the L2 redirection record of some embodiments is a policy-based routing (PBR) record that stores a MAC address of the particular load balancer as the load balancer identifier. The method in some of these embodiments replaces the destination MAC address of the data message sent by the particular server with the MAC address of the particular load balancer.
In other embodiments, the redirection record is an L3-redirection PBR record that identifies a tunnel (e.g., stores a tunnel identifier that identifies the tunnel) to a device implementing the particular load balancer (e.g., to a load-balancing appliance or to a host executing the load balancer). In these embodiments, the method uses the tunnel identifier to identify a tunnel to forward the data message sent by the particular server to the particular load balancer.
As mentioned above, the method in some embodiments is performed by an intervening forwarding element between the load balancer set and the server set. This intervening forwarding element in some embodiments is a router that executes on a host computer along with the particular server, while in other embodiments it is a router outside of this host computer. In some embodiments, the intervening forwarding element redirects the data message sent by the particular server (e.g., sent by the particular server to the default gateway) to the load balancer specified in the L2 or L3 redirection record that the intervening forwarding element previously created for the connection between the particular client and particular server.
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 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.
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 forwarding data messages between clients and servers (e.g., between client and server machines and/or applications). In some embodiments, the method receives a data message that a load balancer has directed from a particular client to a particular server after selecting the particular server from a set of candidate servers for a message flow of the received data message. The method stores an association between an identifier associated with the load balancer and a flow identifier associated with the message flow, and then forwards the received data message to the particular server. The method subsequently uses the load balancer identifier in the stored association to forward to the particular load balancer a data message that the particular server sends to the particular client.
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.
In some embodiments, the network 100 is a virtual private cloud that is implemented in a datacenter to segregate one set of machines in the datacenter from other machines in the datacenter, e.g., one tenant's machines from other tenant machines or one department's machines from other departments machines, etc. In some embodiments, the virtual private cloud is implemented as a logical overlay network, which is established by configuring shared forwarding and middlebox elements (e.g., shared hardware and/or software routers, switches and middlebox services) to implement logical forwarding and middlebox elements. One logical forwarding element (e.g., one logical router or switch) in some embodiments is implemented by multiple physical forwarding elements (e.g., multiple hardware or software routers or switches) and spans multiple physical devices, such as multiple standalone hardware routers or switches, and/or multiple host computers that execute the software routers or switches.
The example presented in
As shown, the front-end load balancer FLB1105 receives this data message 150, selects stateful load balancer LB1 from the stateful load balancer set 110 for this data message's flow, and forwards the received data message 150 to load balancer LB1. In some embodiments, this front-end load balancer FLB1105 selects the stateful load balancer LB1 by generating a hash value of the flow identifier (e.g., five tuple identifier) of the received data message 150, and mapping this hash value to the load balancer LB1 (e.g., by using a mapping table that maps different ranges of hash values to different stateful load balancers 110). The front-end load balancer is a stateless load balancer in some embodiments that does not create a connection-tracking record for the received data message's flow, but rather regenerates the hash value for each received message to map each message to its flow's associated stateful load balancer.
The stateful load balancers 110 use a set of load balancing criteria to select server machines 120 for different data message flows from the client machines 125. Weight values are examples of load balancing criteria that are used in some embodiments. In some embodiments, the load balancer uses weight values to implement a weighted round robin scheme to spread the data message flows among the servers. As one example, assume that there are five servers 120 and the weight values for the servers are 1, 3, 1, 3, and 2. Based on these values, a stateful load balancer would distribute data messages that are part of ten new flows such as follows: 1 to the first server, 3 to the second server, 1 to the third server, 3 to the fourth server, and 2 to the fifth server. The load balancer would follow a similar distribution scheme for each subsequent set of ten data message flows.
After receiving the data message 150, the load balancer LB1 uses its load balancing criteria to select the server S1 from the server set 120 for the received data message's flow. The load balancer LB1 then replaces the server set's VIP address in the destination IP field in the data message's header with the destination IP (DIP) address of the selected server S1, and forwards the data message 150 along the network 100 for forwarding to the server S1.
In addition to replacing the VIP address with the DIP address, the load balancer also replaces the source MAC address of the data message 150 with its own source MAC address in some embodiments. However, the load balancer LB1 does not change the source IP address of the data message 150. This is because the server S1 needs to be able to identify client A (from the source IP address) in order to perform its operation.
The load balancer LB1 also creates two connection-tracking records 152 and 154 in its connection-tracking storage (not shown) for the data message flow. The first connection tracking record 152 is for data messages in the same flow as the received data message 150, while the second connection tracking record 154 is for the data messages in the reverse flow from the server S1 to the client A.
The forward connection-tracking record 152 associates the forwarding flow's identifier (e.g., the five-tuple identifier) with the DIP of the server S1 that the load balancer LB1 selected for the flow of the received data message 150. The reverse connection tracking record 152 associates the reverse flow's identifier (e.g., the five-tuple identifier of the flow from server S1 to the client A) with the VIP of the server set 120. As further described below, the load balancer LB1 uses the reverse connection-tracking record for replacing the source IP address of the data messages in the reverse flow that it receives from the server S1 to the VIP address. Instead of creating and using two connection-tracking records, the load balancer LB1 in some embodiments creates only one connection-tracking record for both the forward and reverse flows and simply uses different fields in the created tracking record for performing its matching and data retrieval operations.
An intervening router R1 receives the data message 150 that the load balancer LB1 has directed to the server S1 after selecting this server from the set of candidate servers 120 for the received data message's flow. This intervening router R1 is part of a collection of intervening routers (115) that are configured to implement some embodiments of the invention. These intervening routers (115) are implemented differently in different embodiments. In some embodiments, these intervening routers (115) are software routing instances executing on the same host computers as the servers of the server set 120. In other embodiments, these routers (115) are standalone hardware routers. In still other embodiments, the intervening routers (115) are gateway software or hardware routers at the edge of the network 100. Several examples of different types of routers (115) will be further described below by reference to
The intervening router R1 defines an association between an identifier of the load balancer LB1 and a flow identifier associated with the flow of the received data message 150, and then forwards the received data message 150 to the particular server. In the example illustrated in
The router R1 creates this record so that it can subsequently use the load balancer identifier stored in this record to redirect (i.e., to forward) to the load balancer LB1 the data messages that the server S1 sends back to the client A in response to the flow of the received data message 150. The load balancer LB1 needs to receive the data messages of the reverse flow as it is a stateful load balancer that needs to process the data messages of the forward flow and the reverse flow.
The intervening router R1 creates different redirection records 156 in different embodiments. For instance, in some embodiments, the router R1 creates an L2 redirection record, while in other embodiments it creates an L3 redirection record.
As shown, the redirection record 200 is a policy-based routing (PBR) record that associates the MAC address 204 of the load balancer LB1 with an identifier 202 of the reverse flow from the server S1 to the client A. The router R1 creates this record based on the source MAC address of the data message 150 that it receives from the load balancer. The router R1 matches the flow identifier of the data messages in the reverse flow with the flow identifier 202 stored in the redirection record 200, and then replaces the destination MAC address of the data messages in the reverse flow with the LB1's MAC address 204 stored in the redirection record 200.
With this new MAC address 204, the reverse flow data messages will be forwarded to the load balancer LB1 through intervening network fabric 220. In some embodiments, the reverse flow data messages are forwarded from the device that implements the router R1 to the device that implements load balancer LB1 through a tunnel. In these embodiments, the router R1 and the load balancer LB1 are part of a logical overlay network that is established through the use of tunnels between devices that execute the machines, forwarding elements, and middlebox elements of the logical overlay network.
The router R1 creates the L3 redirection record 300 when it receives the data message 150 from the load balancer LB1 through a tunnel. The router R1 matches the flow identifier of the data messages in the reverse flow with the flow identifier 302 stored in the redirection record 300, and then identifies a tunnel 320 to use based on the tunnel identifier 304 stored in the record 300. As shown, the identified tunnel 320 is one of several tunnels between the router R1 and several load balancers in the stateful load balancer cluster 110.
After identifying the tunnel 320 for a data message of the reverse flow, the router R1 encapsulates the data message with a tunnel header that stores the source and destination attributes associated with the identified tunnel 320, and then forwards the encapsulated data message to the load balancer LB1 along this tunnel 320 (e.g., performs another lookup based on the tunnel identifier 304 to identify the interface through which the data message has to exit the router). With its encapsulating tunnel header 310, the reverse flow data message is forwarded to the load balancer LB1 through intervening network fabric 330.
As shown, the process initially determines (at 405) that the data message is directed to a server of a server cluster by a load balancer. In some embodiments, the process 400 makes this determination by matching the received data message's destination attributes with one of its policies that is defined for the server addressed by the data message.
Next, at 410, the process 400 creates a redirection record that associates the load balancer that selected the server for the flow with the identifier of the flow or the reverse flow. As illustrated by
At 415, the process 400 forwards the first data message to the server addressed by the destination IP address. Next, at 420, the process 400 uses its redirection record to forward to the server-selecting load balancer associated with the forward data message flow, the data messages of the reverse flow from the server to the client. When the redirection record is an L2 redirection record (such as record 200), the process 400 in some embodiments replaces the destination MAC address of the data message sent by the server with the MAC address of the particular load balancer. Alternatively, when the redirection record is an L3 redirection record (such as record 300), the process 400 identifies the tunnel to the load balancer from the redirection record, encapsulates the data messages of the reverse flow with tunnel headers that store the source and destination attributes associated with the identified tunnel, and then forwards the encapsulated data messages to the load balancer associated with this tunnel.
The redirecting intervening routers 115 in this example are the managed software routers 515 executing on the host computers 530 on which the servers 520 execute. These routers 515 are configured by a set of controllers 550 to forward data messages received from the load balancers 510 to the servers 520 executing on their host computers 530 through software managed switches 555 executing on the host computers.
The routers 515 are also configured by the controller set 550 (1) to create L2 or L3 redirection records for new data message flows that they receive for their respective servers from the load balancers 510, and (2) to use these redirection records to forward the reverse flows that the servers 520 send in response to the received flow back to the load balancers that selected the servers. When multiple servers 520 of the server cluster 120 execute on a host computer 530, the managed software router 515 on the host computer 530 performs this operation for these servers 520.
In some embodiments, the controller set 550 configures multiple managed software routers 515 executing on multiple host computers 530 to implement a logical router that spans the host computers 530. When the network 500 supports multi-tenancy, the controller set 550 configures the managed software routers 515 executing on the host computers 530 to implement different logical routers for different tenants, with each logical router spanning one or more host computers 530.
Similarly, the controller set 550 in some embodiments configures multiple managed software switches 555 executing on multiple host computers 530 as a logical router that spans the host computers 530. The controller set 550 in some embodiments also configures the load balancers 510 with load balancing criteria and forwarding rules for selecting servers 520 in the server cluster 120 for different message flows and for forwarding the data message flows to the servers 520. The load balancers 510 receive the data message flows from the front-end load balancers 505 which forward data messages flows that they receive from the gateways 507 that serve as the edge forwarding elements between the datacenter's network and an external network 570. In this example, the client machines 525 that send the data messages to the server cluster's VIP address, and that receive the reverse flow from the servers in this cluster, are in the external network 570.
In the example illustrated in
The controller set 650 configures the gateways 607 to select the load balancers 610 for the data message flows, and to create and use the redirection records. In some embodiments, the servers 620 or routers 615 that execute on the same host computers 630 as the servers 620 are configured to forward the reverse flows from the servers 620 to the gateways 607 (e.g., acting as the default gateways of the subnets of the servers). In this manner, the gateways 607 (1) receive the reverse flows from the servers 620 to the clients 625, (2) redirect these flows to the load balancers 610 that selected the servers for the associated forward flows, and then (3) forward these flows to the clients 625 through the external network 670.
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.
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 740 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
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. 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.
Number | Name | Date | Kind |
---|---|---|---|
5504921 | Dev et al. | Apr 1996 | A |
5550816 | Hardwick et al. | Aug 1996 | A |
5751967 | Raab et al. | May 1998 | A |
6006275 | Picazo et al. | Dec 1999 | A |
6104699 | Holender et al. | Aug 2000 | A |
6219699 | McCloghrie et al. | Apr 2001 | B1 |
6359909 | Ito et al. | Mar 2002 | B1 |
6456624 | Eccles et al. | Sep 2002 | B1 |
6512745 | Abe et al. | Jan 2003 | B1 |
6539432 | Taguchi et al. | Mar 2003 | B1 |
6680934 | Cain | Jan 2004 | B1 |
6785843 | McRae et al. | Aug 2004 | B1 |
6941487 | Balakrishnan et al. | Sep 2005 | B1 |
6950428 | Horst et al. | Sep 2005 | B1 |
6963585 | Pennec et al. | Nov 2005 | B1 |
6999454 | Crump | Feb 2006 | B1 |
7046630 | Abe et al. | May 2006 | B2 |
7197572 | Matters et al. | Mar 2007 | B2 |
7200144 | Terrell et al. | Apr 2007 | B2 |
7209439 | Rawlins et al. | Apr 2007 | B2 |
7260648 | Tingley et al. | Aug 2007 | B2 |
7283473 | Arndt et al. | Oct 2007 | B2 |
7302484 | Stapp et al. | Nov 2007 | B1 |
7342916 | Das et al. | Mar 2008 | B2 |
7391771 | Orava et al. | Jun 2008 | B2 |
7450598 | Chen et al. | Nov 2008 | B2 |
7463579 | Lapuh et al. | Dec 2008 | B2 |
7478173 | Delco | Jan 2009 | B1 |
7483411 | Weinstein et al. | Jan 2009 | B2 |
7555002 | Arndt et al. | Jun 2009 | B2 |
7606260 | Oguchi et al. | Oct 2009 | B2 |
7643488 | Khanna et al. | Jan 2010 | B2 |
7649851 | Takashige et al. | Jan 2010 | B2 |
7710874 | Balakrishnan et al. | May 2010 | B2 |
7764599 | Doi et al. | Jul 2010 | B2 |
7792987 | Vohra et al. | Sep 2010 | B1 |
7818452 | Matthews et al. | Oct 2010 | B2 |
7826482 | Minei et al. | Nov 2010 | B1 |
7839847 | Nadeau et al. | Nov 2010 | B2 |
7885276 | Lin | Feb 2011 | B1 |
7936770 | Frattura et al. | May 2011 | B1 |
7937438 | Miller et al. | May 2011 | B1 |
7948986 | Ghosh et al. | May 2011 | B1 |
7953865 | Miller et al. | May 2011 | B1 |
7991859 | Miller et al. | Aug 2011 | B1 |
7995483 | Bayar et al. | Aug 2011 | B1 |
8027354 | Portolani et al. | Sep 2011 | B1 |
8031633 | Bueno et al. | Oct 2011 | B2 |
8046456 | Miller et al. | Oct 2011 | B1 |
8054832 | Shukla et al. | Nov 2011 | B1 |
8055789 | Richardson et al. | Nov 2011 | B2 |
8060875 | Lambeth | Nov 2011 | B1 |
8131852 | Miller et al. | Mar 2012 | B1 |
8149737 | Metke et al. | Apr 2012 | B2 |
8155028 | Abu-Hamdeh et al. | Apr 2012 | B2 |
8166201 | Richardson et al. | Apr 2012 | B2 |
8194674 | Pagel et al. | Jun 2012 | B1 |
8199750 | Schultz et al. | Jun 2012 | B1 |
8223668 | Allan et al. | Jul 2012 | B2 |
8224931 | Brandwine et al. | Jul 2012 | B1 |
8224971 | Miller et al. | Jul 2012 | B1 |
8239572 | Brandwine et al. | Aug 2012 | B1 |
8259571 | Raphel et al. | Sep 2012 | B1 |
8265075 | Pandey | Sep 2012 | B2 |
8281067 | Stolowitz | Oct 2012 | B2 |
8312129 | Miller et al. | Nov 2012 | B1 |
8339959 | Moisand et al. | Dec 2012 | B1 |
8339994 | Gnanasekaran et al. | Dec 2012 | B2 |
8345650 | Foxworthy et al. | Jan 2013 | B2 |
8351418 | Zhao et al. | Jan 2013 | B2 |
8370834 | Edwards et al. | Feb 2013 | B2 |
8456984 | Ranganathan et al. | Jun 2013 | B2 |
8504718 | Wang et al. | Aug 2013 | B2 |
8565108 | Marshall et al. | Oct 2013 | B1 |
8611351 | Gooch et al. | Dec 2013 | B2 |
8612627 | Brandwine | Dec 2013 | B1 |
8625594 | Safrai et al. | Jan 2014 | B2 |
8625603 | Ramakrishnan et al. | Jan 2014 | B1 |
8625616 | Vobbilisetty et al. | Jan 2014 | B2 |
8627313 | Edwards et al. | Jan 2014 | B2 |
8644188 | Brandwine et al. | Feb 2014 | B1 |
8660129 | Brendel et al. | Feb 2014 | B1 |
8705513 | Merwe et al. | Apr 2014 | B2 |
8958298 | Zhang et al. | Feb 2015 | B2 |
9059999 | Koponen et al. | Jun 2015 | B2 |
10063458 | Zhang et al. | Aug 2018 | B2 |
10212071 | Kancherla et al. | Feb 2019 | B2 |
10693763 | Zhang et al. | Jun 2020 | B2 |
10742746 | Kancherla et al. | Aug 2020 | B2 |
10826827 | Natal et al. | Nov 2020 | B1 |
11095480 | Natarajan et al. | Aug 2021 | B2 |
20010043614 | Viswanadham et al. | Nov 2001 | A1 |
20020093952 | Gonda | Jul 2002 | A1 |
20020186705 | Kadambi | Dec 2002 | A1 |
20020194369 | Rawlins et al. | Dec 2002 | A1 |
20030041170 | Suzuki | Feb 2003 | A1 |
20030058850 | Rangarajan et al. | Mar 2003 | A1 |
20030069972 | Yoshimura et al. | Apr 2003 | A1 |
20030179742 | Ogier et al. | Sep 2003 | A1 |
20030225857 | Flynn et al. | Dec 2003 | A1 |
20040073659 | Rajsic et al. | Apr 2004 | A1 |
20040098505 | Clemmensen | May 2004 | A1 |
20040267866 | Carollo et al. | Dec 2004 | A1 |
20050018669 | Arndt et al. | Jan 2005 | A1 |
20050027881 | Figueira et al. | Feb 2005 | A1 |
20050053079 | Havala | Mar 2005 | A1 |
20050083953 | May | Apr 2005 | A1 |
20050120160 | Plouffe et al. | Jun 2005 | A1 |
20050132044 | Guingo et al. | Jun 2005 | A1 |
20060002370 | Rabie et al. | Jan 2006 | A1 |
20060018253 | Windisch et al. | Jan 2006 | A1 |
20060026225 | Canali et al. | Feb 2006 | A1 |
20060029056 | Perera et al. | Feb 2006 | A1 |
20060056412 | Page | Mar 2006 | A1 |
20060092940 | Ansari et al. | May 2006 | A1 |
20060092976 | Lakshman et al. | May 2006 | A1 |
20060174087 | Hashimoto et al. | Aug 2006 | A1 |
20060187908 | Shimozono et al. | Aug 2006 | A1 |
20060193266 | Siddha et al. | Aug 2006 | A1 |
20060291388 | Amdahl et al. | Dec 2006 | A1 |
20070043860 | Pabari | Feb 2007 | A1 |
20070064673 | Bhandaru et al. | Mar 2007 | A1 |
20070140128 | Klinker et al. | Jun 2007 | A1 |
20070156919 | Potti et al. | Jul 2007 | A1 |
20070201357 | Smethurst et al. | Aug 2007 | A1 |
20070297428 | Bose et al. | Dec 2007 | A1 |
20080002579 | Lindholm et al. | Jan 2008 | A1 |
20080002683 | Droux et al. | Jan 2008 | A1 |
20080013474 | Nagarajan et al. | Jan 2008 | A1 |
20080049621 | McGuire et al. | Feb 2008 | A1 |
20080049646 | Lu | Feb 2008 | A1 |
20080059556 | Greenspan et al. | Mar 2008 | A1 |
20080071900 | Hecker et al. | Mar 2008 | A1 |
20080086726 | Griffith et al. | Apr 2008 | A1 |
20080151893 | Nordmark et al. | Jun 2008 | A1 |
20080159301 | Heer | Jul 2008 | A1 |
20080189769 | Casado et al. | Aug 2008 | A1 |
20080225853 | Melman et al. | Sep 2008 | A1 |
20080240122 | Richardson et al. | Oct 2008 | A1 |
20080253366 | Zuk et al. | Oct 2008 | A1 |
20080263205 | Naseh | Oct 2008 | A1 |
20080291910 | Tadimeti et al. | Nov 2008 | A1 |
20090031041 | Clemmensen | Jan 2009 | A1 |
20090043823 | Iftode et al. | Feb 2009 | A1 |
20090083445 | Ganga | Mar 2009 | A1 |
20090092137 | Haigh et al. | Apr 2009 | A1 |
20090122710 | Bar-Tor et al. | May 2009 | A1 |
20090150527 | Tripathi et al. | Jun 2009 | A1 |
20090161547 | Riddle et al. | Jun 2009 | A1 |
20090249470 | Litvin et al. | Oct 2009 | A1 |
20090249473 | Cohn | Oct 2009 | A1 |
20090279536 | Unbehagen et al. | Nov 2009 | A1 |
20090292858 | Lambeth et al. | Nov 2009 | A1 |
20090300210 | Ferris | Dec 2009 | A1 |
20090303880 | Maltz et al. | Dec 2009 | A1 |
20100002722 | Porat et al. | Jan 2010 | A1 |
20100046531 | Louati et al. | Feb 2010 | A1 |
20100107162 | Edwards et al. | Apr 2010 | A1 |
20100115101 | Lain et al. | May 2010 | A1 |
20100131636 | Suri et al. | May 2010 | A1 |
20100153554 | Anschutz et al. | Jun 2010 | A1 |
20100153701 | Shenoy et al. | Jun 2010 | A1 |
20100162036 | Linden et al. | Jun 2010 | A1 |
20100165877 | Shukla et al. | Jul 2010 | A1 |
20100169467 | Shukla et al. | Jul 2010 | A1 |
20100175125 | McDysan | Jul 2010 | A1 |
20100192225 | Ma et al. | Jul 2010 | A1 |
20100205479 | Akutsu et al. | Aug 2010 | A1 |
20100214949 | Smith et al. | Aug 2010 | A1 |
20100275199 | Smith et al. | Oct 2010 | A1 |
20100290485 | Martini et al. | Nov 2010 | A1 |
20100318609 | Lahiri et al. | Dec 2010 | A1 |
20100322255 | Hao et al. | Dec 2010 | A1 |
20110016215 | Wang | Jan 2011 | A1 |
20110022695 | Dalal et al. | Jan 2011 | A1 |
20110026537 | Kolhi et al. | Feb 2011 | A1 |
20110032830 | Merwe et al. | Feb 2011 | A1 |
20110075664 | Lambeth et al. | Mar 2011 | A1 |
20110075674 | Li et al. | Mar 2011 | A1 |
20110085557 | Gnanasekaran et al. | Apr 2011 | A1 |
20110085559 | Chung et al. | Apr 2011 | A1 |
20110110374 | Boucadair et al. | May 2011 | A1 |
20110119748 | Edwards et al. | May 2011 | A1 |
20110134931 | Merwe et al. | Jun 2011 | A1 |
20110142053 | Merwe et al. | Jun 2011 | A1 |
20110145390 | Kakadia et al. | Jun 2011 | A1 |
20110194567 | Shen | Aug 2011 | A1 |
20110202675 | Faulk, Jr. | Aug 2011 | A1 |
20110261825 | Ichino | Oct 2011 | A1 |
20110283017 | Alkhatib et al. | Nov 2011 | A1 |
20110299534 | Koganti et al. | Dec 2011 | A1 |
20110310899 | Alkhatib et al. | Dec 2011 | A1 |
20110317703 | Dunbar et al. | Dec 2011 | A1 |
20120014386 | Xiong et al. | Jan 2012 | A1 |
20120014387 | Dunbar et al. | Jan 2012 | A1 |
20120039338 | Morimoto | Feb 2012 | A1 |
20120066371 | Patel | Mar 2012 | A1 |
20120096159 | Short et al. | Apr 2012 | A1 |
20120099591 | Kotha | Apr 2012 | A1 |
20120131643 | Cheriton | May 2012 | A1 |
20120144014 | Natham | Jun 2012 | A1 |
20120173757 | Sanden | Jul 2012 | A1 |
20120182992 | Cowart et al. | Jul 2012 | A1 |
20120236734 | Sampath et al. | Sep 2012 | A1 |
20120278802 | Nilakantan et al. | Nov 2012 | A1 |
20130007740 | Kikuchi et al. | Jan 2013 | A1 |
20130044636 | Koponen et al. | Feb 2013 | A1 |
20130044641 | Koponen et al. | Feb 2013 | A1 |
20130058346 | Sridharan et al. | Mar 2013 | A1 |
20130070745 | Nixon et al. | Mar 2013 | A1 |
20130089097 | Filsfils et al. | Apr 2013 | A1 |
20130125120 | Zhang et al. | May 2013 | A1 |
20130142048 | Gross, IV et al. | Jun 2013 | A1 |
20130145002 | Kannan et al. | Jun 2013 | A1 |
20130148541 | Zhang et al. | Jun 2013 | A1 |
20130148542 | Zhang et al. | Jun 2013 | A1 |
20130148543 | Koponen et al. | Jun 2013 | A1 |
20130148656 | Zhang et al. | Jun 2013 | A1 |
20130151661 | Koponen et al. | Jun 2013 | A1 |
20130151676 | Thakkar et al. | Jun 2013 | A1 |
20130201989 | Hu | Aug 2013 | A1 |
20130266015 | Qu et al. | Oct 2013 | A1 |
20130266019 | Qu et al. | Oct 2013 | A1 |
20130268799 | Mestery et al. | Oct 2013 | A1 |
20130329548 | Nakil et al. | Dec 2013 | A1 |
20130339544 | Mithyantha | Dec 2013 | A1 |
20140003434 | Assarpour et al. | Jan 2014 | A1 |
20140016501 | Kamath et al. | Jan 2014 | A1 |
20140195666 | Dumitriu et al. | Jul 2014 | A1 |
20140207968 | Kumar | Jul 2014 | A1 |
20140310418 | Sorenson, III | Oct 2014 | A1 |
20150063364 | Thakkar et al. | Mar 2015 | A1 |
20150103838 | Zhang et al. | Apr 2015 | A1 |
20150117454 | Koponen et al. | Apr 2015 | A1 |
20150189009 | Bemmel | Jul 2015 | A1 |
20150263946 | Tubaltsev et al. | Sep 2015 | A1 |
20150271303 | Neginhal et al. | Sep 2015 | A1 |
20160142257 | Udupi et al. | May 2016 | A1 |
20160198003 | Luft | Jul 2016 | A1 |
20160226762 | Zhang et al. | Aug 2016 | A1 |
20160335107 | Behera et al. | Nov 2016 | A1 |
20160380812 | Chanda et al. | Dec 2016 | A1 |
20170317954 | Masurekar et al. | Nov 2017 | A1 |
20180062923 | Katrekar et al. | Mar 2018 | A1 |
20180063231 | Park | Mar 2018 | A1 |
20180176124 | Kancherla et al. | Jun 2018 | A1 |
20180176307 | Kancherla et al. | Jun 2018 | A1 |
20190014032 | Zhang et al. | Jan 2019 | A1 |
20190020580 | Boutros et al. | Jan 2019 | A1 |
20190104413 | Cidon et al. | Apr 2019 | A1 |
20190173757 | Hira et al. | Jun 2019 | A1 |
20190238429 | Chanda et al. | Aug 2019 | A1 |
20190342215 | Jain et al. | Nov 2019 | A1 |
20200014638 | Chen et al. | Jan 2020 | A1 |
20200036675 | Tarasuk-Levin | Jan 2020 | A1 |
20200287964 | Capper | Sep 2020 | A1 |
20200296155 | McGrath et al. | Sep 2020 | A1 |
20200366741 | Kancherla et al. | Nov 2020 | A1 |
20210067378 | Natarajan et al. | Mar 2021 | A1 |
20210067413 | Natarajan et al. | Mar 2021 | A1 |
20210203688 | Ghule et al. | Jul 2021 | A1 |
20210234898 | Desai et al. | Jul 2021 | A1 |
20210385155 | Suryanarayana et al. | Dec 2021 | A1 |
Number | Date | Country |
---|---|---|
1653688 | May 2006 | EP |
2882151 | Jun 2015 | EP |
2003069609 | Mar 2003 | JP |
2003124976 | Apr 2003 | JP |
2003318949 | Nov 2003 | JP |
2005112390 | Nov 2005 | WO |
2008095010 | Aug 2008 | WO |
2021040933 | Mar 2021 | WO |
Entry |
---|
Casado, Martin, et al., “Virtualizing the Network Forwarding Plane,” Dec. 2010, 6 pages. |
Dumitriu, Dan Mihai, et al., (U.S. Appl. No. 61/514,990), filed Aug. 4, 2011, 31 pages. |
Koponen, Teemu, et al., “Network Virtualization in Multi-tenant Datacenters,” Technical Report TR-2013-001E, Aug. 2013, 22 pages, VMware, Inc., Palo Alto, CA, USA. |
Non-Published Commonly Owned U.S. Appl. No. 16/573,874, filed Sep. 17, 2019, 37 pages, VMware, Inc. |
Non-Published Commonly Owned U.S. Appl. No. 16/573,906, filed Sep. 17, 2019, 37 pages, VMware, Inc. |
Non-Published Commonly Owned U.S. Appl. No. 16/931,196, filed Jul. 16, 2020, 58 pages, VMware, Inc. |
Non-Published Commonly Owned U.S. Appl. No. 16/931,207, filed Jul. 16, 2020, 58 pages, VMware, Inc. |
Non-Published Commonly Owned U.S. Appl. No. 16/945,746, filed Jul. 31, 2020, 67 pages, Nicira, Inc. |
Wang, Anjing, et al., “Network Virtualization: Technologies, Perspectives, and Frontiers,” Journal of Lightwave Technology, Feb. 15, 2013, 15 pages, IEEE. |
Potter, F. J. M., et al., “The Integration of Ethernet Virtual Private Network in Kubemetes,” Nov. 2019, 35 pages, retrieved from https://rp.os3.nl/2019-2020/p58/report.pdf. |
Number | Date | Country | |
---|---|---|---|
20220030060 A1 | Jan 2022 | US |