Providing recommendations for implementing virtual networks

Description

BACKGROUND

Today, a corporate enterprise network is the communication backbone that securely connects the different offices and divisions of a corporation. This network is typically a wide area network (WAN) that connects (1) users in branch offices and regional campuses, (2) corporate datacenters that host business applications, Intranets and their corresponding data, and (3) the global Internet through corporate firewalls and DMZ (demilitarized zone). Enterprise networks include specialized hardware such as switches, routers and middlebox appliances interconnected by expensive leased lines, such as Frame Relay and MPLS (multiprotocol label switching).

In the last several years, there has been a paradigm shift in the way corporations serve and consume communication services. First, the mobility revolution has allowed users to access services from any place at any time using mobile devices, mostly smart phones. Such users access the business services through public Internet and cellular networks. At the same time, third-party SaaS (Software as a Service) vendors (e.g., Salesforce, Workday, Zendesk) have replaced traditional on-premise applications, while other applications hosted in private datacenters have been relocated to the public clouds. While this traffic is still carried within the enterprise network, a significant portion of it originates and terminates outside the corporate network perimeters and has to cross both the public Internet (once or twice) as well as the corporate network. Recent studies have shown that 40% of corporate networks report that the percentage of backhauled traffic (i.e., of Internet traffic observed in the corporate network) is above 80%. This means that the majority of the corporate traffic is carried over both expensive leased lines and the consumer Internet.

As a consumer-centric service, the Internet itself is a poor medium for business traffic. It lacks the reliability, QoS (quality of service) guarantees and security expected by critical business applications. Moreover, the ever-increasing consumer traffic demands, net-neutrality regulations and the creation of Internet bypasses by major players (e.g., Netflix, Google, public clouds) have lowered the monetary return per traffic unit. These trends have reduced the incentives of service providers to quickly catch up with the consumer demands and offer adequate business services.

Given the growth of public clouds, corporations are migrating more of their compute infrastructure to the public cloud datacenters. Public cloud providers have been at the forefront of compute and networking infrastructure investment. These cloud services have built many datacenters across the world, with Azure, AWS, IBM and Google expanding to 38, 16, 25, and 14 worldwide regions respectively in 2016. Each public cloud provider has interconnected its own datacenters by using expensive high-speed networks that employ dark fiber and undersea cables deployed by submarines.

Today, notwithstanding these changes, corporate network policies often force all corporate traffic to go through their secure WAN gateways. As users become mobile and applications migrate to SaaS and public clouds, corporate WANs become costly detours that slow down all corporate communications. Most corporate WAN's traffic is either sourced from or destined to the Internet. Alternate secure solutions that send this traffic through the Internet are not adequate because of their poor and unreliable performance.

BRIEF SUMMARY

Some embodiments establish for an entity a virtual network over several public cloud datacenters of one or more public cloud providers in one or more regions (e.g., several cities, states, countries, etc.). Examples of entities for which such a virtual network can be established include a business entity (e.g., a corporation), a non-profit entity (e.g., a hospital, a research organization, etc.), and an educational entity (e.g., a university, a college, etc.), or any other type of entity. Examples of public cloud providers include Amazon Web Services (AWS), Google Cloud Platform (GCP), Microsoft Azure, etc.

In some embodiments, high-speed, reliable private networks interconnect two or more of the public cloud datacenters (the public clouds). Some embodiments define the virtual network as an overlay network that spans across several public clouds to interconnect one or more private networks (e.g., networks within branches, divisions, departments of the entity or their associated datacenters), mobile users, SaaS (Software as a Service) provider machines, machines and/or services in the public cloud(s), and other web applications.

Some embodiments establish different virtual networks for different entities over the same set of public clouds of the same public cloud providers and/or over different sets of public clouds of the same or different public cloud providers. In some embodiments, a virtual network provider provides software and services that allow different tenants to define different virtual networks over the same or different public clouds. In some embodiments, the same controller cluster or different controller clusters can be used to configure the public cloud components to implement different virtual networks over the same or different sets of public clouds for several different entities.

To deploy a virtual network for a tenant over one or more public clouds, the controller cluster (1) identifies possible ingress and egress routers for entering and exiting the virtual network for the tenant based on locations of the tenant's branch offices, datacenters, mobile users, and SaaS providers, and (2) identifies routes that traverse from the identified ingress routers to the identified egress routers through other intermediate public-cloud routers that implement the virtual network. After identifying these routes, the controller cluster propagates these routes to the forwarding tables of the virtual network routers in the public cloud(s). In the embodiments that use Open vSwitch (OVS) based virtual network routers, the controller distributes the routes by using OpenFlow.

Some embodiments provide a novel method for deploying different virtual networks over several public cloud datacenters for different entities. For each entity, the method (1) identifies a set of public cloud datacenters of one or more public cloud providers to connect a set of machines of the entity, (2) deploys managed forwarding nodes (MFNs) for the entity in the identified set of public cloud datacenters, and then (3) configures the MFNs to implement a virtual network that connects the entity's set of machines across its identified set of public cloud datacenters.

Managed forwarding nodes in some embodiments include one or more modules executing on a set of one or more host computers to perform forwarding operations. The MFNs in some embodiments perform other operations as well, such as service operations, e.g., NAT operations, load balancing operations, etc. In some embodiments, the MFNs that the method deploys for an entity are just used to process data message flows for that entity's machines. For instance, in some embodiments, the deployed MFNs for an entity are dedicated MFNs as they only carry the data message flows for that entity.

In some embodiments, the different virtual networks that the method defines for the different entities can differ in the public cloud datacenters that they span, the public clouds of different public cloud providers that they use and/or different public cloud regions in which they are defined. In some embodiments, the entity's machines that are connected by its virtual network are machines outside of any public cloud. In other embodiments, some of the entity's machines are in a public cloud, while other machines reside outside of the public clouds. Also, in some embodiments, the entity's machines include SaaS provider machines that the entity uses for certain SaaS operations.

In some embodiments, the method identifies the set of public cloud datacenters for an entity by receiving input from the entity's network administrator. In some embodiments, this input specifies the public cloud providers to use and/or the public cloud regions in which the virtual network should be defined. Conjunctively, or alternatively, this input in some embodiments specifies the actual public cloud datacenters to use. Under the above-described approach, different entities often end up with very different virtual networks as the entities often provide different input regarding the desired public cloud providers, regions and/or datacenters. The method of some embodiments supplements the set of public cloud datacenters identified for an entity through the entity's input with one or more public cloud datacenters that the method identifies as desirable datacenters to add to the entity's set of datacenters, as further described below.

To configure the MFNs, the method deploys measurement agents in public cloud datacenters (PCDs), and has these agents exchange messages in order to generate network measurements that quantify the quality of network connections between different pairs of PCDs or different pairs of PCD groups (e.g., between different public cloud regions or availability zones). Examples of network measurements that the method generates for a connection between two PCDs or PCD groups include loss, delay, and jitter experienced on this connection, as well as the reliability and cost of the connection.

In some embodiments, the method configures the MFNs deployed for an entity based on the network measurements that it generates for the set of PCDs that it identifies for the entity. For instance, in some embodiments, the method configures an entity's deployed MFNs by (1) performing path-identifying processes that use the measurements generated for the entity's identified set of PCDs to identify a set of paths connecting the entity's machines across the identified set of PCDs, and (2) using the identified paths to define next hop records that configure the MFNs to forward data message flows along the different paths. To configure the MFNs, the method in some embodiments provides the next hop records to a set of controllers that distribute them to the MFNs.

To identify the paths, the method uses the generated measurements to perform smallest cost (e.g., shortest) path searches. Some embodiments allow different entities to direct the method to use different types of measurements in performing its path searches, e.g., one entity can direct the method to minimize message delay, another entity can direct the method to minimize message jitter, still another entity can direct the method to minimize loss and delay, etc. For each entity, the method in some embodiments custom configures its path search operations to optimize a set of criteria specified by the entity.

As mentioned above, the method of some embodiments supplements the set of public cloud datacenters that it identifies for an entity through the entity's input, with one or more PCDs or PCD groups that the method identifies as desirable datacenters to add to the entity's set of datacenters. In some embodiments, the method provides to an entity a recommendation to add certain public clouds, PCD groups or PCDs to the list of public clouds or PCDs specified by entity, before deploying any MFN for the entity. Conjunctively, or alternatively, the method in some embodiments provides a recommendation to add one or more public clouds or PCDs after deploying the entity's MFNs, collecting statistics regarding their usage and analyzing the statistics to determine that it is desirable to add the public clouds or PCDs. Based on its analysis of the collected statistics, the method in some embodiments also recommends removal of underutilized public clouds or PCDs.

The method of some embodiments allows an entity to use other MFNs that have not been specifically deployed for the entity under certain circumstances. These other MFNs in some embodiments are shared MFNs as multiple entities can use them, as opposed to dedicated MFNs that are specifically deployed for a single entity. In some embodiments, the dedicated MFNs that are specifically deployed for one entity have the same attributes and perform the same operations (e.g., check for a tenant identifier in performing its forwarding operations) as the shared MFNs that are deployed and used by multiple entities. The only difference between the dedicated and shared MFNs in these embodiments is that the dedicated MFNs are used to process data messages for just one tenant, while the shared MFNs are used to process data messages for multiple entities.

One example in which an entity can use a shared MFN that has not been specifically deployed for the entity involves the use of MFNs in remote locations by the mobile devices of an entity in those location. For instance, an entity may predominantly operate in one region (e.g., only have offices in North America, etc.), but may have users that go on trips internationally and need to access the entity's network through the virtual network that is deployed for it over the public clouds. For such situations, the method of some embodiments allows the mobile devices (e.g., phones, tablets, laptops, etc.) of these traveling users to access its virtual network through an MFN that the method deploys in one or more PCDs (e.g., public clouds in Europe or Asia) in the foreign countries.

Another example involves the use of MFNs that are deployed in datacenters near the Internet backbone or serving as part of the Internet backbone. Setting up machines near or at the Internet backbone is difficult and can be expensive for any one entity. Accordingly, entities might not typically request that their virtual networks have a dedicated MFN deployed near or at the Internet backbone. Deploying such dedicated MFNs might not even be possible.

Before or after deploying the MFNs for an entity, the method's path searches might determine that for certain compute nodes of the entity, it is desirable to use a path that traverses through one or more shared MFNs deployed near or at the Internet backbone (i.e., to use a path that leaves the dedicated virtual network of the entity to use one or more MFNs near or at the Internet backbone). In such cases, the method of some embodiments provides a recommendation to the entity that the shared MFNs deployed near or at the Internet backbone should be used. When the entity accepts this recommendation, the method configures the MFNs to use the identified path(s) that use the shared MFNs near or at the Internet backbone.

The method of some embodiments allows for temporary usage of the shared MFNs when an entity's dedicated virtual network appears congested or is expected to be congested at one or more MFNs that are specifically deployed for the entity. In some embodiments, the method collects and analyzes statistics regarding the use of the dedicated MFNs that have been deployed for a particular entity. Based on this analysis, the method identifies one or more MFNs that are congested, and in response, reconfigures one or more network elements (e.g., load balancers) to redirect some of the data message flows to the shared MFNs and reconfigures these shared MFNs to forward the entity's data message flows until they reach their destination nodes or they reach another ingress node into the entity's virtual network.

The method in some embodiments does not deploy and configure MFNs to implement virtual networks. For instance, in some embodiments, the method provides measurements that quantify connections between PCDs or PCD groups to other processes that deploy and configure MFNs. In other embodiments, the method provides these measurements to other processes that perform other cloud-based operations, such as processes that deploy application machines in the public clouds and use the measurements to identify the best locations for such deployments. The method of still other embodiments uses these measurements to perform other cloud-based operations itself (e.g., deploying application machines in the public clouds and using the measurements to identify the best locations for such deployments).

The preceding Summary is intended to serve as a brief introduction to some embodiments of the invention. It is not meant to be an introduction or overview of all inventive subject matter disclosed in this document. The Detailed Description that follows and the Drawings that are referred to in the Detailed Description will further describe the embodiments described in the Summary as well as other embodiments. Accordingly, to understand all the embodiments described by this document, a full review of the Summary, Detailed Description, the Drawings and the Claims is needed. Moreover, the claimed subject matters are not to be limited by the illustrative details in the Summary, Detailed Description and the Drawing.

BRIEF DESCRIPTION OF THE DRAWINGS

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

FIG. 1A presents a virtual network that is defined for a corporation over several public cloud datacenters of two public cloud providers.

FIG. 1B illustrates an example of two virtual networks for two corporate tenants that are deployed over the public clouds.

FIG. 1C alternatively illustrates an example of two virtual networks, with one network deployed over public clouds and the other virtual network deployed over another pair of public clouds.

FIG. 2 illustrates an example of a managed forwarding node and a controller cluster of some embodiments of the invention.

FIG. 3 illustrates an example of a measurement graph that the controller measurement-processing layer produces in some embodiments.

FIG. 4A illustrates an example of a routing graph that the controller path-identifying layer produces in some embodiments from the measurement graph.

FIG. 4B illustrates an example of adding known IPs for two SaaS providers to the two nodes in the routing graph that are in datacenters that are closest to the datacenters of these SaaS providers.

FIG. 4C illustrates a routing graph that is generated by adding two nodes to represent two SaaS providers.

FIG. 4D illustrates a routing graph with additional nodes added to represent branch offices and datacenters with known IP addresses that connect respectively to two public clouds.

FIG. 5 illustrates a process that the controller path-identifying layer uses to generate a routing graph from a measurement graph received from the controller measurement layer.

FIG. 6 illustrates the IPsec data message format of some embodiments.

FIG. 7 illustrates an example of the two encapsulating headers of some embodiments, while FIG. 8 presents an example that illustrates how these two headers are used in some embodiments.

FIGS. 9-11 illustrate message-handling processes that are performed respectively by the ingress, intermediate, and egress managed forwarding nodes (MFNs) when they receive a message that is sent between two compute devices in two different branch offices.

FIG. 12 illustrates an example that does not involve an intermediate MFN between the ingress and egress MFNs.

FIG. 13 illustrates a message-handling process that is performed by the cloud forwarding element (CFE) of the ingress MFN when it receives a message that is sent from a corporate compute device in a branch office to another device in another branch office or in a SaaS provider datacenter.

FIG. 14 presents an example that shows M virtual corporate WANs for M tenants of a virtual network provider that has network infrastructure and controller cluster(s) in N public clouds of one or more public cloud providers.

FIG. 15 conceptually illustrates a process performed by the controller cluster of the virtual network provider to deploy and manage a virtual WAN for a particular tenant.

FIG. 16 illustrates a three-layer SaaS deployment model of some embodiments.

FIG. 17 illustrates a two-layer SaaS deployment model of some embodiments.

FIG. 18 illustrates a process used by the central controller cluster of some embodiments to define routes for a multi-homed, multi-machine compute node (MMCN).

FIG. 19 presents an example of two branch nodes of two MMCNs and a SaaS datacenter.

FIG. 20 illustrates a process used by the central controller cluster of some embodiments to define routes for multi-homed SaaS providers.

FIG. 21 illustrates a process that the VNP uses in some embodiments to deploy and configure dedicated MFNs to establish a dedicated virtual network for an entity that requests such a network to be deployed over a particular set of public cloud providers, a particular set of public cloud regions, and/or a particular set of public cloud datacenters.

FIG. 22 presents an example that illustrates three different virtual networks deployed over several public clouds in the United States for three different companies.

FIG. 23 conceptually illustrates a VNP process that produces recommendations to add MFNs based on collected statistics and new measurements.

FIG. 24 illustrates an example of adding a new PCD to a virtual network to improve its performance.

FIG. 25 conceptually illustrates a VNP process that produces recommendations to remove one or more underutilized MFNs.

FIG. 26 illustrates an example of removing a PCD from a virtual network in order to remove an underutilized MFN in this PCD.

FIG. 27 conceptually illustrates a VNP process that produces recommendations to offload some of the data message traffic from dedicated MFNs of a dedicated virtual network of an entity to one or more shared MFNs for at least a duration of at least one path between at least one pair of machine endpoints.

FIGS. 28-30 illustrate example of directing some of the data message flows away from over congested dedicated MFNs of a dedicated virtual network to shared MFNs.

FIG. 31 illustrates a process that stops the redirection of some of the data traffic load away from a dedicated MFN.

FIG. 32 conceptually illustrates a process that produces recommendations for an entity's dedicated virtual network to use one or more backbone MFNs.

FIGS. 33 and 34 illustrate examples of directing some of the data message flows away from one or more dedicated MFNs of a dedicated virtual network of an entity to its destination shared backbone MFNs.

FIG. 35 illustrates a process that some embodiments use to deploy a dedicated virtual network for an entity with mobile device access support from remote locations provided through the VNP's shared MFNs.

FIG. 36 illustrates an example of a mobile device in China connected to a dedicated virtual network defined in North America.

FIG. 37 illustrates a process that some embodiments use to identify optimal paths to SaaS provider from a set of machines of an entity for which the VNP deploys and configures dedicated MFNs to establish a dedicated virtual network.

FIG. 38 illustrates an example in which the SaaS datacenter is selected based on the PCDs that an entity selects for deploying its virtual network.

FIG. 39 illustrates an example of an edge node that connects multiple compute devices at an MMCN location (office, datacenter, etc.) to the Internet through multiple links.

FIG. 40 illustrates a process that accounts for the availability different links between SD-WAN edge node and the Internet, and configures the SD-WAN edge node to use the best link for each MFN in the set of one or more MFNs to which the edge node connects.

FIG. 41 presents an example that illustrates configuring an SD-WAN edge node to use the best link/MFN pair for the best path to a destination endpoint in the virtual network.

FIG. 42 illustrates a process that some embodiments use to deploy a set of one or more resource in optimal locations in the public clouds based on measurements generated by the measurement infrastructure of some embodiments.

FIG. 43 several components that some embodiments use to identify optimal locations in public clouds.

FIG. 44 presents an example that illustrates an optimal location for deploying a machine for a particular entity with a particular set of edge nodes that need to access the machine.

FIG. 45 conceptually illustrates a computer system with which some embodiments of the invention are implemented.

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 establish for an entity a virtual network over several public cloud datacenters of one or more public cloud providers in one or more regions (e.g., several cities, states, countries, etc.). An example of an entity for which such a virtual network can be established include a business entity (e.g., a corporation), a non-profit entity (e.g., a hospital, a research organization, etc.), and an educational entity (e.g., a university, a college, etc.), or any other type of entity. Examples of public cloud providers include Amazon Web Services (AWS), Google Cloud Platform (GCP), Microsoft Azure, etc.

Some embodiments define the virtual network as an overlay network that spans across several public cloud datacenters (public clouds) to interconnect one or more private networks (e.g., networks within branches, divisions, departments of the entity or their associated datacenters), mobile users, SaaS (Software as a Service) provider machines, machines and/or services in the public cloud(s), and other web applications. In some embodiments, high-speed, reliable private networks interconnect two or more of the public cloud datacenters.

The virtual network in some embodiments can be configured to optimize the routing of the entity's data messages to their destinations for best end-to-end performance, reliability and security, while trying to minimize the routing of this traffic through the Internet. Also, the virtual network in some embodiments can be configured to optimize the layer 4 processing of the data message flows passing through the network. For instance, in some embodiments, the virtual network optimizes the end-to-end rate of TCP (Transport Control Protocol) connections by splitting the rate control mechanisms across the connection path.

Some embodiments establish the virtual network by configuring several components that are deployed in several public clouds. These components include in some embodiments software-based measurement agents, software forwarding elements (e.g., software routers, switches, gateways, etc.), layer-4 connection proxies and middlebox service machines (e.g., appliances, VMs, containers, etc.).

Some embodiments utilize a logically centralized controller cluster (e.g., a set of one or more controller servers) that configures the public-cloud components to implement the virtual network over several public clouds. In some embodiments, the controllers in this cluster are at various different locations (e.g., are in different public cloud datacenters) in order to improve redundancy and high availability. When different controllers in the controller cluster are located in different public cloud datacenters, the controllers in some embodiments share their state (e.g., the configuration data that they generate to identify tenants, routes through the virtual networks, etc.). The controller cluster in some embodiments scales up or down the number of public cloud components that are used to establish the virtual network, or the compute or network resources allocated to these components.

Several examples of corporate virtual networks are provided in the discussion below. However, one of ordinary skill will realize that some embodiments define virtual networks for other types of entities, such as other business entities, non-profit organizations, educational entities, etc. Also, 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. 1A presents a virtual network 100 that is defined for a corporation over several public cloud datacenters 105 and 110 of two public cloud providers A and B. As shown, the virtual network 100 is a secure overlay network that is established by deploying different managed forwarding nodes 150 in different public clouds and connecting the managed forwarding nodes (MFNs) to each other through overlay tunnels 152. In some embodiments, an MFN is a conceptual grouping of several different components in a public cloud datacenter that with other MFNs (with other groups of components) in other public cloud datacenters establish one or more overlay virtual networks for one or more entities.

As further described below, the group of components that form an MFN include in some embodiments (1) one or more VPN gateways for establishing VPN connections with an entity's compute nodes (e.g., offices, private datacenters, remote users, etc.) that are external machine locations outside of the public cloud datacenters, (2) one or more forwarding elements for forwarding encapsulated data messages between each other in order to define an overlay virtual network over the shared public cloud network fabric, (3) one or more service machines for performing middlebox service operations as well as L4-L7 optimizations, and (4) one or more measurement agents for obtaining measurements regarding the network connection quality between the public cloud datacenters in order to identify desired paths through the public cloud datacenters. In some embodiments, different MFNs can have different arrangements and different numbers of such components, and one MFN can have different numbers of such components for redundancy and scalability reasons.

Also, in some embodiments, each MFN's group of components execute on different computers in the MFN's public cloud datacenter. In some embodiments, several or all of an MFN's components can execute on one computer of a public cloud datacenter. The components of an MFN in some embodiments execute on host computers that also execute other machines of other tenants. These other machines can be other machines of other MFNs of other tenants, or they can be unrelated machines of other tenants (e.g., compute VMs or containers).

The virtual network 100 in some embodiments is deployed by a virtual network provider (VNP) that deploys different virtual networks over the same or different public cloud datacenters for different entities (e.g., different corporate customers/tenants of the virtual network provider). The virtual network provider in some embodiments is the entity that deploys the MFNs and provides the controller cluster for configuring and managing these MFNs.

The virtual network 100 connects the corporate compute endpoints (such as datacenters, branch offices and mobile users) to each other and to external services (e.g., public web services, or SaaS services such as Office365 or Salesforce) that reside in the public cloud or reside in private datacenter accessible through the Internet. As further described below, SaaS in some embodiments is a software distribution model in which a third-party provider hosts applications and makes them available to customers over the Internet.

The virtual network 100 leverages the different locations of the different public clouds to connect different corporate compute endpoints (e.g., different private networks and/or different mobile users of the corporation) to the public clouds in their vicinity. Corporate compute endpoints are also referred to as corporate compute nodes in the discussion below. In some embodiments, the virtual network 100 also leverages the high-speed networks that interconnect these public clouds to forward data messages through the public clouds to their destinations or to get as close to their destinations while reducing their traversal through the Internet. When the corporate compute endpoints are outside of public cloud datacenters over which the virtual network spans, these endpoints are referred to as external machine locations. This is the case for corporate branch offices, private datacenters and devices of remote users.

In the example illustrated in FIG. 1A, the virtual network 100 spans six datacenters 105a-105f of the public cloud provider A and four datacenters 110a-110d of the public cloud provider B. In spanning these public clouds, this virtual network connects several branch offices, corporate datacenters, SaaS providers and mobile users of the corporate tenant that are located in different geographic regions. Specifically, the virtual network 100 connects two branch offices 130a and 130b in two different cities (e.g., San Francisco, California, and Pune, India), a corporate datacenter 134 in another city (e.g., Seattle, Washington), two SaaS provider datacenters 136a and 136b in another two cities (Redmond, Washington, and Paris, France), and mobile users 140 at various locations in the world. As such, this virtual network can be viewed as a virtual corporate WAN.

In some embodiments, the branch offices 130a and 130b have their own private networks (e.g., local area networks) that connect computers at the branch locations and branch private datacenters that are outside of public clouds. Similarly, the corporate datacenter 134 in some embodiments has its own private network and resides outside of any public cloud datacenter. In other embodiments, however, the corporate datacenter 134 or the datacenter of the branch 130a and 130b can be within a public cloud, but the virtual network does not span this public cloud, as the corporate or branch datacenter connects to the edge of the virtual network 100.

As mentioned above, the virtual network 100 is established by connecting different deployed managed forwarding nodes 150 in different public clouds through overlay tunnels 152. Each managed forwarding node 150 includes several configurable components. As further described above and further described below, the MFN components include in some embodiments software-based measurement agents, software forwarding elements (e.g., software routers, switches, gateways, etc.), layer 4 proxies (e.g., TCP proxies) and middlebox service machines (e.g., VMs, containers, etc.). One or more of these components in some embodiments use standardized or commonly available solutions, such as Open vSwitch, OpenVPN, strongSwan, etc.

In some embodiments, each MFN (i.e., the group of components the conceptually forms an MFN) can be shared by different tenants of the virtual network provider that deploys and configures the MFNs in the public cloud datacenters. Conjunctively, or alternatively, the virtual network provider in some embodiments can deploy a unique set of MFNs in one or more public cloud datacenters for a particular tenant. For instance, a particular tenant might not wish to share MFN resources with another tenant for security reasons or quality of service reasons. For such a tenant, the virtual network provider can deploy its own set of MFNs across several public cloud datacenters.

In some embodiments, a logically centralized controller cluster 160 (e.g., a set of one or more controller servers) operate inside or outside of one or more of the public clouds 105 and 110, and configure the public-cloud components of the managed forwarding nodes 150 to implement the virtual network over the public clouds 105 and 110. In some embodiments, the controllers in this cluster are at various different locations (e.g., are in different public cloud datacenters) in order to improve redundancy and high availability. The controller cluster in some embodiments scales up or down the number of public cloud components that are used to establish the virtual network, or the compute or network resources allocated to these components.

In some embodiments, the controller cluster 160, or another controller cluster of the virtual network provider, establishes a different virtual network for another corporate tenant over the same public clouds 105 and 110, and/or over different public clouds of different public cloud providers. In addition to the controller cluster(s), the virtual network provider in other embodiments deploys forwarding elements and service machines in the public clouds that allow different tenants to deploy different virtual networks over the same or different public clouds. FIG. 1B illustrates an example of two virtual networks 100 and 180 for two corporate tenants that are deployed over the public clouds 105 and 110. FIG. 1C alternatively illustrates an example of two virtual networks 100 and 182, with one network 100 deployed over public clouds 105 and 110 and the other virtual network 182 deployed over another pair of public clouds 110 and 115.

Through the configured components of the MFNs, the virtual network 100 of FIG. 1A allows different private networks and/or different mobile users of the corporate tenant to connect to different public clouds that are in optimal locations (e.g., as measured in terms of physical distance, in terms of connection speed, loss, delay and/or cost, and/or in terms of network connection reliability, etc.) with respect to these private networks and/or mobile users. These components also allow the virtual network 100 in some embodiments to use the high-speed networks that interconnect the public clouds to forward data messages through the public clouds to their destinations while reducing their traversal through the Internet.

In some embodiments, the MFN components are also configured to run novel processes at the network, transport and application layers to optimize the end-to-end performance, reliability and security. In some embodiments, one or more of these processes implement proprietary high-performance networking protocols, free from the current network protocol ossification. As such, the virtual network 100 in some embodiments is not confined by Internet autonomous systems, routing protocols, or even end-to-end transport mechanisms.

For example, in some embodiments, the components of the MFNs 150 (1) create optimized, multi-path and adaptive centralized routing, (2) provide strong QoS (Quality of Service) guarantees, (3) optimize end-to-end TCP rates through intermediate TCP splitting and/or termination, and (4) relocate scalable application-level middlebox services (e.g., firewalls, intrusion detection systems (IDS), intrusion prevention system (IPS), WAN optimization, etc.) to the compute part of the cloud in a global network function virtualization (NFV). Accordingly, the virtual network can be optimized to fit customized and changing demands of the corporation without being bound to existing network protocol. Also, in some embodiments, the virtual network can be configured as a “pay as you go” infrastructure that can be dynamically and elastically scaled up and down both in performance capability and in geographical span according to the continuous requirement changes.

To implement the virtual network 100, at least one managed forwarding node 150 in each public cloud datacenter 105a-105f and 110a-110d spanned by the virtual network has to be configured by the set of controllers. FIG. 2 illustrates an example of a managed forwarding node 150 and a controller cluster 160 of some embodiments of the invention. In some embodiments, each managed forwarding node 150 is a machine (e.g., a VM or container) that executes on a host computer in a public cloud datacenter. In other embodiments, each managed forwarding node 150 is implemented by multiple machines (e.g., multiple VMs or containers) that execute on the same host computer in one public cloud datacenter. In still other embodiments, two or more components of one MFN can be implemented by two or more machines executing on two or more host computers in one or more public cloud datacenters.

As shown, the managed forwarding node 150 includes a measurement agent 205, firewall and NAT middlebox service engines 210 and 215, one or more optimization engines 220, edge gateways 225 and 230, and a cloud forwarding element 235 (e.g., a cloud router). In some embodiments, each of these components 205-235 can be implemented as a cluster of two or more components.

The controller cluster 160 in some embodiments can dynamically scale up or down each component cluster (1) to add or remove machines (e.g., VMs or containers) to implement each component's functionality and/or (2) to add or remove compute and/or network resources to the previously deployed machines that implement that cluster's components. As such, each deployed MFN 150 in a public cloud datacenter can be viewed as a cluster of MFNs, or it can be viewed as a node that includes multiple different component clusters that perform different operations of the MFN.

Also, in some embodiments, the controller cluster deploys different sets of MFNs in the public cloud datacenters for different tenants for which the controller cluster defines virtual networks over the public cloud datacenters. In this approach, the virtual networks of any two tenants do not share any MFN. However, in the embodiments described below, each MFN can be used to implement different virtual networks for different tenants. One of ordinary skill will realize that in other embodiments the controller cluster 160 can implement the virtual network of each tenant of a first set of tenants with its own dedicated set of deployed MFNs, while implementing the virtual network of each tenant of a second set of tenants with a shared set of deployed MFNs.

In some embodiments, the branch gateway 225 and remote device gateway 230 establish secure VPN connections respectively with one or more branch offices 130 and remote devices (e.g., mobile devices 140) that connect to the MFN 150, as shown in FIG. 2. One example of such VPN connections are IPsec connections, which will be further described below. However, one of ordinary skill will realize that in other embodiments, such gateways 225 and/or 230 establish different types of VPN connections.

An MFN 150 in some embodiments includes one or more middlebox engines that perform one or more middlebox service operations, such are firewall operations, NAT operations, IPS operations, IDS operations, load balancing operations, WAN optimization operations, etc. By incorporating these middlebox operations (e.g., firewall operations, WAN optimization operations, etc.) in the MFNs that are deployed in the public cloud, the virtual network 100 implements in the public cloud much of the functions that are traditionally performed by the corporate WAN infrastructure at a corporation's datacenter(s) and/or branch office(s).

Accordingly, for many of the middlebox services, the corporate compute nodes (e.g., remote devices, branch offices and datacenters) no longer have to access the corporate WAN infrastructure of the corporation in a private datacenter or branch office, as much of these services are now deployed in the public clouds. This approach speeds up the access of the corporate compute nodes (e.g., remote devices, branch offices and datacenters) to these services, and avoids costly congested-network bottlenecks at private datacenters that would otherwise be dedicated to offering such services.

This approach effectively distributes the WAN gateway functionality to various MFNs in the public cloud datacenters. For instance, in the virtual network 100 of some embodiments, most or all of the traditional corporate WAN gateway security functions (e.g., firewall operations, intrusion detection operations, intrusion prevention operations, etc.) are moved to the public cloud MFNs (e.g., ingress MFNs at which data from compute endpoints is received into the virtual network). This effectively allows the virtual network 100 to have a distributed WAN gateway that is implemented at many different MFNs that implement the virtual network 100.

In the example illustrated in FIG. 2, the MFN 150 is shown to include the firewall engine 210, the NAT engine 215 and one or more L4-L7 optimization engines. One of ordinary skill will realize that in other embodiments, the MFN 150 includes other middlebox engines for performing other middlebox operations. In some embodiments, the firewall engine 210 enforces firewall rules on (1) data message flows on their ingress paths into the virtual network (e.g., on data message flows that the gateways 225 and 230 receives and process from branch offices 130 and mobile devices 140) and (2) data messages flows on their egress paths out of the virtual network (e.g., on data message flows that are sent to SaaS provider datacenters through the NAT engine 215 and the Internet 202).

The firewall engine 210 of the MFN 150 in some embodiments also enforces firewall rules when the firewall engine belongs to an MFN that is an intermediate hop between an ingress MFN at which a data message flow enters a virtual network and an egress MFN at which the data message flow exits the virtual network. In other embodiments, the firewall engine 210 only enforces firewall rules when it is part of a data message flow's ingress MFN and/or egress MFN.

In some embodiments, the NAT engine 215 performs a network address translation to change the source network addresses of data message flows on their egress paths out of the virtual network to third party devices (e.g., to SaaS provider machines) through the Internet 202. Such network address translations ensure that third-party machines (e.g., SaaS machines) can be properly configured to process the data message flows that without the address translations might specify private network addresses of the tenants and/or the public cloud providers. This is particularly problematic as private network addresses of different tenants and/or cloud providers might overlap. The address translation also ensures that the reply messages from the third party devices (e.g., the SaaS machines) can be properly received by the virtual network (e.g., by the MFN NAT engine from which the message exited the virtual network).

The NAT engines 215 of the MFNs in some embodiments perform double-NAT operations on each data message flow that leaves the virtual network to reach a third party machine, or that enters the virtual network from a third party machine. As further described in U.S. Public Patent Application 2019-0103990 A1 (incorporated herein by reference), one NAT operation in the two NAT operations is performed on such a data message flow at its ingress MFN when it enters the virtual network, while the other NAT operation is performed on the data message flow at its egress MFN when it exits the virtual network.

This double NAT approach allows more tenant private networks to be mapped to the networks of the public cloud providers. This approach also reduces the load for distributing to the MFNs data regarding changes to tenant private networks. Before the ingress or egress NAT operations, some embodiments perform a tenant mapping operation that uses the tenant identifier to first map the tenant's source network address to another source network address that is then mapped to yet another source network address by the NAT operation. Performing the double NAT operation reduces the data distribution load for distributing data regarding changes to the tenant private networks.

The optimization engine 220 executes novel processes that optimize the forwarding of the entity's data messages to their destinations for best end-to-end performance and reliability. Some of these processes implement proprietary high-performance networking protocols, free from the current network protocol ossification. For example, in some embodiments, the optimization engine 220 optimizes end-to-end TCP rates through intermediate TCP splitting and/or termination.

The cloud forwarding element 235 is the MFN engine that is responsible for forwarding a data message flow to the next hop MFN's cloud forwarding element (CFE) when the data message flow has to traverse to another public cloud to reach its destination, or to an egress router in the same public cloud when the data message flow can reach its destination through the same public cloud. In some embodiments, the CFE 235 of the MFN 150 is a software router.

To forward the data messages, the CFE encapsulates the messages with tunnel headers. Different embodiments use different approaches to encapsulate the data messages with tunnel headers. Some embodiments described below use one tunnel header to identify network ingress/egress addresses for entering and exiting the virtual network, and use another tunnel header to identify next hop MFNs when a data message has to traverse one or more intermediate MFN to reach the egress MFN.

Specifically, in some embodiments, the CFE sends the data message with two tunnel headers (1) an inner header that identifies an ingress CFE and egress CFE for entering and exiting the virtual network, and (2) an outer header that identifies the next hop CFE. The inner tunnel header in some embodiments also includes a tenant identifier (TID) in order to allow multiple different tenants of the virtual network provider to use a common set of MFN CFEs of the virtual network provider. Other embodiments define tunnel headers differently in order to define the overlay virtual network.

To deploy a virtual network for a tenant over one or more public clouds, the controller cluster (1) identifies possible ingress and egress routers for entering and exiting the virtual network for the tenant based on locations of the tenant's corporate compute nodes (e.g., branch offices, datacenters, mobile users and SaaS providers), and (2) identifies routes that traverse from the identified ingress routers to the identified egress routers through other intermediate public-cloud routers that implement the virtual network. After identifying these routes, the controller cluster propagates these routes to the forwarding tables of the MFN CFEs 235 in the public cloud(s). In the embodiments that use OVS-based virtual network routers, the controller distributes the routes by using OpenFlow.

In some embodiments, the controller cluster 160 can also configure the components 205-235 of each MFN 150 that implements the virtual network to optimize several network processing layers in order to achieve best end-to-end performance, reliability and security. For example, in some embodiments, these components are configured (1) to optimize layer3 traffic routing (e.g., shortest path, packet duplication), (2) to optimize layer 4 TCP congestion control (e.g., segmentation, rate control), (3) to implement security features (e.g., encryption, deep packet inspection, firewall), and (4) to implement application-layer compression features (e.g., de-duplication, caching). Within the virtual network, corporate traffic is secured, inspected and logged.

In some embodiments, one measurement agent is deployed for each MFN in a public cloud datacenter. In other embodiments, multiple MFNs in a public cloud datacenter or in a collection of datacenters (e.g., in a collection of nearby, associated datacenters, such as datacenters in one availability zone) share one measurement agent. To optimize the layers 3 and 4 processing, the measurement agent 205 associated with each managed forwarding node 150 repeatedly generates measurement values that quantify the quality of the network connection between its node and each of several other “neighboring” nodes.

Different embodiments define neighboring nodes differently. For a particular MFN in one public cloud datacenter of a particular public cloud provider, a neighboring node in some embodiments includes (1) any other MFN that operates in any public cloud datacenter of the particular public cloud provider, and (2) any other MFN that operates in another public cloud provider's datacenter that is within the same “region” as the particular MFN.

Different embodiments define the same region differently. For instance, some embodiments define a region in terms of a distance that specifies a bounding shape around the particular managed forwarding node. Other embodiments define regions in terms of cities, states, or regional areas, such as northern California, southern California, etc. The assumption of this approach is that different datacenters of the same public cloud provider are connected with very high-speed network connections, while the network connections between the datacenters of different public cloud providers are likely fast when the datacenters are within the same region but likely not as fast when the datacenters are in different regions. The connection between the datacenters of different public cloud providers might have to traverse long distances through the public Internet when the datacenters are in different regions.

The measurement agent 205 generates measurement values differently in different embodiments. In some embodiments, the measurement agent sends pinging messages (e.g., UDP echo messages) periodically (e.g., once every second, every N seconds, every minute, every M minutes, etc.) to each of the measurement agents of its neighboring managed forwarding nodes. Given the small size of the pinging messages, they do not result in large network connection charges. For instance, for 100 nodes with each node sending a ping to each other node every 10 seconds, about 10 Kb/s of ingress and egress measurement traffic is generated for each node, and this leads to network consumption charges of a few dollars (e.g., $5) per node per year, given the current public cloud prices.

Based on the speed of the reply messages that it receives, the measurement agent 205 computes and updates measurement metric values, such as network-connection throughput speed, delay, loss, and link reliability. By repeatedly doing these operations, the measurement agent 205 defines and updates a matrix of measurement results that expresses the quality of network connections to its neighboring nodes. As the agent 205 interacts with the measurement agents of its neighboring nodes, its measurement matrix only quantifies the quality of the connections to its local clique of nodes.

The measurement agents of the different managed forwarding nodes send their measurement matrices to the controller cluster 160, which then aggregates all different clique connection data to obtain an aggregate mesh view of the connections between different pairs of managed forwarding nodes. When the controller cluster 160 collects different measurements for a link between two pairs of forwarding nodes (e.g., measurements taken by one node at different times), the controller cluster produces a blended value from the different measurements (e.g., produces an average or a weighted average of the measurements). The aggregate mesh view in some embodiments is a full mesh view of all the network connections between each pair of managed forwarding nodes, while in other embodiments it is a more complete view than the one produced by the measurement agents of the individual managed forwarding nodes.

As shown in FIG. 2, the controller cluster 160 includes a cluster of one or more measurement-processing engines 280, one or more path-identifying engines 282, and one or more management interfaces 284. In order not to obscure the description with unnecessary detail, each of these clusters will be referred to below in terms of singular engine or interface layers, i.e., in terms of a measurement-processing layer 280, a path-identifying layer 282, and a management interface layer 284.

The measurement-processing layer 280 receives the measurement matrices from the measurement agents 205 of the managed forwarding nodes and processes these measurements matrices to produce the aggregate mesh matrix that expresses the connection quality between different pairs of managed forwarding nodes. The measurement-processing layer 280 provides the aggregate mesh matrix to the path-identifying layer 282. Based on the aggregate mesh matrix, the path-identifying layer 282 identifies different desired routing paths through the virtual network for connecting different corporate data endpoints (e.g., different branch offices, corporate datacenters, SaaS provider datacenters and/or remote devices). This layer 282 then provides these routing paths in route tables that are distributed to the cloud forwarding elements 235 of the managed forwarding nodes 150.

In some embodiments, the identified routing path for each pair of data message endpoints is a routing path that is deemed optimal based on a set of optimization criteria, e.g., it is the fastest routing path, the shortest routing path, or the path that least uses the Internet. In other embodiments, the path-identifying engine can identify and provide (in the routing table) multiple different routing paths between the same two endpoints. In these embodiments, the cloud forwarding elements 235 of the managed forwarding nodes 150 then select one of the paths based on QoS criteria or other runtime criteria that they are enforcing. Each CFE 235 in some embodiments does not receive the entire routing path from the CFE to the egress point of the virtual network, but rather receives the next hop for the path.

In some embodiments, the path-identifying layer 282 uses the measurement values in the aggregate mesh matrix as inputs to routing algorithms that it executes to construct a global routing graph. This global routing graph is an aggregated and optimized version of a measurement graph that the measurement-processing layer 280 produces in some embodiments. FIG. 3 illustrates an example of a measurement graph 300 that the controller measurement-processing layer 280 produces in some embodiments. This graph depicts network connections between various managed forwarding nodes 150 in AWS and GCP public clouds 310 and 320 (i.e., in the datacenters of AWS and GCP). FIG. 4A illustrates an example of a routing graph 400 that the controller path-identifying layer 282 produces in some embodiments from the measurement graph 300.

FIG. 5 illustrates a process 500 that the controller path-identifying layer uses to generate a routing graph from a measurement graph received from the controller measurement layer. The path-identifying layer 282 performs this process 500 repeatedly as it repeatedly receives updated measurement graphs from the controller measurement layer (e.g., performs the process 500 each time that it receives a new measurement graph, or each N^thtime that it receives a new measurement graph). In other embodiments, the path-identifying layer 282 performs this process periodically (e.g., once every 12 hours or 24 hours).

As shown, the path-identifying layer initially defines (at 505) the routing graph to be identical to the measurement graph (i.e., to have the same links between the same pairs of managed forwarding nodes). At 510, the process removes bad links from the measurement graph 300. Examples of bad links are links with excessive message loss or poor reliability (e.g., links with greater than 2% message loss in last 15 minutes, or with message loss greater than 10% in the last 2 minute). FIG. 4A illustrates that links 302, 304 and 306 in the measurement graph 300 are excluded in the routing graph 400. This figure illustrates the exclusion of these links by depicting these links with dashed lines.

Next, at 515, the process 500 computes a link weight score (cost score) as a weighted combination of several computed and provider-specific values. In some embodiments, the weight score is a weighted combination of the link's (1) computed delay value, (2) computed loss value, (3) provider network-connection cost, and (4) provider compute cost. In some embodiments, the provider compute cost is accounted for as the managed forwarding nodes connected by the link are machines (e.g., VMs or containers) that execute on host computers in the public cloud datacenter(s).

At 520, the process adds to the routing graph the known source and destination IP addresses (e.g., known IPs of SaaS providers used by the corporate entity) for the data message flows in the virtual network. In some embodiments, the process adds each known IP address of a possible message-flow endpoint to the node (e.g., to the node representing an MFN) in the routing graph that is closest to that end point. In doing so, the process in some embodiments assumes that each such endpoint is connected to the virtual network through a link with a zero delay cost and a zero loss cost. FIG. 4B illustrates an example of adding known IPs for two SaaS providers to the two nodes 402 and 404 (representing two MFNs) in the routing graph that are in datacenters that are closest to the datacenters of these SaaS providers. In this example, one node is in an AWS public cloud, while the other node is in the GCP public cloud.

Alternatively, or conjunctively, the process 500 in some embodiments adds the known source and destination IP addresses to the routing graph by adding nodes to this graph to represent the source and destination endpoints, assigning IP addresses to these nodes, and assigning weight values to the links that connect these added nodes to other nodes in the routing graph (e.g., to nodes in the routing graph that represent MFNs in the public clouds). When the source and destination endpoints for the flows are added as nodes, the path-identifying engine 282 can account for cost (e.g., distance cost, delay cost, and/or financial cost, etc.) of reaching these nodes when it is identifying different routes through the virtual network between different source and destination endpoints.

FIG. 4C illustrates a routing graph 410 that is generated by adding two nodes 412 and 414 to the node graph 400 of FIG. 4A in order to represent two SaaS providers. In this example, the known IP addresses are assigned to nodes 412 and 414, and these nodes are connected to nodes 402 and 404 (representing two MFNs) through links 416 and 418 that have weights W1 and W2 assigned to them. This approach is an alternative approach for adding the known IP addresses of the two SaaS providers to the approach illustrated in FIG. 4B.

FIG. 4D illustrates a more detailed routing graph 415. In this more detailed routing graph, additional nodes 422 and 424 are added to represent external corporate compute nodes (e.g., branch offices and datacenters) with known IP addresses that connect respectively to the AWS and GCP public clouds 310 and 320. Each of these nodes 422/424 is connected by at least one link 426 with an associated weight value Wi to at least one of the routing graph nodes that represents an MFN. Some of these nodes (e.g., some of the branch offices) are connected with multiple links to same MFN or to different MFNs.

Next, at 525, the process 500 compute the lowest cost paths (e.g., shortest paths, etc.) between each MFN and each other MFN that can serve as a virtual network egress location for a data message flow of the corporate entity. The egress MFNs in some embodiments include the MFNs connected to external corporate compute nodes (e.g., branch offices, corporate datacenters, and SaaS provider datacenters) as well as MFNs that are candidate locations for mobile device connections and egress Internet connections. In some embodiments, this computation uses a traditional lowest-cost (e.g., shortest-path) identification process that identifies the shortest paths between different MFN pairs.

For each candidate MFN pair, the lowest-cost identification process uses the computed weight scores (i.e., the scores computed at 510) to identify a path with the lowest score when multiple such paths exist between the MFN pair. Several manners for computing lowest-cost paths will be further described below. As mentioned above, the path-identifying layer 282 identifies multiples paths between two MFN pairs in some embodiments. This is to allow the cloud forwarding elements 235 to use different paths under different circumstances. Accordingly, in these embodiments, the process 500 can identify multiple paths between two MFN pairs.

At 530, the process removes from the routing graph the links between MFN pairs that are not used by any of the lowest-cost paths identified at 525. Next, at 535, the process generates the routing tables for the cloud forwarding elements 235 from the routing graph. At 535, the process distributes these routing tables to the cloud forwarding elements 235 of the managed forwarding nodes. After 535, the process ends.

In some embodiments, the virtual network has two types of external connections, which are: (1) external secure connections with the compute nodes (e.g., branch offices, datacenters, mobile users, etc.) of an entity, and (2) external connections to third party computers (e.g., SaaS provider servers) through the Internet. Some embodiments optimize the virtual network by finding optimal virtual-network ingress and egress locations for each datapath that terminates at source and destination nodes outside of the virtual network. For instance, to connect a branch office to a SaaS provider server (e.g., salesforce.com server), some embodiments connect the branch office to an optimal edge MFN (e.g., the MFN that has the fastest network connection to the branch office or the one that is closest to the branch office), and identify an optimal edge MFN to an optimally located SaaS provider server (e.g., the SaaS that is closest to the edge MFN for the branch office or has the fastest path to the edge MFN for the branch office through the edge MFN connected to the SaaS provider server).

To associate each compute node (e.g., a branch office, a mobile user, etc.) of an entity to the closest MFN through a VPN connection, the virtual network provider in some embodiments deploys one or more authoritative domain name servers (DNS) in the public clouds for the compute nodes to contact. In some embodiments, each time a corporate compute node in some embodiments needs to establish a VPN connection (i.e., to initialize or re-initialize the VPN connection) to an MFN of the virtual network provider, the compute node first resolves an address associated with its virtual network (e.g., virtualnetworkX.net) with this authoritative DNS server in order to obtain from this server the identity of the MFN that this server identifies as the MFN that is closest to the corporate compute node. To identify this MFN, the authoritative DNS server provides an MFN identifier (e.g., the IP address of the MFN) in some embodiments. The corporate compute node then establishes a VPN connection to this managed forwarding node.

In other embodiments, the corporate compute node does not first perform a DNS resolution (i.e., does not first resolve a network address for a particular domain) each time that it needs to establish a VPN connection to an MFN of the VNP. For instance, in some embodiments, the corporate compute node sticks with a DNS-resolved MFN for a particular duration (e.g., for a day, a week, etc.) before performing another DNS resolution to determine whether this MFN is still an optimal one to which is should connect.

When the source IP address in the DNS request is that of the local DNS server of the corporate compute node, and not of the node itself, the authoritative DNS server in some embodiments identifies the MFN closest to the local DNS server instead of the MFN closest to the corporate compute node. To address this, the DNS request in some embodiments identifies the corporate compute node in terms of a domain name that includes one or more parts (labels) that are concatenated and delimited by dots, where one of these parts identifies the corporation and the other part identifies the compute node of the corporation.

In some embodiments, this domain name specifies a hierarchy of domains and sub-domains that descends from the right label to the left label in the domain name. The right-most first label identifies the particular domain, a second label to the left of the first label identifies the corporate entity, and a third label to the left of the second label identifies the external machine location of the entity in cases where the entity has more than one external machine location. For instance, in some embodiments, the DNS request identifies the corporate compute node as myNode of company myCompany, and asks for the resolution of the address myNode.myCompany.virtualnetwork.net. The DNS server then uses the myNode identifier to better select the ingress MFN to which the corporate compute node should establish a VPN connection. In different embodiments, the myNode identifier is expressed differently. For example, it may be addressed as an IP address, a latitude/longitude description of a location, a GPS (Global Positioning System) location, a street address, etc.

Even when the IP address properly reflects the location, there may be several potential ingress routers, e.g., belonging to different datacenters in the same cloud or to different clouds in the same region. In such a case, the virtual network authoritative server in some embodiments sends back a list of IPs of potential MFN CFEs (e.g., C5, C8, C12). The corporate compute node in some embodiments then pings the different CFEs in the list, to produce measurements (e.g., distance or speed measurements), and selects the closest one by comparing measurements among the set of CFE candidates.

In addition, the corporate compute node may base this selection by identifying the MFNs currently used by the other compute nodes of the corporate entity. For example, in some embodiments, the corporate compute node adds connection costs to each MFN, so that if many of the corporate branches are already connected to a given cloud, new compute nodes would have an incentive to connect to the same cloud, thus minimizing inter-cloud costs in terms of processing, latency, and dollars.

Other embodiments use other DNS resolution techniques. For instance, each time a corporate compute node (e.g., a branch office, datacenter, a mobile user, etc.) needs to perform a DNS resolution, the corporate compute node (e.g., the mobile device or a local DNS resolver at a branch office or datacenter) communicates with a DNS service provider that serves as an authoritative DNS resolver for a number of entities. In some embodiments, this DNS service provider has DNS resolving machines located in one or more private datacenters, while in other embodiments it is part of one or more public cloud datacenters.

To identify which of N managed forwarding nodes that connect directly to the Internet should be used to reach a SaaS provider server, the virtual network (e.g., the ingress MFN or the controller cluster that configures the MFNs) in some embodiments identifies a set of one or more candidate edge MFNs from the N managed forwarding nodes. As described further below, each candidate edge MFN in some embodiments is an edge MFN that is deemed to be optimal based on a set of criteria, such as distance to SaaS provider server, network connection speed, cost, delay and/or loss, network compute cost, etc.

To assist in identifying the optimal edge points, the controller cluster of some embodiments maintains for an entity a list of the most popular SaaS providers and consumer web destinations and their IP address subnets. For each such destination, the controller cluster assigns one or more of the optimal MFNs (again as judged by physical distance, network connection speed, cost, loss and/or delay, compute cost, etc.) as candidate egress nodes. For each candidate egress MFN, the controller cluster then computes the best route from each possible ingress MFN to the candidate MFN, and sets up the resulting next-hop table in the MFNs accordingly, such that the Internet SaaS provider or web destination is associated to the correct virtual network next-hop node.

Given that the service destination can often be reached through several IP subnets at several locations (as provided by the authoritative DNS server), there are several potential egress nodes to minimize latency and provide load-balancing. Accordingly, in some embodiments, the controller cluster computes the best location and egress node for each MFN, and updates the next-hop accordingly. Also, the best egress node to get to a SaaS provider (e.g., office365.com) may be through one public cloud provider (e.g., Microsoft Azure), but the best ingress MFN from purely a distance or connection speed may be in another public cloud provider (e.g., AWS). In such situations, it may not be optimal in terms of latency, processing and cost to traverse to another cloud (i.e., to the public cloud with the best egress MFN) before leaving the virtual network. Providing multiple candidate edge nodes would allow for the selection of an optimal edge MFN and an optimal path to the selected edge MFN in such situations.

To identify the optimal path through the virtual network to an egress MFN that connects to the Internet or connects to a corporate compute node of the corporate entity, the controller cluster identifies optimal routing paths between the MFNs. As mentioned above, the controller cluster in some embodiments identifies the best path between any two MFNs by first costing each link between a pair of directly connected MFNs, e.g., based on a metric score that reflects the weighted sum of estimated latency and financial costs. The latency and financial costs include in some embodiments (1) link delay measurements, (2) estimated message processing latency, (3) cloud charges for outgoing traffic from a particular datacenter either to another datacenter of the same public cloud provider, or to exit the public cloud (PC) provider's cloud (e.g., to another public cloud datacenter of another public cloud provider or to the Internet), and (4) estimated message processing costs associated with the MFNs executing on host computers in the public clouds.

Using the computed costs of these pair-wise links, the controller cluster can compute the cost of each routing path that uses one or more of these pair-wise links by aggregating the costs of the individual pair-wise links that are used by the routing path. As described above, the controller cluster then defines its routing graph based on the computed costs of the routing paths, and generates the forwarding tables of the cloud routers of the MFNs based on the defined routing graphs. Also, as mentioned above, the controller cluster repeatedly performs these costing, graph-building, and forwarding table update and distribution operations periodically (e.g., once every 12 hours, 24 hours, etc.) or as it receives measurement updates from the measurement agents of the MFNs.

Whenever the forwarding table at an MFN CFE C_ipoints to a next-hop MFN CFE C_j, the CFE C_iconsiders C₁as a neighbor. In some embodiments, the CFE C_iestablishes a secure, actively maintained VPN tunnel to CFE C₁. A secure tunnel in some embodiments is a tunnel that requires the payloads of the encapsulated data messages to be encrypted. Also, in some embodiments, a tunnel is actively maintained by one or both endpoints of the tunnel sending keep alive signals to the other endpoint.

In other embodiments, the CFEs do not establish secure, actively maintained VPN tunnels. For instance, in some embodiments, the tunnels between the CFEs are static tunnels that are not actively monitored through the transmission of keep-alive signals. Also, in some embodiments, these tunnels between the CFEs do not encrypt their payloads. In some embodiments, the tunnels between pair of CFEs include two encapsulating headers, with the inner header identifying the tenant ID and the ingress and egress CFEs for a data message entering and exiting the virtual network (i.e., entering and exiting the public cloud(s)), and the outer encapsulating header specifying the source and destination network addresses (e.g., IP addresses) for traversing through zero or more CFE from the ingress CFE to the egress CFE.

In addition to internal tunnels, the virtual network in some embodiments connects corporate compute nodes to their edge MFNs using VPN tunnels, as mentioned above. Therefore, in the embodiments where secure tunnels are used to connect the CFEs, the data messages transit through virtual network using an entirely secure VPN path.

As the virtual network data messages are forwarded using encapsulation within the virtual network, the virtual network in some embodiments uses its own unique network addresses that are different than the private addresses used by the different private networks of the tenant. In other embodiments, the virtual network uses the private and public network address spaces of the public clouds over which it is defined. In yet other embodiments, the virtual network uses some of its own unique network addresses for some of its components (e.g., some of its MFNs, CFEs, and/or services), while using the private and public network address spaces of the public clouds for other of its components.

Also, in some embodiments, the virtual network uses a clean-slate communication platform with its own proprietary protocols. In the embodiments in which the data messages are forwarded entirely through software MFN routers (e.g., through software CFEs), the virtual network can provide an optimized rate control for long-haul end-to-end connections. This is accomplished in some embodiments by operating a TCP optimization proxy engine 220 at every MFN 150. In other embodiments that do not break the TCP itself (e.g., with HTTPS), this is accomplished by the proxy engine 220 segmenting the rate control using intermediate per-flow buffering together with TCP receiver-window and ACK manipulation.

Due to its clean-slate nature, the virtual network in some embodiments optimizes many of its components to provide an even better service. For instance, in some embodiments, the virtual network uses multiple-path routing to support premium bandwidth-guaranteed VPN setups that are routed across the virtual network. In some embodiments, such VPNs include state data in each MFN similar to ATM/MPLS routing, and their establishment and removal is centrally controlled. Some embodiments identify the available bandwidth per outgoing link, either by measuring it directly (through packet pair or a similar process) or by having a given capacity for the link and reducing from this capacity the traffic that is already sent through this link.

Some embodiments use the residual bandwidth of a link as a constraint. For instance, when a link does not have at least 2 Mbps of available bandwidth, the controller cluster of some embodiments removes the link from the set of links that are used to compute lowest-cost path (e.g., shortest path) to any destination (e.g., remove the link from the routing graph, such as graph 400). If an end-to-end route is still available after the removal of this link, new VPNs will be routed across this new route. VPN removal can bring back available capacity to a given link, which in turn can enable this link to be included in the lowest-cost path (e.g., shortest path) calculation. Some embodiments use other options for multiple-path routing such as load balancing of traffic across multiple paths, e.g., using MPTCP (multi-path TCP).

Some embodiments provide a better service for premium customers by exploiting the path parallelism and the inexpensive cloud links to duplicate traffic from the ingress MFNs to the egress MFN, through two disjoint paths (e.g., maximally disjoint paths) within the virtual network. Under this approach, the earliest message that arrives is accepted, and the later one discarded. This approach increases the virtual network reliability and reduces the delay, at the cost of increasing the egress processing complexity. In some such embodiments, Forward Error Correction (FEC) techniques are used to increase reliability while reducing the duplication traffic. Due to its clean-slate nature, the virtual network of some embodiments performs other upper-layer optimizations, such as application-layer optimizations (e.g., de-duplication and caching operations) and security optimizations (e.g., the addition of encryption, DPI (deep packet inspection) and firewalling).

The virtual network of some embodiments accounts for collaboration with cloud providers, to further improve the virtual network setup by using anycast messaging. For instance, in some embodiments when all MFNs obtain the same external IP address, it is easier to connect any new corporate compute node to an optimal edge node (e.g., the closest edge node) using an anycast connection. Likewise, any SaaS provider can obtain this IP address and connect to the optimal MFN (e.g., closest MFN).

As mentioned above, different embodiments use different types of VPN connections to connect corporate compute nodes (e.g., branches and mobile devices) to the MFNs that establish the virtual network of a corporate entity. Some embodiments use IPsec to set up these VPN connections. FIG. 6 illustrates the IPsec data message format of some embodiments. Specifically, this figure illustrates an original format of a data message 605 generated by a machine at the corporate compute node, and an IPsec encapsulated data message 610 after the data message 605 has been encapsulated (e.g., at the corporate compute node or the MFN) for transmission through an IPsec tunnel (e.g., to the MFN or to the corporate compute node).

In this example, the IPsec tunnel is set up with ESP Tunnel Mode, port 50. As shown, this mode is set up in this example by replacing the TCP protocol identifier in the IP header with an ESP protocol identifier. The ESP header identifies the start of the message 615 (i.e., the header 620 and payload 625). The message 615 has to be authenticated by the recipient of the IPsec encapsulated data message (e.g., by the IPsec gateway of the MFN). The start of the payload 625 is identified by the value of the next field 622 of the message 615. Also, the payload 625 is encrypted. This payload includes the IP header, the TCP header and payload of the original data message 605, as well as a padding field 630, which includes the next field 622.

In some embodiments, each MFN IPsec gateway can handle multiple IPsec connections for the same or different virtual network tenants (e.g., for the same corporation or for different corporations). Accordingly, an MFN IPsec gateway (e.g., gateway 230) in some embodiments identifies each IPsec connection in terms of a tunnel ID, a tenant ID (TID), and a corporate compute node subnet. In some embodiments, different corporate nodes (e.g., different branch offices) of a tenant do not have overlapping IP subnets (per RFC 1579). The IPsec gateway in some embodiments has a table mapping each IPsec tunnel ID (which is contained in the IPsec tunnel header) to a tenant ID. For a given tenant that an IPsec gateway is configured to handle, the IPsec gateway also has a mapping of all subnets of that tenant that connect to the virtual network established by the MFNs and their cloud forwarding elements.

When an ingress first MFN in a first public cloud datacenter receives through an IPsec tunnel a data message associated with a tenant ID and destined to a destination (e.g., a branch or datacenter subnet, or a SaaS provider) that connects to an egress second MFN in a second public cloud datacenter, the IPsec gateway of the first MFN removes the IPsec tunnel header. In some embodiments, the CFE of the first MFN then encapsulates the message with two encapsulating headers that allow the message to traverse a path from the ingress first MFN to the egress second MFN, directly or through one or more other intermediate MFNs. The CFE of the first MFN identifies this path by using its controller-configured routing table.

As mentioned above, the two encapsulating headers in some embodiments include (1) an outer header that specifies the next hop MFN CFE to allow the encapsulated data message to traverse through the MFNs of the virtual network to reach the egress MFN CFE, and (2) an inner header that specifies the tenant ID and the ingress and egress MFN CFEs that identify the MFNs for the data message entering and exiting the virtual network.

Specifically, in some embodiments, the inner encapsulating header includes a valid IP header with the destination IP address of the egress second MFN's CFE and the source IP address of the ingress first MFN's CFE. This approach allows standard IP router software to be used in every CFE of the MFNs. The encapsulation further includes the tenant ID (e.g., a customer CID). When a message arrives at the egress second MFN's CFE, it is decapsulated and sent by the second MFN to its destination (e.g., sent by the second MFN's IPsec gateway to the destination via another IPsec tunnel that is associated with the tenant ID and the destination subnet of the message).

Certain cloud providers prohibit machines from “spoofing” source IP, and/or impose other restrictions for TCP and UDP traffic. To deal with such possible restrictions, some embodiments use the outer header to connect neighboring pairs of MFNs that are used by one or more routes. This header in some embodiments is a UDP header that specifies source and destination IP addresses and the UDP protocol parameters. In some embodiments, the ingress MFN CFE specifies its IP address as the source IP address of the outer header, while specifying the next MFN CFE hop's IP address as the destination IP address of the outer header.

When the path to the egress MFN's CFE includes one or more intermediate MFN CFEs, an intermediate CFE replaces the source IP address in the outer header of the double-encapsulated message that it receives with its IP address. It also uses the destination IP address in the inner header to perform a route lookup in its routing table to identify the destination IP address of the next hop MFN CFE that is on the path to the destination IP address of the inner header. The intermediate CFE then replaces the destination IP address in the outer header with the IP address that it identified through its route table lookup.

When the double encapsulated data message reaches the egress MFN's CFE, the CFE determines that it is the egress node for the data message when it retrieves the destination IP address in the inner header and determines that this destination IP address belongs to it. This CFE then removes the two encapsulating headers from the data message and then sends it to it destination (e.g., through its MFN's IPsec gateway to the destination via another IPsec tunnel that is associated with the tenant ID and the destination IP address or subnet in the data message's original header).

FIG. 7 illustrates an example of the two encapsulating headers of some embodiments, while FIG. 8 presents an example that illustrates how these two headers are used in some embodiments. In the discussion below, the inner header is referred to as the tenant header as it includes the tenant ID along with the identity of the virtual-network ingress/egress nodes connected to the tenant's corporate compute end nodes. The outer header is referred to below as the VN-hop tunnel header because it is used to identify the next hop through the virtual network as the data message traverses a path through the virtual network between ingress and egress MFN CFEs.

FIG. 7 shows a VN-hop tunnel header 705 and a tenant tunnel header 720 encapsulating an original data message 750 with an original header 755 and a payload 760. As shown, the VN-hop tunnel header 705 in some embodiments includes a UDP header 710 and an IP header 715. The UDP header in some embodiments is defined according to a UDP protocol. In some embodiments, the VN-hop tunnel is a standard UDP tunnel, while in other embodiments, this tunnel is a proprietary UDP tunnel. In still other embodiments, this tunnel is a standard or proprietary TCP tunnel. The tunnel header 705 in some embodiments is an encrypted one that encrypts its payload, while in other embodiments it is an unencrypted tunnel.

As further described below, the tunnel header 705 in some embodiments is used to define an overlay VNP network, and is used by each MFN CFE to reach the next hop MFN CFE over the underlay public cloud networks. As such, the IP header 715 of the tunnel header 705 identifies the source and destination IP addresses of the first and second CFEs of the first and second neighboring MFNs connected by the VNP tunnel. In some cases (e.g., when the next hop destination MFN is in a different public cloud of a different public cloud vendor than the source MFN), the source and destination IP addresses are public IP addresses that are used by the public cloud datacenters that include the MFNs. In other cases, when the source and destination MFN CFEs belong to the same public cloud, the source and destination IP addresses can be private IP addresses that are used in just the public cloud. Alternatively, in such cases, the source and destination IP addresses might still be public IP addresses of the public cloud vendor.

As shown in FIG. 7, the tenant tunnel header 720 includes an IP header 725, a tenant ID field 730 and a virtual circuit label (VCL) 735. The tenant tunnel header 720 is used by each hop CFE after the ingress hop CFE to identify the next hop for forwarding the data message to the egress CFE of the egress MFN. As such, the IP header 725 includes a source IP address that is the IP address of the ingress CFE and a destination IP address that is the IP address of the egress CFE. As with the source and destination IP addresses of the VN-hop header 705, the source and destination IP addresses of the tenant header 720 can be either private IP addresses of one public cloud provider (when the data message traverses a route that only goes through one public cloud provider's datacenter), or public IP addresses of one or more public cloud providers (e.g., when the data message traverses a route that goes through datacenters of two or more public cloud providers).

The IP header of the tenant header 720 can be routed by using any standard software router and IP routing table in some embodiments. The tenant ID field 730 contains the tenant ID, which is a unique tenant identifier that can be used at the ingress and egress MFNs to uniquely identify a tenant. The virtual network provider in some embodiments defines different tenant IDs for different corporate entities that are tenants of the provider. The VCL field 735 is an optional routing field that some embodiments use to provide an alternative way (non-IP based way) for forwarding messages through the network. In some embodiments, the tenant tunnel header 720 is a GUE (Generic UDP Encapsulation) header.

FIG. 8 presents an example that illustrates how these two tunnel headers 705 and 710 are used in some embodiments. In this example, a data messages 800 is sent from a first machine 802 (e.g., first VM) in a first branch office 805 of a company to a second machine 804 (e.g., a second VM) in a second branch office 810 of the company. The two machines are in two different subnets, which are 10.1.0.0 and 10.2.0.0, with the first machine having an IP address 10.1.0.17 and the second machine having an IP address 10.2.0.22. In this example, the first branch 805 connects to an ingress MFN 850 in a first public cloud datacenter 830, while the second branch 810 connects to an egress MFN 855 in a second public cloud datacenter 838. Also, in this example, the ingress and egress MFNs 850 and 855 of the first and second public cloud datacenters are indirectly connected through an intermediate MFN 857 of a third public cloud datacenter 836.

As shown, the data message 800 from machine 802 is sent to the ingress MFN 850 along an IPsec tunnel 870 that connects the first branch office 805 to the ingress MFN 850. This IPsec tunnel 870 is established between an IPsec gateway 848 of the first branch office and an IPsec gateway 852 of the ingress MFN 850. This tunnel is established by encapsulating the data message 800 with an IPsec tunnel header 806.

The IPsec gateway 852 of the MFN 850 decapsulates the data message (i.e., removes the IPsec tunnel header 806), and passes the decapsulated message to this MFN's CFE 832 directly or through one or more middlebox service machines (e.g., through a firewall machine, such as machine 210 of FIG. 2). In passing this message, the IPsec gateway or some other module of the MFN 850 in some embodiments associates the message with the tunnel ID of the IPsec tunnel and a tenant ID of the company. This tenant ID identifies the company in the records of the virtual network provider.

Based on the associated tenant ID and/or the IPsec tunnel ID, the CFE 832 of the ingress MFN 850 identifies a route for the message to its destination machine's subnet (i.e., to the second branch office 810) through the virtual network that is established by the MFNs in the different public cloud datacenters. For instance, the CFE 832 uses the tenant ID and/or the IPsec tunnel ID to identify the routing table for the company. In this routing table, the CFE 832 then uses the destination IP address 10.2.0.22 of the received message to identify a record that identifies the CFE 853 of the egress MFN 855 of the public cloud datacenter 838 as the destination egress forwarding node for the data message 800. In some embodiments, the identified record maps the entire subnet 10.2.0.0/16 of the second branch office 810 to the CFE 853 of the MFN 855.

After identifying the egress CFE 853, the CFE 832 of the ingress MFN 850 encapsulates the received data message with a tenant tunnel header 860 that in its IP header 725 includes the source IP of the ingress CFE 832 and the destination IP of the egress CFE 853. In some embodiments, these IP addresses are defined in the public IP address space. The tunnel header 860 also includes the tenant ID that was associated with the data message at ingress MFN 850. As mentioned above, this tunnel header also includes the VCL header value in some embodiments.

In some embodiments, the ingress CFE 832 also identifies the next hop MFN that is on the desired CFE routing path to the egress CFE 853. In some embodiments, the ingress CFE 832 identifies this next hop CFE in its routing table by using the destination IP address of the egress CFE 853. The next hop MFN CFE in this example is the CFE 856 of the third MFN 857 of a third public cloud datacenter 836.

After identifying the next hop MFN CFE, the ingress MFN CFE encapsulates the encapsulated data message 800 with a VN-hop, second tunnel header 862. This tunnel header allows the message to route to the next hop CFE 856. In the IP header 715 of this outer header 862, ingress MFN CFE 832 specifies the source and destination IP addresses as the source IP of the ingress CFE 832 and the destination IP of the intermediate CFE 856. It also specifies its layer 4 protocol as being UDP in some embodiments.

When the CFE 856 of the third MFN 857 receives the double-encapsulated data message, it removes the VN-hop, second tunnel header 862, and the extracts from the tenant header 860 the destination IP address of the CFE 853 of the egress MFN 855. Since this IP address is not associated with the CFE 856, the data message still has to traverse to another MFN to reach its destination. Accordingly, the CFE 856 uses the extracted destination IP address to identify a record in its routing table that identifies the next hop MFN CFE 853. It then changes re-encapsulates the data message with the outer header 705 and specifies the source and destination IP addresses in its IP header 715 as its own IP address and the destination IP address of the MFN CFE 853. Next, the CFE 856 forwards the double-encapsulated data message 800 to the egress CFE 853 through intervening routing fabric of the public cloud datacenters 836 and 838.

After receiving the encapsulated data message, the egress CFE 853 determines that the encapsulated message is directed to it when it retrieves the destination IP address in the inner header 860 and determines that this destination IP address belongs to it. The egress CFE 853 removes both encapsulating headers 860 and 862 from the data message 800, and extracts the destination IP address in the data message's original header. This destination IP address identifies the IP address of the second machine 804 in the second branch office's subnet.

Using the tenant ID in the removed tenant tunnel header 860, the egress CFE 853 identifies the correct routing table to search, and then searches this routing table based on the destination IP address extracted from the original header value of the received data message. From this search, the egress CFE 853 identifies a record that identifies the IPsec connection to use to forward the data message to its destination. It then provides the data message along with the IPsec connection identifier to the second MFN's IPsec gateway 858, which then encapsulates this message with an IPsec tunnel header 859 and then forwards it to an IPsec gateway 854 of the second branch office 810. The gateway 854 then removes the IPsec tunnel header and forwards the data message to its destination machine 804.

Several more detailed message-processing examples will now be described by reference to FIGS. 9-15. In these examples, it is assumed that each tenant IPsec interface is on the same local public IP address, as are the VNP tunnels. As such, the interfaces in some embodiments are attached to a single VRF (virtual routing and forwarding) namespace. This VRF namespace is referred to below as the VNP namespace.

FIGS. 9-11 illustrate message-handling processes 900-1100 that are performed respectively by the ingress, intermediate, and egress MFNs when they receive a message that is sent between two compute devices in two different external machine locations (e.g., branch offices, datacenters, etc.) of a tenant. In some embodiments, the controller cluster 160 configures the CFE of each MFN to operate as an ingress, intermediate, and egress CFE, when each such CFE is a candidate to serve as an ingress, intermediate and egress CFE for different data message flows of a tenant.

The processes 900-1100 will be explained below by reference to two examples in FIGS. 8 and 12. As mentioned above, FIG. 8 illustrates an example when the data message goes through an intermediate MFN to get to the egress MFN. FIG. 12 illustrates an example that does not involve an intermediate MFN between the ingress and egress MFNs. Specifically, it illustrates a data message 1200 being sent from a first device 1202 in a first branch office 1205 to a second device 1210 in a second branch office 1220 when the two branch offices connect to two public cloud datacenters 1230 and 1238 with two MFNs 1250 and 1255 that are directly connected. As shown, the CFEs 1232 and 1253 of the MFNs in these examples perform the routing operations associated with each MFN.

The ingress CFE (e.g., ingress CFE 832 or 1232) of the ingress MFNs 850 and 1250 perform the process 900 in some embodiments. As shown in FIG. 9, the ingress process 900 starts by initially identifying (at 905) the tenant routing context based on the identifier of the IPsec tunnel (e.g., 806 or 1206) in the received data message. In some embodiments, the IPsec gateways or other MFN modules store the tenant IDs for the IPsec tunnel IDs in mapping tables. Whenever a data message is received along a particular IPsec tunnel, the IPsec gateway extracts the IPsec tunnel ID, which this gateway or another MFN module then uses to identify the associated tenant ID by reference to its mapping table. By identifying the tenant ID, the process identifies the tenant routing table or the tenant portion of the VRF namespace to use.

At 910, the process increments the identified IPsec tunnel's RX (receive) counter to account for receiving this data message. Next, at 915, the process performs a route lookup (e.g., a longest prefix match, LPM, lookup) in the identified tenant routing context (e.g., in the tenant's portion of the VRF namespace) to identify the IP address of the egress interface for exiting the tenant's virtual network that is built over the public cloud datacenters. For the branch-to-branch examples, the egress interface is the IP address of an egress CFE (e.g., CFE 853 or 1253) of an MFN connected to the destination branch.

At 920, the process adds a tenant tunnel header (e.g., header 860 or 1260) to the received data message, and embeds the source IP address of the ingress CFE (e.g., ingress CFE 832 or 1252) and the destination IP address of the egress CFE (e.g., egress CFE 853 or 1253) as the source and destination IP addresses in this tunnel header. In the tenant header, the process also stores the tenant ID (identified at 905) in the tenant header. At 920, the process adds a VN-hop tunnel header (e.g., header 862 or 1262) outside of the tenant header, and stores its IP address as the source IP address in this header. The process also specifies (at 920) the UDP parameters (e.g., UDP port) of the VNP tunnel header.

Next, at 925, the process increments the VN-transmit counter for the tenant to account for this data message's transmission. At 930, the process performs a route lookup (e.g., an LPM lookup) in the identified VNP routing context (e.g., in the VNP's portion of the VRF namespace) to identify the next hop interface for this data message. In some embodiments, this route lookup is an LPM lookup (e.g., in the VNP's portion of the VRF namespace) that is at least partially based on the egress CFE's destination IP.

At 935, the process determines whether the next hop egress interface is a local interface (e.g., a physical or virtual port) of the ingress CFE. If so, the process defines (at 937) the destination IP address in the VN-hop outer tunnel header as the egress interface IP address identified at 915. Next, at 940, the process provides the double encapsulated data message to its local interface so that it can be forwarded to the destination egress CFE. After 940, the process 900 ends.

FIG. 12 illustrates an example of the operation 905-940 for the data message 1200 that the ingress CFE 1232 receives from the device 1202 of the first branch office 1205. As shown, this CFE's MFN 1250 receives this data message as an IPsec encapsulated message at its IPsec gateway 1252 from the IPsec gateway 1248 of the first branch office 1205. The ingress CFE 1232 encapsulates the received message 1200 (after its IPsec header has been removed by an IPsec gateway 1252) with a VN-hop tunnel header 1262 and a tenant tunnel header 1260, and forwards this double encapsulated message to the egress CFE 1253 of MFN 1255 of public cloud 1238. As shown, the source and destination IP addresses of both tunnel headers 1260 and 1262 are identical in this example. Given that these two sets of IP addresses are identical, some embodiments forego using the outer IP header 1262 when the data message is not routed through any intervening CFE, such as CFE 856.

When the process determines (at 935) that the next hop egress interface is not a local interface of the ingress CFE but rather is the destination IP address of another router, the process embeds (at 945) in the VN-hop tunnel header, the destination IP address of the next hop intermediate CFE (e.g., intermediate CFE 856) as the destination IP address of the VN-hop tunnel header.

Next, at 950, the process performs another route lookup (e.g., an LPM lookup) in the identified VNP routing context (e.g., in the VNP's portion of the VRF namespace). This time, the lookup is based on the IP address of the intermediate CFE that is identified in the VNP tunnel header. As the intermediate CFE (e.g., CFE 856) is a next-hop CFE in the virtual network for the ingress CFE (e.g., CFE 832), the routing table identifies a local interface (e.g., a local port) for data messages sent to the intermediate CFE. Thus, this lookup in the VNP routing context identifies a local interface, to which the ingress CFE provides (at 950) the double-encapsulated message. The process then increments (at 955) the VN-intermediate counter to account for this data message's transmission. After 955, the process ends.

FIG. 10 illustrates a process 1000 that a CFE (e.g., CFE 853 or 1253) of an egress MFN performs in some embodiments when it receives a data message that should be forwarded to a corporate compute node (e.g., a branch office, datacenter, remote user location) connected to the MFN. As shown, the process initially receives (at 1005) the data message on an interface associated with the virtual network. This message is encapsulated with the VN-hop tunnel header (e.g., header 862 or 1262) and tenant tunnel header (e.g., header 860 or 1260).

At 1010, the process determines that the destination IP address in the VN-hop tunnel header is its CFE's destination IP address (e.g., IP address of CFE 853 or 1253). Next, at 1015, the process removed the two tunnel headers. The process then retrieves (at 1020) the tenant ID from the removed tenant tunnel header. To account for the received data message, the CFE then increments (at 1025) the RX (receive) counter that it maintains for the tenant specified by the extracted tenant ID.

Next, at 1030, the process performs a route lookup (e.g., an LPM lookup) in the identified tenant routing context (i.e., in the routing context of the tenant identified by the tenant ID extracted at 1020) to identify the next hop interface for this data message. The process performs this lookup based on the destination IP address in the original header (e.g., header 755) of the received data message in some embodiments. From the record identified through this lookup, the process 1000 identifies the IPsec interface through which the data message has to be sent to its destination. Accordingly, the process 1000 sends the decapsulated, received data message to its MFN's IPsec gateway (e.g., gateway 858 or 1258).

This gateway then encapsulates the data message with an IPsec tunnel header (e.g., tunnel header 859 or 1259) and forwards it to a gateway (e.g., gateway 854 or 1254) in the destination corporate compute node (e.g., destination branch office), where it will be decapsulated and forwarded to its destination. After 1030, the CFE or its MFN increments (at 1035) the counter that it maintains for transmitting messages along the IPsec connection to the destination corporate compute node (e.g., the IPsec connection between gateways 854 and 858, or between gateways 1254 and 1258).

FIG. 11 illustrates a process 1100 that a CFE (e.g., CFE 856) of an intermediate MFN performs in some embodiments when it receives a data message that should be forwarded to another CFE of another MFN. As shown, the process initially receives (at 1105) the data message on an interface associated with the virtual network. In some embodiments, this message is encapsulated with two tunnel headers, a VN-tunnel header (e.g., header 862) and a tenant tunnel header (e.g., header 860).

At 1110, the process terminates the VN-hop tunnel as it determines that the destination IP address in this tunnel header is its CFE's destination IP address (e.g., is the destination IP address of CFE 856). Next, at 1115, the process determines whether the VN-hop tunnel header specifies the correct UDP port. If not, the process ends. Otherwise, at 1120, the process removes the VN-hop tunnel header. To account for the received data message, the CFE then increments (at 1125) the RX (receive) counter that it maintains to quantify the number of messages that it has received as an intermediate hop CFE.

At 1130, the process performs a route lookup (e.g., an LPM lookup) in the identified VNP routing context (e.g., in the VNP's portion of the VRF namespace) to identify the next hop interface for this data message. In some embodiments, this route lookup is an LPM lookup (e.g., in the VNP's portion of the VRF namespace) that is at least partially based on the egress CFE's destination IP that is identified in the inner tenant tunnel header.

The process then determines (at 1135) whether the next hop egress interface is a local interface of the intermediate CFE. If so, the process adds (at 1140) the VN-hop tunnel header to the data message, which is already encapsulated with the tenant tunnel header. The process sets (at 1142) the destination IP address in the VN-hop tunnel header to the egress CFE's destination IP address that is specified in the tenant tunnel header. It also sets (at 1142) the source IP address in the VN-hop tunnel header to the IP address of its CFE. In this tunnel header, the process also sets the UDP attributes (e.g., the UDP port, etc.).

Next, at 1144, the process provides the double encapsulated data message to its local interface (identified at 1130) so that it can be forwarded to the destination egress CFE. One example of this VN-hop tunnel de-capsulation and forwarding was described above by reference to the operations of CFE 856 in FIG. 8. To account for the received data message, the CFE then increments (at 1146) the TX (transmit) counter that it maintains to quantify the number of messages that it has transmitted as an intermediate hop CFE. After 1146, the process 1100 ends.

On the other hand, when the process determines (at 1135) that the next hop egress interface is not a local interface of its CFE but rather is the destination IP address of another router, the process adds (at 1150) a VN-hop tunnel header to the data message from which it previously removed a VN-hop tunnel header. In the new VN-hop tunnel header, the process 1100 embeds (at 1150) the source IP address of its CFE and the destination IP address (identified at 1130) of the next hop intermediate CFE as the source and destination IP addresses of the VN-hop tunnel header. This VNP tunnel header also specifies a UDP layer 4 protocol with a UDP destination port.

Next, at 1155, the process performs another route lookup (e.g., an LPM lookup) in the identified VNP routing context (e.g., in the VNP's portion of the VRF namespace). This time, the lookup is based on the IP address of the next hop intermediate CFE that is identified in the new VN-hop tunnel header. As this intermediate CFE is a next-hop of the current intermediate CFE in the virtual network, the routing table identifies a local interface for data messages sent to the next-hop intermediate CFE. Thus, this lookup in the VNP routing context identifies a local interface, to which the current intermediate CFE provides the double-encapsulated message. The process then increments (at 1160) the VN-intermediate TX (transmit) counter to account for this data message's transmission. After 1160, the process ends.

FIG. 13 illustrates a message-handling process 1300 that is performed by the CFE of the ingress MFN when it receives a message for a tenant that is sent from a corporate compute device of the tenant (e.g., in a branch office) to another tenant machine (e.g., in another branch office, tenant datacenter or a SaaS provider datacenter). The process 900 of FIG. 9 is a subset of this process 1300 as further described below. As shown in FIG. 13, the process 1300 starts by initially identifying (at 905) the tenant routing context based on the identifier of the incoming IPsec tunnel.

At 1310, the process determines whether both the source and destination IP addresses in the received data message's header are public IP addresses. If so, the process (at 1315) drops the data message and increments the drop counter that it maintains for the received data message's IPsec tunnel. At 1315, the process drops the counter because it should not be receiving messages that are addressed to and from public IP addresses when it receives the messages through the tenant's IPsec tunnel. In some embodiments, the process 1300 also sends back to the source corporate compute machine an ICMP error message.

On the other hand, when the process determines (at 1310) that the data message is not coming from a public IP address and going to another public IP address, the process determines (at 1320) whether the destination IP address in the received data message's header is a public IP address. If so, the process transitions to 1325 to perform process 900 of FIG. 9, with the exception of operation 905, which it has performed at the start of the process 1300. After 1325, the process 1300 ends. On the other hand, when the process 1300 determines (at 1320) that the destination IP address in the received data message's header is not a public IP address, the process increments (at 1330) the identified IPsec tunnel's RX (receive) counter to account for receiving this data message.

The process 1300 then performs (at 1335) a route lookup (e.g., an LPM lookup) in the identified tenant routing context (e.g., in the tenant's portion of the VRF namespace). This lookup identifies the IP address of the egress interface for exiting the tenant's virtual network that is built over the public cloud datacenters. In the example illustrated in FIG. 13, the process 1300 reaches the lookup operation 1335 when the data message is intended for a machine in a SaaS provider datacenter. Hence, this lookup identifies the IP address of the egress router for exiting the tenant's virtual network to reach the SaaS provider machine. In some embodiments, all the SaaS provider routes are installed in one route table or in one portion of the VRF namespace, while in other embodiments the routes for the different SaaS providers are stored in different route tables or different VRF namespace portions.

At 1340, the process adds a tenant tunnel header to the received data message, and embeds the source IP address of the ingress CFE and the destination IP address of the egress router as the source and destination IP addresses in this tunnel header. Next, at 1345, the process increments the VN-transmit counter for the tenant to account for this data message's transmission. At 1350, the process performs a route lookup (e.g., an LPM lookup) in the VNP routing context (e.g., in the VNP's portion of the VRF namespace) to identify one of its local interfaces as the next hop interface for this data message. When the next hop is another CFE (e.g., in other public cloud datacenter), the process in some embodiments further encapsulates the data message with the VN-hop header, and embeds its CFE's IP address and the other CFE's IP address as the source and destination addresses of the VN-hop header. At 1355, the process provides the encapsulated data message to its identified local interface so that the data message can be forwarded to its egress router. After 1355, the process 1300 ends.

In some cases, the ingress MFN can receive a data message for a tenant that its CFE can directly forward to the data message's destination machine without going through another MFN's CFE. In some such cases, the data message does not need to be encapsulated with a tenant header or a VN-hop header when the CFE does not need to relay any tenant specific information to any other subsequent VN processing module or the needed information can be provided to the subsequent VN processing module through other mechanisms.

For instance, to directly forward a tenant's data message to an external SaaS provider datacenter, the ingress MFN's NAT engine 215 would have to perform a NAT operation based on the tenant identifier, as further described below. The ingress CFE or another module in the ingress MFN has to provide the tenant identifier to the ingress MFN's associated NAT engine 215. When the ingress CFE and NAT engines execute on the same computer, some embodiments share this information between these two modules by storing it in a shared memory location. On the other hand, when the CFE and NAT engines do not execute on the same computer, some embodiments use other mechanisms (e.g., an out-of-band communication) to share the tenant ID between the ingress CFE and NAT engines. In such cases, however, other embodiments use an encapsulating header (i.e., use an in-band communication) to store and share the tenant ID between different modules of the ingress MFN.

In some embodiments, a virtual network provider uses the above-described processes, systems, and components to provide multiple virtual WANs for multiple different tenants (e.g., multiple different corporate WANs for multiple corporations) over multiple public clouds of the same or different public cloud providers. FIG. 14 presents an example that shows M virtual corporate WANs 1415 for M tenants of a virtual network provider that has network infrastructure and controller cluster(s) 1410 in N public clouds 1405 of one or more public cloud providers.

Each tenant's virtual WAN 1415 can span all of the N public clouds 1405, or a subset of these public clouds. Each tenant's virtual WAN 1415 connects one or more branch offices 1420, datacenters 1425, SaaS provider datacenters 1430, and remote devices of the tenant. In some embodiments, each tenant's virtual WAN spans any public cloud 1405 that the VNP's controller cluster deems necessary for efficiently forwarding data messages between the different compute nodes 1420-1435 of the tenant. In selecting the public clouds, the controller cluster in some embodiments also accounts for public clouds that the tenant selects and/or the public clouds in which the tenant, or at least one SaaS provider of the tenant, has one or more machines.

The virtual WAN 1415 of each tenant allows the remote devices 1435 (e.g., mobile devices or remote computers) of the tenant to avoid interacting with the tenant's WAN gateway at any branch office or tenant datacenter, in order to access a SaaS provider service (i.e., to access a SaaS provider machine or machine cluster). The tenant's virtual WAN in some embodiments allows the remote devices to avoid the WAN gateways at the branch offices and tenant datacenters, by moving the functionalities of these WAN gateways (e.g., the WAN security gateways) to one or more machines in the public clouds spanned by the virtual WAN.

For example, to allow a remote device to access the compute resources of the tenant or its SaaS provider services, a WAN gateway in some embodiments has to enforce firewall rules that control how the remote device can access the tenant's computer resources or its SaaS provider services. To avoid branch or datacenter WAN gateways of the tenant, the tenant's firewall engines 210 are placed in the virtual network MFNs in one or more public clouds spanned by the tenant's virtual WAN.

The firewall engines 210 in these MFNs perform the firewall service operations on the data message flows from and to the remote devices. By performing these operations in the virtual network deployed over one or more public clouds, the data message traffic associated with the tenant's remote devices do not need to be unnecessarily routed through the tenant's datacenter(s) or branch offices in order to receive firewall rule processing. This alleviates traffic congestion in the tenant datacenters and branch offices, and avoids consuming expensive ingress/egress network bandwidth at these locations for processing traffic that is not destined to compute resources at these locations. It also helps speed up the forwarding of the data message traffic from and to the remote devices as this approach allows the intervening firewall rule processing to occur within the virtual network as the data message flows traverse to their destinations (e.g., at their ingress MFNs, egress MFNs or intermediate-hop MFNs).

In some embodiments, the firewall enforcing engine 210 (e.g., firewall service VM) of an MFN receives firewall rules form the VNP central controllers 160. A firewall rule in some embodiments includes a rule identifier and an action. The rule identifier in some embodiments includes one or more match values that are to be compared to data message attributes, such as layer 2 attributes (e.g., MAC addresses), layer 3 attributes (e.g., five tuple identifiers, etc.), tenant ID, location ID (e.g., office location ID, datacenter ID, remote user ID, etc.), in order to determine whether the firewall rule matches a data message.

The firewall rule's action in some embodiments specifies the action (e.g., allow, drop, re-direct, etc.) that the firewall enforcing engine 210 has to take on a data message when the firewall rule matches the data message's attributes. To address the possibility that multiple firewall rules match a data message, the firewall enforcing engine 210 stores the firewall rules (that it receives from the controller cluster 160) in a firewall rule data storage in a hierarchical manner so that one firewall rule can have higher priority than another firewall rule. When a data message matches two firewall rules, the firewall enforcing engine applies the rule with the higher priority in some embodiments. In other embodiments, the firewall enforcing engine examines the firewall rules according to their hierarchy (i.e., examines higher priority rules before lower priority rules) in order to ensure that it first matches the higher priority rule in case another lower priority rule might also be a match for the data message.

Some embodiments allow the controller cluster to configure the MFN components to have the firewall service engines examine a data message at an ingress node (e.g., node 850) as it enters a virtual network, at an intermediate node (e.g., node 857) on the virtual network or at an egress node (e.g., node 855) as it exits the virtual network. At each of these nodes, the CFE (e.g., 832, 856, or 858) in some embodiments calls its associated firewall service engine 210 to perform the firewall service operation on the data message that the CFE receives. In some embodiments, the firewall service engine returns its decision to the module that called it (e.g., to the CFE) so that this module can perform the firewall action on the data message, while in other embodiments, the firewall service engine performs its firewall action on the data message.

In some embodiments, other MFN components direct the firewall service engine to perform its operation. For instance, at an ingress node, the VPN gateway (e.g., 225 or 230) in some embodiments directs its associated firewall service engine to perform its operation, in order to determine whether the data message should be passed to the ingress node's CFE. Also, at the egress node, the CFE in some embodiments passes the data message to its associated firewall service engine, which if it decides to allow the data message through, then passes the data message through an external network (e.g., the Internet) to its destination, or passes the data message to its associated NAT engine 215 to perform its NAT operation before passing the data message to its destination through an external network.

The virtual network providers of some embodiments allow the tenant's WAN security gateway that is defined in the public clouds to implement other security services in addition to, or instead of, firewall services. For instance, a tenant's distributed WAN security gateway (which in some embodiments is distributed over each public cloud datacenter that is spanned by the tenant's virtual network) not only includes firewall service engines, but also includes intrusion detection engines and intrusion prevention engines. In some embodiments, the intrusion detection engines and intrusion prevention engines are incorporated architecturally in the MFN 150 to occupy similar position to the firewall service engine 210.

Each of these engines in some embodiments includes one or more storages that store intrusion detection/prevention policies distributed by the central controller cluster 160. In some embodiments, these policies configure the engines to detect/prevent unauthorized intrusions into the tenant's virtual network (that is deployed over several public cloud datacenters), and to take actions in response to detected intrusion events (e.g., generating logs, sending out notifications, shutting down services or machines, etc.). Like firewall rules, the intrusion detection/prevention policies can be enforced at various different managed forwarding nodes (e.g., ingress MFNs, intermediate MFNs, and/or egress MFNs of the data message flows) over which the virtual network is defined.

As mentioned above, the virtual network provider deploys each tenant's virtual WAN by deploying at least one MFN in each public cloud spanned by the virtual WAN, and configuring the deployed MFNs to define routes between the MFNs that allow the tenant's message flows to enter and exit the virtual WAN. Also, as mentioned above, each MFN can be shared by different tenants in some embodiments, while in other embodiments each MFN is deployed for just one particular tenant.

In some embodiments, each tenant's virtual WAN is a secure virtual WAN that is established by connecting the MFNs used by that WAN through overlay tunnels. This overlay tunnel approach in some embodiments encapsulates each tenant's data message flows with a tunnel header that is unique to each tenant, e.g., contains a tenant identifier that uniquely identifies the tenant. For a tenant, the virtual network provider's CFEs in some embodiments use one tunnel header to identify ingress/egress forwarding elements for entering/exiting the tenant's virtual WAN, and another tunnel header to traverse intervening forwarding elements of the virtual network. The virtual WAN's CFEs use different overlay encapsulation mechanisms in other embodiments.

To deploy a virtual WAN for a tenant over one or more public clouds, the VNP's controller cluster (1) identifies possible edge MFNs (that can serve as ingress or egress MFNs for different data message flows) for the tenant based on locations of the tenant's corporate compute nodes (e.g., branch offices, datacenters, mobile users, and SaaS providers), and (2) identifies routes between all possible edge MFNs. Once these routes are identified they are propagated to the forwarding tables of the CFEs (e.g., propagated using OpenFlow to different OVS-based virtual network routers). Specifically, to identify optimal routes through a tenant's virtual WAN, the MFNs associated with this WAN generate measurement values that quantify the quality of the network connection between them and their neighboring MFNs, and regularly provide their measurements to the VNP's controller cluster.

As mentioned above, the controller cluster then aggregates the measurements from the different MFNs, generates routing graphs based on these measurements, defines routes through a tenant's virtual WAN, and then distributes these routes to the forwarding elements of the CFEs of the MFNs. To dynamically update the defined routes for a tenant's virtual WAN, the MFNs associated with this WAN periodically generate their measurements and provide these measurements to the controller cluster, which then periodically repeats its measurement aggregation, route-graph generation, route identification, and route distribution based on the updated measurements that it receives.

In defining the routes through a tenant's virtual WAN, the VNP's controller cluster optimizes the routes for the desired end-to-end performance, reliability and security, while trying to minimize the routing of tenant's message flows through the Internet. The controller cluster also configures the MFN components to optimize the layer 4 processing of the data message flows passing through the network (e.g., to optimize the end-to-end rate of TCP connections by splitting the rate control mechanisms across the connection path).

With the proliferation of public clouds, it is often very easy to find a major public cloud datacenter close to each branch office of a corporation. Similarly, SaaS vendors are increasingly hosting their applications within public clouds, or are similarly located at the vicinity of some public cloud datacenter. Consequently, the virtual corporate WANs 1415 securely use the public clouds 1405 as corporate network infrastructure that have presence in the vicinity of the corporate compute nodes (e.g., branch offices, datacenters, remote devices, and SaaS providers).

Corporate WANs require bandwidth guarantees in order to provide business critical application at an acceptable performance at all times. Such applications maybe interactive data applications, e.g. ERP, financial or procurement, deadline-oriented application (e.g., industrial or IoT control), real time application (e.g., VoIP or video conferencing). Consequently, traditional WAN infrastructure (e.g., Frame Relay or MPLS) provides such guarantees.

A main obstacle in providing bandwidth guarantee in a multi-tenant network (e.g., a shared virtual network over which multiple virtual networks are defined) is the need to reserve bandwidth over one or more path for a certain customer. In some embodiments, the VNP offers QoS services and provides an Ingress Committed Rate (ICR) guarantee and an Egress Committed Rate (ECR) guarantee. ICR refers to the traffic rate coming into the virtual network, while ECR refers to the traffic rate exiting the virtual network to the tenant site.

As long as traffic does not exceed ICR and ECR limits, the virtual network in some embodiments provides bandwidth and delay guarantees. For example, as long as HTTP ingress or egress traffic do not exceed 1 Mbps, the bandwidth and low delay are guaranteed. This is the point-to-cloud model because, for QoS purposes, the VNP need not keep track of traffic destinations, as long as its destinations are within the ICR/ECR bounds. This model is sometimes called the hose model.

For the more stringent applications, where a customer desires a point-to-point guarantee, a virtual data pipe needs to be constructed to deliver the highly critical traffic. For example, an enterprise may want two hub sites or datacenters connected with high service level agreement guarantees. To that end, VNP routing automatically chooses a routing path that satisfies the bandwidth constraint for each customer. This is referred to as the point-to-point model or the pipe model.

The main advantage of VNP in providing guaranteed bandwidth to end users is the ability to adjust the VNP infrastructure according to the changing bandwidth demands. Most public clouds provide minimum bandwidth guarantees between each two instances located at different regions of the same cloud. If the current network does not have enough unused capacity to provide the guaranteed bandwidth for a new request, the VNP adds new resources to its facilities. For example, the VNP can add new CFEs in high-demand regions.

One challenge is to optimize the performance and the cost of this new dimension in planning routes and scaling up and down the infrastructure. To facilitate the algorithms and bandwidth accounting, some embodiments assume that end-to-end bandwidth reservations are not split. In other ways, if a certain bandwidth (e.g., 10 Mbps) is reserved between branch A and branch B of a certain tenant, the bandwidth is allocated over a single path that starts from an ingress CFE to which branch A connects, and then traverses a set of zero or more intermediate CFEs to reach the egress CFE that is connected to branch B. Some embodiments also assume that the bandwidth guaranteed path only traverse a single public cloud.

In order to account for the various bandwidth reservation that intersect over the network topology, the VNP in some embodiments defines the routing over a reserved bandwidth path statically, so that data message flows always traverse through the same routes that were reserved for the bandwidth requirements. In some embodiments, each route is identified with a single tag that each CFE traversed by the route matches to a single outgoing interface associated with this route. Specifically, each CFE matches a single outgoing interface to each data message that has this tag in its header and arrives from a specific incoming interface.

In some embodiments, the controller cluster maintains a network graph that is formed by several interconnected nodes. Each node n in the graph has the allocated total guaranteed bandwidth (TBW_n) associated with this node and the amount of bandwidth already reserved (allocated to a certain reserved path) by this node (RBW_n). In addition, for each node, the graph includes the cost in cents per gigabyte (C_ij) and the delay in milliseconds (D_ij) associated with sending traffic between this node and all other nodes in the graph. The weight associated with sending traffic between node i and node j is W_ij*C_ij+D_ij, where a is a system parameter that is typically between 1 and 10.

When a request for a bandwidth reservation of value BW between branches A and B is accepted, the controller cluster first maps the request to specific ingress and egress routers n and m, which are bound to branches A and B respectively. The controller cluster then executes a routing process that conducts two lowest-cost (e.g., shortest path) computations between n and m. The first is a lowest-cost (e.g., shortest path) route between n and m irrespective of the available bandwidth along the computed route. The total weight of this route is computed as W₁.

The second lowest-cost (e.g., shortest path) computation initially modifies the graph by eliminating all nodes i where BW>TBW_i−RBW_i. The modified graph is termed the trimmed graph. The controller cluster then performs a second lowest-cost (e.g., shortest path) route computation over the trimmed graph. If the weight of the second route is no more than K percent (K is typically 10%-30%) higher than the first route, the second route is selected as the preferred path. On the other hand, when this requirement is not met, the controller cluster will add to the first path the node i with the smallest value of TBW_i−RBW_i, and then repeats the two lowest-cost (e.g., shortest path) computations. The controller cluster will continue adding more routers until the condition is met. At that point, the reserved bandwidth BW is added to all RBW_iwhere i is a router on the selected route.

For the special case of a request for additional bandwidth for a route that already has reserved bandwidth, the controller cluster will first delete the current bandwidth reservation between nodes A and B and will calculate the path for the total bandwidth request between these nodes. To do this, the information held for each node in some embodiments also includes the bandwidth reserved for each tag, or each source and destination branches, and not only the overall bandwidth reserved. After bandwidth reservations are added to the network, some embodiments do not revisit the routes so long as there are no major changes in measured network delays or costs through the virtual network. However, when the measurements and/or costs change, these embodiments repeat the bandwidth reservation and route computation processes.

FIG. 15 conceptually illustrates a process 1500 performed by the controller cluster 160 of the virtual network provider to deploy and manage a virtual WAN for a particular tenant. In some embodiments, the process 1500 is performed by several different controller programs executing on the controller cluster 160. The operations of this process do not necessarily have to follow the sequence illustrated in FIG. 15, as these operations can be performed by the different programs in parallel or in a different sequence. Accordingly, these operations are illustrated in this figure only to describe one exemplary sequence of operations performed by the controller cluster.

As shown, the controller cluster initially deploys (at 1505) several MFNs in several public cloud datacenters of several different public cloud providers (e.g., Amazon AWS, Google GCP, etc.). The controller cluster in some embodiments configures (at 1505) these deployed MFNs for one or more other tenants that are different than the particular tenant for which the process 1500 is illustrated.

At 1510, the controller cluster receives from the particular tenant data about external machine attributes and locations of the particular tenant. In some embodiments, this data includes the private subnets used by the particular tenant as well as identifiers for one or more tenant offices and datacenters at which the particular tenant has external machines. In some embodiments, the controller cluster can receive the tenant data through APIs or through a user interface that the controller cluster provides.

Next, at 1515, the controller cluster generates a routing graph for the particular tenant from the measurements collected by the measurement agents 205 of the MFNs 150 that are candidate MFNs to use for establishing the virtual network for the particular tenant. As mentioned above, the routing graph has nodes that represent the MFNs, and links between the nodes that represent the network connections between the MFNs. The links have associated weights, which are cost values that quantify the quality and/or cost of using the network connections represented by the links. As mentioned above, the controller cluster first generates a measurement graph from the collected measurements, and then generates the routing graph by removing links from the measurement graph that are not optimal (e.g., that have large delays or drop rates).

After constructing the routing graph, the controller cluster performs (at 1520) path searches to identify possible routes between different pairs of candidate ingress and egress nodes (i.e., MFNs) that the tenant's external machines can use to send data messages into the virtual network (deployed by the MFNs) and to receive data messages from the virtual network. In some embodiments, the controller cluster uses known path search algorithms to identify different paths between each candidate ingress/egress pair of nodes. Each path for such a pair uses one or more links that when concatenated traverse from the ingress node to the egress node through zero or more intermediate nodes.

In some embodiments, the cost between any two MFNs comprises a weighted sum of estimated latency and financial costs for a connection link between the two MFNs. The latency and financial costs include in some embodiments one or more of the following: (1) link delay measurements, (2) estimated message processing latency, (3) cloud charges for outgoing traffic from a particular datacenter either to another datacenter of the same public cloud provider, or to exit the public cloud (PC) provider's cloud (e.g., to another public cloud datacenter of another public cloud provider or to the Internet), and (4) estimated message processing costs associated with the MFNs executing on host computers in the public clouds.

Some embodiments assess a penalty for connection links between two MFNs that traverse through the public Internet, in order to minimize such traversal whenever possible. Some embodiments also incentivize the use of private network connections between two datacenters (e.g., by reducing the connection link cost) in order to bias the route generation towards using such connections. Using the computed costs of these pair-wise links, the controller cluster can compute the cost of each routing path that uses one or more of these pair-wise links by aggregating the costs of the individual pair-wise links that are used by the routing path.

The controller cluster then selects (at 1520) one or up to N identified paths (where N is an integer larger than 1) based on the computed costs (e.g., the lowest aggregate cost) of the identified candidate paths between each candidate ingress/egress pair of nodes. In some embodiments, the computed costs for each path are based on the weight cost of each link used by the path (e.g., is a sum of each link's associated weight value), as mentioned above. The controller cluster can select more than one path between a pair of ingress/egress nodes when more than one route is needed between two MFNs to allow the ingress MFN or an intermediate MFN to perform a multi-path operation.

After selecting (at 1520) one or N paths for each candidate pair of ingress/egress nodes, the controller cluster defines one or N routes based on the selected paths, and then generates route tables or route table portions for the MFNs that implement the particular tenant's virtual network. The generated route records identify edge MFNs to reach different subnets of the particular tenant, and identify next hop MFNs for traversing routes from ingress MFNs to egress MFNs.

At 1525, the controller cluster distributes route records to the MFNs in order to configure the forwarding elements 235 of these MFNs to implement the virtual network for the particular tenant. In some embodiments, the controller cluster communicates with the forwarding elements to pass the route records by using communication protocols that are presently used in a software defined multi-tenant datacenter to configure software routers executing on host computers to implement a logical network that spans the host computers.

Once the MFNs have been configured and the virtual network is operational for the particular tenant, the edge MFNs receive data messages from tenant's external machines (i.e., machines outside of the virtual network) and forward these data messages to edge MFNs in the virtual network, which in turn forward the data messages to other external machines of the tenant. While performing such forwarding operations, the ingress, intermediate and egress MFNs collect statistics regarding their forwarding operations. Also, in some embodiments, one or more modules on each MFN in some embodiments collect other statistics regarding network or compute consumption in the public cloud datacenters. In some embodiments, the public cloud providers collect such consumption data and pass the collected data to the virtual network provider.

When approaching a billing cycle, the controller cluster collects (e.g., at 1530) statistics collected by the MFNs, and/or the network/compute consumption data collected by the MFNs or provided by the public cloud providers. Based on the collected statistics, and/or provided the network/compute consumption data, the controller cluster generates (at 1530) billing reports and sends the billing reports to the particular tenant.

As mentioned above, the amount billed in the billing report accounts for statistics and network/consumption data that the controller cluster receives (e.g., at 1530). Also, in some embodiments, the bill accounts for the cost that the virtual network provider incurred to operate the MFNs (that implement the virtual network for the particular tenant) plus a rate of return (e.g., a 10% increase). This billing scheme is convenient for the particular tenant because the particular tenant does not have to deal with bills from multiple different public cloud providers over which the tenant's virtual network is deployed. The VNP's incurred cost in some embodiments includes the cost charged to the VNP by the public cloud providers. At 1530, the controller cluster also charges a credit card or electronically withdraws funds from a bank account for the charges reflected in the billing report.

At 1535, the controller cluster determines whether it has received new measurements from the measurement agents 205. If not, the process transitions to 1545, which will be described below. On the other hand, when the controller cluster determines that it has received new measurements from the measurement agents, it determines (at 1540) whether it needs to re-examine its routing graph for the particular tenant based on the new measurements. Absent an MFN failure, the controller cluster in some embodiments at most updates its routing graph for each tenant once during a particular time period (e.g., once every 24 hours or every week) based on received, updated measurements.

When the controller cluster determines (at 1540) that it needs to re-examine the routing graph based on new measurements that it has received, the process generates (at 1545) a new measurement graph based on the newly received measurements. In some embodiments, the controller cluster uses a weighted sum to blend each new measurement with the prior measurements in order to ensure that the measurement values associated with the links of the measurement graph do not fluctuate dramatically each time a new measurement set is received.

At 1545, the controller cluster also determines whether it needs to adjust the routing graph based on the adjusted measurement graph (e.g., whether it needs to adjust weight values for the routing-graph links, or add or remove links in the routing graph because of adjusted measurement values associated with the links). If so, the controller cluster (at 1545) adjusts the routing graph, performs path search operations (such as operations 1520) to identify routes between ingress/egress node pairs, generates route records based on the identified routes, and distributes route records to the MFNs. From 1545, the process transitions to 1550.

The process also transitions to 1550 when the controller cluster determines (at 1540) that it does not need to re-examine the routing graph. At 1550, the controller cluster determines whether it has to collect statistics regarding data messages processed and network/compute resources consumed. If not, the process returns to 1535 to determine whether it has received new measurements from the MFN measurement agents. Otherwise, the process returns to 1530 to collect statistics and network/compute consumption data, and to generate and send billing reports. In some embodiments, the controller cluster repeatedly performs the operations of the process 1500 until the particular tenant no longer needs a virtual network that is deployed across the public cloud datacenters.

In some embodiments, the controller cluster not only deploys virtual networks for tenants in the public cloud datacenters, but also assists the tenants in deploying and configuring compute node machines and service machines in the public cloud datacenters. The deployed service machines can be machines separate from the service machines of the MFNs. In some embodiments, the controller cluster billing report to the particular tenant also accounts for compute resources consumed by the deployed compute and service machines. Again, having one bill from one virtual network provider for network and compute resources consumed in multiple public cloud datacenters of multiple public cloud providers is more preferable for the tenant than receiving multiple bills from multiple public cloud providers.

Other embodiments use other deployment models to deploy dedicated or shared MFNs to implement dedicated or shared virtual networks over the network and compute infrastructure of two or more public cloud providers. For instance, in some embodiments, the virtual network provider allows one or more cloud service resellers to deploy dedicated or shared MFNs for one or more of their customers. In some embodiments, a dedicated virtual network is one that is established with dedicated MFNs that are deployed for one entity. On the other hand, in some of these embodiments, a shared virtual network is one that is established with shared MFNs that are deployed for use by multiple entities. Multiple segregated virtual networks for multiple entities can be defined over a shared virtual network in some embodiments.

FIG. 16 illustrates one such deployment model. As shown, this deployment model uses three levels of SaaS providers 1605-1615 that provide three sets of SaaS services. The first SaaS layer 1605 is provided by one or more public cloud providers 1620 that provide compute and network infrastructure (e.g., compute elements (such as host computers, VMs and/or containers) and network elements (hardware or software switches, routers, middlebox elements, etc.) that connect the compute elements) in multiple different public clouds 1650. The second SaaS layer 1610 is provided by the VNP 1625, which provides the tools for deploying virtual networks across multiple public clouds 1650 for a cloud reseller. The cloud reseller 1630 provides the third SaaS layer 1615 to its customers 1640, which use the cloud resellers tools to define compute elements and network infrastructure (e.g., virtual network) to deploy across one or more public clouds 1650.

The cloud reseller 1630 in some embodiments has its own customer account with each of the public cloud providers. In some embodiments, the cloud reseller establishes its customer account with each public cloud provider directly (as identified by dashed arc 1652) and then provides security credentials for this customer account to the VNP provider 1625. In other embodiments, the cloud reseller establishes its public cloud customer account through the VNP provider's machines 1625. To direct the VNP to deploy a virtual network for one of its tenants over public cloud infrastructure, the cloud reseller machines 1630 initially provide the cloud reseller's VNP security credentials (e.g., username, password, certificate, etc.) to the VNP machines 1625 in order to authenticate the cloud reseller.

As shown, the cloud reseller also provides the desired network configuration to the VNP 1625. This configuration described the attributes of the virtual network that needs to be deployed for a tenant. In some embodiments, this configuration data also includes a tenant identifier that the cloud reseller 1630 uses for its customer for which it directs the VNP 1625 to deploy a virtual network. This tenant identifier in some embodiments is obtained from the VNP. In other embodiments, the configuration data includes a tenant identifier provided by the VNP, which the cloud reseller maps to its own tenant identifier for its tenant.

In some embodiments, the VNP machines 1625 provide the cloud reseller's security credentials to the public cloud machines 1620 when deploying virtual networks (e.g., when deploying MFNs, configuring MFN CFEs with proper routing records, etc.) for the reseller's customers. These security credentials (e.g., user name, password, security certificate, etc.) allow the VNP machines to authenticate themselves as machines operating at the behest of the cloud reseller (e.g., to logon onto the public cloud machines 1620 as if the cloud reseller machines 1630 are logging on to the public cloud machines 1620).

To deploy the virtual network for each tenant of the cloud reseller, the VNP machines also configure in some embodiments the components that form the virtual network (e.g., the MFN, MFN gateways/service boxes/CFEs, etc.) with the tenant identifier for the cloud reseller's tenant. In some embodiments, these configured components then associate the statistics that they collect (e.g., the routing statistics and deployment machine compute statistics) with the tenant identifiers, so that the cloud reseller's customers can be appropriately charged based on these statistics, as further described below.

In some of the embodiments in which the cloud reseller provides the tenant identifiers for its customers to the VNP machines 1625, the VNP machines 1625 map each tenant identifier provided by the cloud reseller 1630 to a unique tenant identifier of the VNP, and translate the VNP tenant identifiers for the collected statistics to the cloud reseller's tenant identifiers before providing the statistics to the cloud reseller. In other embodiments, the cloud reseller machines 1630 and/or VNP provider machines 1625 use tenant identifiers provided by the public cloud provider machines 1620.

The VNP machines 1625 uses the tenant network configuration data provided by the cloud reseller 1630 to deploy and/or configure the virtual network components (e.g., the MFNs, etc.) of the virtual network for each customer of the cloud reseller. In some embodiments, multiple different customers share the same virtual network and/or virtual network components. Conjunctively, or alternatively, the VNP machines 1625 in some embodiments can define a dedicated virtual network for any individual customer of the cloud reseller. As shown, the VNP machines 1625 deploy and configure the virtual networks and/or virtual network components through the public cloud provider machines 1620. In some embodiments, reseller, VNP, and public cloud machines 1620-1630 communicate with each other through their respective API interfaces and intervening network fabric (e.g., the Internet).

The VNP machines 1625 collect per tenant statistics from the deployment virtual network components (e.g., routing statistics from the CFEs and gateways, etc.), aggregate the statistics, and forward the aggregated statistics to the cloud reseller. In the embodiments in which the VNP machines map the reseller customer identifiers to VNP tenant identifiers, the VNP machines translate the tenant identifiers to the customer identifiers before supplying the aggregated statistics with the translated customer identifiers. Also, in the embodiments in which the VNP machines map the public cloud identifiers to VNP tenant identifiers, the VNP machines translate the public cloud identifiers to the VNP identifiers.

As shown, the VNP machines 1625 periodically send billing reports to the cloud reseller 1630 to collect fees for services performed by the VNP. In some embodiments, these billing reports charge the cloud reseller for the VNP's service fees for deploying virtual networks for the cloud reseller over two or more public clouds. These deployment charges include fees for performing ancillary operations in support of such deployments, such as measurement operations that produce measurements that quantify the quality and/or cost of links between MFNs in the public clouds and between external machine locations of the tenants.

Also, the VNP machines 1625 in some embodiments receive billing data from one or more public cloud providers for the cloud reseller. This billing data is associated with the cloud reseller's customer credentials (e.g., PC provider customer number for the cloud reseller) in some embodiments. The VNP machines 1625 in these embodiments pass along the billing data to the cloud reseller (e.g., with a markup adjustment or without a markup adjustment). In other embodiments, the public cloud providers send billing reports directly to the cloud reseller machines 1630, as shown by dashed lines 1652.

The cloud reseller machines 1630 in some embodiments uses the usage statistics provided by the VNP machines 1625 to charge its customers for the virtual networks. In some embodiments, the VNP machines 1625 not only deploy network infrastructure but also deploy compute infrastructure for the cloud reseller 1630. In some of these embodiments, the usage statistics reflects the used compute resources and the cloud reseller machines 1630 use these statistics to charge the reseller's customers. In some embodiments, the cloud reseller does not use the collected statistics to charge its customers, but rather charges its customers based on the compute and/or network configuration that the customer requested for deployment.

To further illustrate the differences between the three-layer SaaS deployment model of FIG. 16, FIG. 17 illustrates a similar diagram for the two-layer SaaS deployment model that was previously described above. This two-layer model of FIG. 17 does not have any cloud reseller 1615. Rather, in this two-layer model, the VNP's customers are entities that have the VNP deploy a dedicated virtual network just for them, or use a shared virtual network that the VNP has deployed for several customers. As described above, different customers can securely share the components the define the shared virtual network over one or more public clouds, as each customers network traffic is securely segregated from the network traffic of other customers. In some embodiments, multiple virtual networks are defined for multiple customers over the shared virtual network by using tenant identifiers to segregate the traffic of the different customers, as described above.

In the two-layer model of FIG. 17, the first SaaS layer 1605 is provided by one or more public cloud providers 1620 that provide compute and network infrastructure in multiple different public clouds 1650, while the second SaaS layer 1610 is provided by the VNP 1625, which provides the tools for deploying virtual networks across multiple public clouds 1650 for several of its customers. As shown, the VNP machines 1625 provide to the public cloud providers the VNP security credentials for the public clouds.

The VNP machines receive for each customer (associated with a tenant identifier) tenant network configuration data, and based on this data, deploy and/or configure the virtual network components (e.g., the MFNs, etc.) of the virtual network for each of its customers. As shown, the VNP machines 1625 deploy and configure the virtual networks and/or virtual network components through the public cloud provider machines 1620. In some embodiments, VNP and and public cloud machines 1620 and 1625 communicate with each other through their respective API interfaces and intervening network fabric (e.g., the Internet).

As further shown, the VNP machines 1625 collect per tenant statistics from the deployment virtual network components (e.g., routing statistics from the CFEs and gateways, etc.), and aggregate the collected statistics. The VNP machines 1625 periodically send billing reports to each of the VNP customers to collect fees for services performed by the VNP. As mentioned above, these fees in some embodiments include the fees that the public cloud providers charged the VNP for the resources (e.g., compute and/or network resources) consumed by the customer's virtual network, plus a certain markup percentage. The VNP machines identify the amount of resources by each customer's virtual network based on the statistics that these machines collect and aggregate for the customer's associated identifier. In other embodiments, the VNP machines pass through to each customer each public cloud provider's charge for the resources consumed by the customer's virtual network, plus a charge for each customer's use of VNP resources.

Some embodiments connect a multi-machine compute node (e.g., a branch office or datacenter) of a tenant to the tenant's public cloud virtual network through multiple connection links to multiple public clouds (e.g., multiple public cloud datacenters) of one or more public cloud providers. Having multiple links between the multi-machine compute node (MMCN) and the public cloud virtual network allows the virtual network to be highly available, as it can withstand the failure of one or more connection links. In some embodiments, one link is a primary link while each other link is a failover link. This approach also allows the best route to be established from each MMCN to each other MMCN or SaaS provider datacenter by selecting the best ingress node for entering the virtual network from the MMCN for the best routing path through the virtual network to the egress node for exiting the virtual network to another MMCN or SaaS provider datacenter.

The discussion below uses the term multi-homed MMCN to refer to a multi-machine compute node of a tenant that connects to the tenant's public cloud virtual network through multiple connection links to multiple public clouds of one or more public cloud providers. The discussion below also uses the term multi-homed SaaS datacenter to refer to a SaaS datacenter to which a virtual network associates multiple MFNs in one or more public clouds (e.g., multiple public cloud datacenters) of one or more public cloud providers. These MFNs in some embodiments are candidate egress nodes for routes that traverse through the virtual network to reach a SaaS provider. The use of two or more egress nodes to connect the virtual network of a SaaS datacenter is also advantageous in that it enables link failover support and it allows for the use of optimal routes between different pairs of external computer node (e.g., remote computer or MMCN) and SaaS provider datacenter.

In some embodiments, a SaaS datacenter does not need to initiate routes to multiple MFNs of the virtual network in multiple public cloud datacenters, even when the virtual network controllers 160 associate multiple MFNs with the SaaS datacenter. On the other hand, multi-homed MMCNs in some embodiments need to actively initiate routes through different links to the virtual network. To do this, providing a fallback capability is facilitated in a multi-homed MMCN by having an appropriate router with failover capabilities (e.g., by using a Cisco 2800 series).

For optimal routing, the multi-homed MMCN includes in some embodiments one or more computers or appliances that execute measurement processes to measure the performance (delay, loss etc.) between the MMCN and the different public cloud datacenters to which the MMCN can connect. In addition, the MMCN in some embodiments performs its overall routing operations based on routes that are defined by the centralized controller cluster (e.g., controller cluster 160) that defines the virtual network for an entity (e.g., for a tenant). To accomplish this, the multi-homed MMCN is equipped with SD-WAN capabilities (such as Velocloud and Viptela appliances) that operate as a part of the centralized control plane for deploying the virtual network. As mentioned above, the centralized control plane is implemented by a cluster of two or more controllers in some embodiments.

FIG. 18 illustrates a process 1800 used by the central controller cluster of some embodiments to define routes for a particular multi-homed MMCN. This process uses a specialized router in the particular multi-homed MMCN to use the defined routes to perform routing operations that forward data messages from the MMCN to the virtual network through the multiple connection links. The specialized router is a software router or a cluster of software routers in some embodiment, while it is a routing appliance (e.g., SD-WAN appliance) in other embodiments. The specialized router or router cluster in the MMCN is referred to as the edge node of the MMCN in the discussion below. In some embodiments, the central controller cluster remotely controls the edge nodes of the MMCNs through the Internet.

As shown, the central controller cluster initially identifies (at 1805) a subset of N MFNs (e.g., 10 to 12) from N different cloud regions that are the closest to the particular MMCN edge node according to a DNS server service and the edge node IP address. The N MFNs in some embodiments have at least one candidate MFN from each cloud provider within a certain distance of the particular MMCN. Also, in some embodiments, each of the N MFNs includes a gateway (e.g., a branch gateway 225) to establish a secure connection link with the particular MMCN edge node.

Also, as mentioned above, the DNS server service in some embodiments is a service machine, or a cluster of several service machines, that operates in one or more public clouds and that provides DNS information to DNS servers of the MMCNs of an entity. In some of these embodiments, the DNS servers are operated by the virtual network provider or by another entity. In other embodiments, the DNS server service is a geo-IP service (e.g., of a third party) that resides outside of the public clouds that implement the virtual network and that can identify edge nodes in the public clouds that are near the particular MMCN for which the process 1800 is performed.

Next, at 1810, the controller cluster downloads the identified list to N nodes to the particular MMCN's edge node so that the MMCN's edge node can take measurements that quantify the quality of connections to each of the N MFNs in the list. In some embodiments, each MMCN edge node has a measurement agent (e.g., a process executing on one of the MMCN computers) that generates such measurements. This measurement agent generates measurement values differently in different embodiments. In some embodiments, the measurement agent sends pinging messages (e.g., UDP echo messages) periodically (e.g., once every second, every N seconds, every minute, every M minutes, etc.) to each of the measurement agents of the N MFNs in the list. Based on the speed of the reply messages that it receives, the MMCN measurement agent computes and updates measurement metric values, such as network-connection throughput speed, delay, loss, and link reliability. In some embodiments, multiple MFNs share one measurement agent (e.g., in the same datacenter or nearby datacenter of the public cloud provider hosting the MFNs).

In some embodiments, the particular MMCN's measurement agent periodically performs these measurements, and periodically sends the new measurements to the controller cluster so that the controller cluster can update its weight computations and route generations, as further described below by reference to 1820-1835. Also, whenever new MFNs are added in newly added or previously used public cloud datacenters, the controller cluster in some embodiments generates update lists of N candidate MFNs.

At 1815, the controller cluster receives the measurements taken by the particular MMCN's edge node. Based on these measurements, the centralized controller cluster computes (at 1820) a link weight for each connection link that connects the particular MMCN's edge node to each of the N MFNs. For instance, in some embodiments, the central controller computes each link's weight by using an exponential filter on the delay measurements and using the loss parameter as weight multiplier (e.g., doubling the weight for each 1% of loss).

Based on the computed weights, the central controller then identifies (at 1825) a subset of the M (e.g., 5 or 6) MFNs as the “home” nodes to which the edge node will be connected. In some embodiments, the M nodes are the nodes with the lowest weight values. In other embodiments, the M nodes are the nodes with the lowest weight values, but at least one representative MFN in each cloud provider is included in the M nodes. The list of M nodes may change with time and MFNs can be dropped and added to the list as new MFNs are added and/or as new measurements are received from the particular MMCN edge node. The controller cluster in some embodiments uses a “hysteresis” process to avoid frequent changes in the list of M MFNs. The hysteresis process in some embodiments uses previous state (i.e., previous members) of the MFN list to reduce the rate of adding/removing members to/from the MFN list. Also, in some embodiments, the controller cluster will not drop an MFN from the list unless another MFN has a 10% smaller average weight for a window (e.g., a time period) of measurements.

As mentioned above, the particular MMCN edge node in some embodiments maintains a secure connection (e.g., an IPsec connection) to the virtual network gateway of each of the M MFNs. In some embodiments, the controller cluster directs (at 1825) the particular MMCN edge node to establish secure connections with each of the M MFNs. At 1830, the controller cluster uses the computed weights of the selected M MFNs to identify optimal routes and failover routes for connecting the particular MMCN edge node with each other possible nodes for data message flows to traverse between the particular MMCN edge node and other MMCN edge nodes or SaaS provider datacenters through the virtual network. To generate such routes, the controller cluster in some embodiments uses shortest path route-identification processes, as described above.

In some embodiments, the controller cluster repeats its route identification process periodically, or whenever the computed weight values change (e.g., based on new measurements or addition/deletion of MFNs in the list of M MFNs). In some embodiments, the controller cluster performs the route identification operation (at 1830) for the particular MMCN edge node along with the route identification operation for other multi-homed MMCNs and/or multi-homed SaaS providers together, as multiple connection links to other MMCNs and to the SaaS providers would be relevant in identifying optimal routes to and from the particular MMCN. These computed routes also account for routes to/from virtual network MFNs that are candidates for connecting to remote devices (e.g., remote laptops, desktops, or mobile devices, such as smartphones, tablets, etc.).

After identifying these routes, the controller cluster supplies (at 1835) forwarding records for one or more routes to the particular MMCN edge node and the MFNs. For instance, in some embodiments, the controller cluster provides forwarding records (e.g., routing records that specify the next hop, routing records that specify the virtual network egress node, etc.) to particular MMCN edge node and to the MFN CFEs. By using these forwarding records to perform their routing operations, the particular MMCN edge node and MFN CFEs implement the optimal and failover routes defined (at 1830) by the controller cluster. In some embodiments, the controller cluster supplies new routing records to the particular MMCN edge node and the MFN CFEs whenever it identifies new optimal or failover routes.

In this manner, the process 1800 of FIG. 18 bases its routing computations on computed weight values that express the quality of the connection between the particular MMCN and each of its several connections to the virtual network. Under this approach, a different virtual-network ingress/egress node pair can be selected for the particular MMCN edge node and different MMCNs, different SaaS nodes and/or different remote devices. Because of this, the controller cluster in some embodiments performs the route identification operation (i.e., operation 1830) for one or more multi-homed MMCNs and/or multi-homed SaaS providers together, as mentioned above.

FIG. 19 presents an example of two branch nodes EN1 and EN2 of two MMCNs 1905 and 1910 and a SaaS datacenter 1915. Each of the branch nodes connects to the virtual network 1920 through virtual-network MFNs 1925-1935 that are defined in three public cloud datacenters of two or three public cloud providers. The SaaS datacenter 1915, on the other hand, can be accesses through virtual-network MFNs 1940 and 1945. The weight measured between the relevant branch nodes EN1 and EN2, MFNs 1925-2545 and SaaS datacenter 1915 are depicted on the links between these nodes. In this example, it is assumed that other weights, like between nodes 1925 and 1935 are much higher (e.g. 10), so that no shortest path routing algorithm will use them in the best cost path.

As can be seen from this example, the best path from EN1 to the SaaS datacenter traverses nodes 1925 and 1940 as this path has a weight sum of 14, which is smaller than other weight costs of other paths. For instance, going through node 1930 will incur a smaller weight in the first hop but will result in a total minimal weight of 15. The optimal route from branch node EN2 will be through router 1935 and 1945 with a total weight of 15. Consequently, the two branches will use two different routes to reach the SaaS datacenter. To communicate between EN1 and EN2, the best route will be through MFN 1930 with a total weight of 13.

As mentioned above, some embodiments associate two or more virtual-network MFNs with each SaaS provider's datacenter. SaaS is a software distribution model in which a third-party provider hosts applications and makes them available to customers over the Internet. SaaS removes the need for organizations to install and run applications on their own computers or in their own datacenters. This eliminates the expense of hardware acquisition, provisioning and maintenance, as well as software licensing, installation and support. Also, rather than purchasing software to install, or additional hardware to support it, customers subscribe to a SaaS offering. Generally, they pay for this service on a monthly basis using a pay-as-you-go model. Transitioning costs to a recurring operating expense allows many businesses to exercise better and more predictable budgeting. Users can also terminate SaaS offerings at any time to stop those recurring costs.

SaaS offer high scalability, which gives customers the option to access more, or fewer, services or features without a need to provision or buy more computers. When there is a need to update the software, rather than purchasing new version or update the version the customer own, customers can rely on a SaaS provider to automatically perform updates and patch management. This further reduces the burden on in-house IT staff. Since SaaS applications are delivered over the Internet, users can access them from any Internet-enabled device and location. These advantages have made SaaS a very popular alternative to packaged software that is installed on customer premises using customer hardware. The SaaS providers may host the service on one or more servers in its private datacenter(s) or on one or more servers residing in one or more regions in the public cloud.

Typically, the SaaS provider is identified by the domain name of its service (e.g. www.myworkday.com). Often, there is a different domain name associated with the servers that run public web page of the SaaS provider (www.workday.com) than the ones that runs the SaaS application (www.myworkday.com). This domain name can be resolved through a DNS query to provide the IP address of the SaaS application server.

In case there are multiple servers, the DNS server may return a different IP address to two different requests that can be associated with different servers. The logic of the different name is from a location basis. If the SaaS provider has several regions in the world where it owns server, each requester will get back an IP server that is closer to it. Inside the same region, the DNS service can still select different servers according to a load balancing point of view; the IP address that is returned is associated with a different server in the same region. This latter case will return IP addresses for different servers who usually share the same IP subnet.

The controller cluster of the virtual network in some embodiments keeps a table of known IP SaaS addresses. When the virtual network gets packets from a customer, the destination IP can be of three different types. First, the packet can be associated with a private location of the entity (i.e., has a destination address in the private IP space of the entity). In this situation, the virtual network in some embodiments routes the packets to the corresponding compute node of the entity that is associated with the packet's destination address.

Second, the packet has a destination addressed that is a public (not private) IP address that is not known to virtual network. These IP addresses are referred to as generic public IP addresses. The virtual network in some embodiments sends such a packet to the Internet from the ingress virtual network node. Third, the packet has a destination addressed that is a public (not private) IP address known to virtual network to be an IP address of a SaaS provider. Such IP addresses are referred to as SaaS IP addresses. In some embodiments, such a packet will be routed from a first virtual-network node (e.g., first CFE of a first MFN) to a second virtual-network node (e.g., second CFE of a second MFN) from where it is provided to the SaaS IP in the shortest possible way in some embodiments.

FIG. 20 illustrates a process 2000 used by the central controller cluster of some embodiments to define routes for multi-homed SaaS providers. This process identifies the various IP addresses associated with a SaaS service and identifies the shortest possible routes from different compute end nodes to one or more SaaS provider datacenters. As shown, the process 2000 starts (at 2005) in some embodiments when the controller cluster receives a SaaS domain name list. In some embodiments, the SaaS domain list is provided by the administrator of the public cloud virtual network provider, while in other embodiments this list is provided by an administrator of the entity for which the public-cloud virtual network is defined by the virtual network provider. The table below provides an example of such a SaaS list.

Name

1.
login.adaptiveinsights.com

2.
adobeid-na1.services.adobe.com

3.
athenanet.athenahealth.com

4.
login.bws.birst.com

5.
account.box.com

6.
centrify.com

7.
identity.citrix.com

8.
login.constantcontact.com

9.
account.docusign.com

10.
login.github.com

11.
secure.gooddata.com

12.
app.hubspot.com

13.
login.huddle.net

14.
hub.insidesales.com

15.
login.marketo.com

16.
system.netsuite.com

17.
login.newrelic.com

18.
login.microsoftonline.com

19.
login.okta.com

20.
login.oracle.com

21.
myapps.paychex.com

22.
login.salesforce.com

23.
servicemax.cloudforce.com

24.
hi.service-now.com

25.
auth.tableausoftware.com

26.
login.ultimatesoftware.com

27.
support.veeva.com

28.
login.xero.com

29.
www.zendesk.com

At 2010, the controller cluster stores the SaaS domain list in a database. In some embodiments, this database is accessible through one or more interfaces (e.g., web server interface and/or API interface) to administrators of the virtual network provider and/or of an entity (e.g., a tenant) for which the virtual network is deployed. Through this interface, an administrator can add or remove SaaS providers and/or associated domain names to the list.

Next, at 2015, the controller cluster learns as many possible IP addresses of SaaS servers associated with the domain on its list of domain names. To that end, the controller cluster in some embodiments directs different measurement agents 205 in the public clouds (that are deployed by the VNP for one or more virtual networks deployed over different public clouds) to execute DNS query for each domain name on the list. Such a query is repeated periodically (e.g. every 30 minutes). The measurement agents 205 transfer back (at 2015) to the controller cluster the IP addresses that they learn for each domain name.

Different measurement agents may return different IP addresses as many SaaS are using geographical DNS service to match an adjacent server with the client. The SaaS providers typically use Authoritative DNS Servers that have lists of SaaS servers and their locations. When such a DNS server gets a DNS request, it receives the measurement agent's IP address, and uses this IP address to Geo-IP map to identify the location of the measurement agent and returns the IP address of the “best” server for the measurement agent. In some embodiments, the measurement agent also provides the IP address of an end-compute node of the virtual network, and the DNS server used by the SaaS provider provides an IP address based on the end-compute node's IP address.

The controller cluster stores (at 2020) in a database the returned IP addresses along with their associated domain names. When at least some number of IPs (e.g., 5) belong to the same IP subnet (e.g., class C subnet that includes 255 or less different addresses), the controller cluster adds the subnet itself to the database. In some embodiments, this database is accessible through one or more interfaces (e.g., web server interface and/or API interface) to administrators of the virtual network provider and/or of an entity (e.g., a tenant) for which the virtual network is deployed. Through this interface, an administrator can add or remove IP addresses. This interface also allows the addition/removal of records associated with domain names that are added/removed by an administrator. Also, in some embodiments, the controller cluster purges IP addresses that are not reported as being used for a duration of time (e.g., every day, every several days, every week or every several weeks, etc.).

After 2020, the central controller identifies (at 2025) for each reported IP address that is received from the reporting measurement agents in one or more public clouds (reporting regions), a set of public clouds (nearby regions) that are near (i.e., within a threshold distance of) the reporting region. In some embodiments, the nearness of two regions are determined in terms of network distances that are measured separately between the regions. In some embodiments, the process 2000 uses third party DNS services to identify an approximate location for each IP address, and then uses the identified locations of the IP addresses to quantify a distance between two IP addresses. The list of the set of regions identified for all the reported IP address is referred to as IP vicinity report. When such operation is not done, the IP vicinity report will define all the virtual network regions as being near each IP address.

At 2030, the central controller provides the IP vicinity report to the deployed measurement agents 205 that are deployed by the VNP for one or more virtual networks deployed over different public clouds. Each measurement agent then periodically measures (e.g., once every several minutes or several hours) the distance between the measurement agent and each SaaS provider IP address that is identified as being near the measurement agent in the IP vicinity report. In some embodiments, the measurement agent computes this distance to an IP address in terms of the delay for initiating a TCP connection with a server at this IP address. When the server, having this IP address is responding, the time to that response is measured. Once a first response is accounted, the measurement agent actively terminates the TCP connection in some embodiments. In some embodiments, the measurement agent also counts the number of successful TCP connection events and/or lost packets. The measurement agent in other embodiments uses other measurement techniques, such as any one of the measurement techniques that were described above.

At 2035, the controller cluster receives the distance measurements from the measurement agents. Next, at 2040, the controller cluster uses the returned measurements (e.g., the delay and loss numbers reported from each measurement agent) to identify routes to each SaaS provider (e.g., to each SaaS IP address) from each possible ingress MFN and/or from each possible MMCN. To identify the routes, the controller cluster performs shortest path route-identification process in some embodiments that relies on the weight values that are computed based on the measurements to the different SaaS IP addresses, between different MFNs and to the different MMCNs.

After identifying these routes, the controller cluster supplies (at 2045) these routes to the MMCN edge nodes and the MFNs. For instance, in some embodiments, the controller cluster provides forwarding records (e.g., routing records that specify the next hop, routing records that specify the virtual network egress node, etc.) to the MMCN edge nodes and to the MFN CFEs. By using these forwarding records to perform their routing operations, the particular MMCN edge nodes and MFN CFEs implement the optimal routes defined (at 2040) by the controller cluster. In some embodiments, the controller cluster supplies new routing records to the MMCN edge nodes and the MFN CFEs whenever it identifies new routes.

In some embodiments, the SaaS IP addresses that are discovered by the above process are assumed to have a zero routing distance to the virtual network node to which they connect (i.e., are assumed to be virtually located in a public cloud region of the virtual network). In other embodiments, the routing links between public cloud regions and SaaS IP addresses have weights associated with them (as reflected in the example of FIG. 19), and these weights reflect the cost (e.g., measured delay and/or loss) associated with the path from those public cloud regions to the SaaS IP addresses. Under this approach, the best regions to connect to a particular IP address are the regions from which the computed weight values (i.e., the cost measured in terms of packet delay and loss) are small.

One rational for associating a SaaS IP address with more than one MFN CFE in more than one public cloud region is that the distance of the SaaS server to multiple regions is much smaller than the typical distance between regions. In addition, it might cost less to route traffic that is originating in one public cloud so it will stay till the egress node in the same cloud. In this case, the controller cluster in some embodiments binds each SaaS IP to at least one region in each public cloud as long as the cost (e.g., the delay and loss) from the nearest region is below some cost (e.g., the delay and loss) threshold. When the route identification process needs to calculate a shortest path to a certain IP address, it first looks to which regions this IP address is bound, then it computes the shortest path from each egress node to the bound region. In some embodiments, the routing tables themselves in the routers do not need to include the external IP address as the data message will be carried in the tunnels until the destination egress node, which then will look up to the IP address in the tunnel.

As mentioned above, the computed weight value in some embodiments accounts for the cost of packet delay and/or loss in a link between two public clouds regions, between a public cloud region and a SaaS provider datacenter, or between a public cloud region and a tenant's compute end node. In other embodiments, the computed weight value for each such link is computed in terms of other types of parameters, such as the data throughput costs that are charged by the public cloud providers and/or the compute cost (for the compute elements used to implement the MFN components in the public cloud) that are charged by the public cloud providers.

In some embodiments, an entity can provide the VNP with input regarding which public clouds to use to deploy the entity's virtual network. This input in some embodiments is also accompanied with a request for the VNP to create a dedicated virtual network for the entity (e.g., for the VNP's tenant) over one or more public clouds of one or more public cloud providers. In some embodiments, the entity's input specifies the public cloud providers to use and/or the public cloud regions in which the virtual network should be defined. Conjunctively, or alternatively, this input in some embodiments specifies actual public cloud datacenters (PCDs) to use. The VNP in some embodiments supplements the set of public cloud datacenters identified for an entity through the entity's input with one or more PCDs that the VNP identifies as desirable datacenters to add to the entity's set of datacenters.

FIG. 21 illustrates a process 2100 that the VNP uses in some embodiments to deploy and configure dedicated MFNs to implement a dedicated virtual network for an entity that requests such a network to be deployed over a particular set of public cloud providers, a particular set of public cloud regions, and/or a particular set of public cloud datacenters. For the entity, this process (1) identifies a set of public cloud datacenters of one or more public cloud providers to connect a set of machines of the entity, (2) deploys dedicated MFNs for the entity in the identified set of public cloud datacenters, and then (3) configures these MFNs to implement the dedicated virtual network that connects the entity's set of machines across its identified set of public cloud datacenters.

This dedicated virtual network is defined over the compute and network infrastructure of one or more public cloud datacenters. In some embodiments, the dedicated MFNs that are specifically deployed for one entity have the same attributes and perform the same operations (e.g., check for a tenant identifier in performing its forwarding operations) as the shared MFNs that are deployed and used by multiple entities. The only difference between the dedicated and shared MFNs in these embodiments is that the dedicated MFNs are used to process data messages for just one tenant, while the shared MFNs are used to process data messages for multiple entities.

As mentioned above, an MFN in some embodiments is a conceptual grouping of several different components in a public cloud datacenter that with other MFNs (with other groups of components) in other public cloud datacenters establish one or more overlay virtual networks for one or more entities. One of these components is a cloud forwarding element (CFE) that performs the next-hop forwarding needed to implement the paths through the virtual network. Also, in some embodiments, each MFN's group of components execute on different computers in the MFN's public cloud datacenter, while in other embodiments, several or all of an MFN's components execute on one computer of a public cloud datacenter. The components of an MFN in some embodiments execute on host computers that also execute other machines of other tenants, such as virtual machines or containers of the VNP's tenants or other tenants of the public cloud providers.

In some embodiments, the entity's machines that are connected by the virtual network deployed by process 2100 are machines outside of any public cloud. In other embodiments, some of the entity's machines are in a public cloud, while other machines reside outside of the public clouds. Also, in some embodiments, the entity's machines include SaaS provider machines that the entity uses for certain SaaS operations.

Before receiving the entity's input, the process 2100 deploys (at 2105) measurement agents in one or more PCDs and/or PCD groups, and has these agents exchange messages in order to generate network measurements that quantify the quality of network connections between different pairs of PCDs, different pairs of PCD groups (e.g., between different public cloud regions or availability zones), and different pairs of PCD/PCD groups. Examples of network measurements that the process generates for a connection between two PCDs, two PCD groups, and/or a PCD and a PCD group include loss, delay, and jitter experienced on this connection, as well as the reliability and cost of the connection.

As described above, some embodiments measure the delay in a connection link between two PCDs and/or two PCD groups by measuring the round-trip time (RTT) for messages to be exchanged between two measurement agents in the two PCDs and/or PCD groups. Jitter in some embodiments is the derivative of the delay (e.g., of RTT). Loss in some embodiments is derived from the number of packets dropped in a particular time frame. Reliability in some embodiments is derived from loss, e.g., a lossy connection has a poor reliability score.

From the entity's network administrator, the process receives a request (at 2110) to deploy a dedicated virtual network. This request in some embodiments provides information regarding the location (e.g., network addresses) associated with the entity's machines that are located outside and inside of the public clouds that need to be connected through the virtual network. This location information includes the attributes (e.g., name, network address(es), etc.) of any office and datacenter that include multiple machines.

The locations of individual end compute node machines in offices and datacenters are not specifically identified in some embodiments, but rather are identified through their association with the offices and datacenters. The provided location information in some embodiments can also identify the location of one or more groups of one or more machines in the public clouds, as well as the identities (and in some cases the locations) of SaaS providers used by the entity.

In some embodiments, the request received at 2110 also specifies the public cloud providers to use and/or the public cloud regions in which the virtual network should be defined. Conjunctively, or alternatively, this input in some embodiments specifies actual public cloud datacenters to use. This input in some cases can specify multiple different public cloud providers, and/or PCDs and/or PCD groups of different public cloud providers.

Based on the input received at 2110, the process identifies (at 2115) a set of candidate PCDs and/or PCD groups over which the virtual network could be defined. In some embodiments, the identified set of PCDs and/or PCD groups include PCDs and/or PCD groups explicitly identified in the input received at 2110, and/or are PCDs and PCD groups of public cloud providers explicitly identified in this input. The process only includes these explicitly identified PCDs and/or PCD groups in some embodiments.

However, in other embodiments, the process includes (at 2115) in the identified set of candidate PCDs and/or PCD groups, other PCDs and/or PCD groups that might be desirable datacenters for the entity's virtual network. Specifically, to provide recommendation to the entity, the process 2100 in some embodiments supplements the set of public cloud datacenters identified for an entity through the entity's input with one or more other PCDs and/or PCD groups that the process identifies as desirable PCD and/or PCD groups to add to the entity's set of datacenters.

To identify this other PCDs and/or PCD groups, the process in some embodiments uses pre-configured rules that identify desirable PCDs and/or PCD groups for certain locations and/or regions (e.g., for the locations and/or regions specified by the entity and/or in which the entity's office and datacenters reside). These rules are defined in some embodiments based on previously deployed virtual networks for other entities and/or based on measurements continuously taken by the measurement agents that the VNP deploys in the different PCDs and/or PCD groups.

From the current set of network measurement generated by the measurement agents for all the public clouds in which they are deployed, the process selects (at 2120) the subset of network measurements that are for the PCDs and/or PCD groups identified at 2115. In some embodiments, any one network measurement (e.g., delay) for a connection link at any given time is a weight-blended average of measurement values (e.g., delays) generated for that connection link over a past duration of time (e.g., over the past few seconds, minutes, hours, days, etc.). Such an average smooths out the measurement values to ensure that the measurement values used are not too dependent on transient network conditions at any one given point in time.

Next, based on the identified PCDs and PCD groups, the process generates (at 2125) a routing graph by using one or more of the techniques described above by reference to FIGS. 3-5. At 2125, the process uses the routing graph to perform path searches that use the measurements selected at 2120 to identify a set of paths connecting the entity's machines (including SaaS machines to use) across the identified set of PCDs. To account for mobile device connections, the path searches also identify paths between all possible PCD pairs that can serve as ingress and egress nodes for paths across the dedicated virtual network.

To identify the paths, the process in some embodiments uses the measurements selected at 2120 to perform shortest path searches. In some embodiments, the process 2100 performs two sets of paths searches. A first set of path searches only considers the PCDs and PCD groups explicitly identified in or through the entity's request received at 2110. Another set of path searches in these embodiments not only considers the explicitly identified PCDs and PCD groups, but also includes the PCDs and PCD groups that the process identifies as potentially desirable at 2115.

As described above, the shortest path searches are based on weights assigned to links of the routing graph, with the weights being derived from the generated network measurements. Given that different network measurements are used in different embodiments, the shortest path searches are smallest-cost searches that identify optimal paths between machine endpoints (or between edge nodes) in the virtual network based on any one or more of different criteria (such as delay, jitter, loss, reliability, etc.). As mentioned above, the cost search criteria in some embodiments also includes one or more financial costs (e.g., compute cost, storage cost, networking cost) charged by the public cloud providers.

Some embodiments allow different entities to direct the process to use different combination of different types of criteria to cost the paths while it performs its path searches, e.g., one entity can direct the process to minimize message delay, another entity can direct the process to minimize message jitter, still another entity can direct the process to minimize loss and delay, etc. For each entity, the process in some embodiments custom configures its path search operations to optimize a set of criteria specified by the entity.

At 2130, the process determines whether the second set of path searches (that used both PCDs/PCD groups explicitly identified through the entity request received at 2110 and the other PCDs/PCD groups that the process identified at 2115 as potentially desirable) resulted in any path that was better for connecting two of the entity's machine endpoints (including endpoints for connecting to mobile devices) than any path produced by the first set of path searches (that only used PCDs/PCD groups explicitly identified through the entity request received at 2110).

If not, the process deploys (at 2135) dedicated MFNs for the entity in the PCDs and PCD groups that are used by the paths generated by the first set of path searches. These dedicated MFNs in some embodiments only forward data message flows for that entity. In some embodiments, the dedicated MFNs do not forward data message flows for any other entity other than the entity for which the process 2100 is performed. In other embodiments, these MFNs also carry VNP data message flows that the VNP needs to send and receive in order to manage the virtual network for the particular entity. In some embodiments, the process deploys one MFN for the entity in each PCD or PCD group used by the paths generated by the first set of paths searches. In other embodiments, the process can deploy more than one MFN for the entity in a PCD or PCD group when additional MFNs are needed to handle the traffic load.

To deploy an MFN in a PCD/PCD group of a public cloud provider, the process 2100 in some embodiments uses the APIs of the PCD's public cloud provider to direct the provider's server to add one or more machines that implement the different components of the MFN (e.g., its CFE, etc.). Similarly, other processes described herein deploy MFNs in PCDs/PCD groups by also using such APIs.

The process 2100 also configures (at 2135) these MFNs (e.g., the forwarding elements of these MFNs) to implement these paths by (1) using the identified paths to define forwarding rules (e.g., next hop records) that configure the MFNs and edge nodes (in multi-machine compute nodes of the entity) to forward data message flows along the different paths, and (2) distributing these forwarding rules to the MFNs and the edge nodes. To distribute the forwarding rules, the process in some embodiments provides the rules to a set of controllers, which then distribute them to the MFNs and edge nodes. In some embodiments, the process configures the edge nodes by communicating with these edge nodes (e.g., through service APIs or some other mechanism), or by using Border Gateway Protocol (BGP) when the edge nodes are not directly accessible by the VNP managers/controllers. After 2135, the process ends.

When the process 2100 determines (at 2130) that the second set of path searches resulted in at least one better path that uses one of the other PCDs/PCD groups that the process identifies as being potentially desirable at 2115, the process generates (at 2140) a report for display through a UI (user interface) management console or other interfaces (e.g., email, etc.), to provide a recommendation to the entity administrator to add other PCDs and/or PCD groups to the list of public clouds, PCDs or PCD groups explicitly identified by the entity in its request. In some embodiments, the recommended PCDs/PCD groups can belong to different public cloud providers than those specified by the entity, and/or can be in different regions than the PCDs/PCD groups specified by the entity.

The process 2100 in some embodiments also generates a report for display in a user interface even before deploying the MFNs at 2135 when the second set of searches do not produce any better paths, so that the entity administrator can review information about the virtual network that is to be deployed and provide modifications. In other embodiments, the process 2100 does not generate any such report before deploying the virtual network that it identifies based on the paths generated at 2125, but provides this report after the virtual network has been deployed. Also, in some embodiments, the process 2100 does not provide recommendations before deploying the dedicated virtual network, but only provides recommendations after deploying the dedicated virtual network to span the PCDs and/or PCD groups identified through the input received at 2110.

At 2145, the process determines whether the entity's administrator accepted any recommendation that the report presented at 2140. If not, the process transitions to 2135 to deploy and configure dedicated MFNs for implementing the paths generated through the first set of path searches. On the other hand, when the entity's administrator accepts one or more of the recommendations to add one or more PCDs/PCD groups, the process deploys (at 2150) dedicated MFNs for the entity in the PCDs and PCD groups used by the paths generated by the second set of path searches. In some embodiments, the process deploys one MFN in each PCD or PCD group traversed by a path identified through the second set of path searches. In other embodiments, the process can deploy more than one MFNs in such a PCD or PCD group when additional MFNs are needed to handle the traffic load.

The process 2100 configures (at 2150) the deployed MFNs (e.g., the CFEs of the MFNs) to implement the paths generated by the second set of path searches. To configure these MFNs, the process (1) uses the identified second search-set paths to define forwarding rules (e.g., next hop records) that configure the MFNs and edge nodes (in multi-machine compute nodes of the entity) to forward data message flows along the different paths, and (2) distributes these forwarding rules to the MFNs (e.g., the CFEs of the MFNs) and the edge nodes (e.g., the forwarding elements of these MFNs and edge nodes).

To distribute the forwarding records, the process in some embodiments provides the forwarding records to a set of controllers, which then distribute them to the MFNs and edge nodes. In some embodiments, the process configures the edge nodes by communicating with these edge nodes (e.g., through service APIs or some other mechanism), while in other embodiments it uses BGP or other routing protocols when the edge nodes are not directly accessible by the VNP managers/controllers. After 2150, the process ends.

In some embodiments, the VNP processes use the same forwarding scheme for both dedicated and shared virtual networks that they deploy. For instances, in some embodiments, these processes use the same double encapsulating approach for both dedicated and shared virtual networks. Other embodiments, however, use different forwarding schemes for dedicated virtual networks. For instance, when deploying a dedicated virtual network that spans the PCDs/PCD groups of one public cloud provider, some embodiments do not use the IP-based double encapsulation approach described above, but rather route the data messages by using a single encapsulation header as the tenant identifier is no longer used for the dedicated MFNs in some embodiments.

When performed for different entities, the process 2100 can produce very different virtual networks for these entities as a starting input of this process is each entity's request to use a particular set of public cloud providers, a particular set of PCDs or groups of PCDs. FIG. 22 presents an example that illustrates three different virtual networks 2202, 2204 and 2206 deployed over several public clouds in the United States for three different companies. In this example, the first two companies have offices only in San Francisco, Palo Alto and Los Angeles, but they end up with two very different virtual networks 2202 and 2204 that span different datacenters as one picks Amazon's public cloud infrastructure, while the other Google's public cloud infrastructure. The third company in this example has its dedicated virtual network 2206 span San Francisco and Chicago Google PCDs and New York Amazon PCD.

Even after completing the process 2100 for an entity, one or more VNP processes monitor the network conditions and the virtual network deployed for the entity, and adjust or recommend adjustments to the virtual network that may be needed. For instance, in some embodiments, these processes repeatedly check the network measurements that the measurement agents iteratively generate. These network measurements are needed as the quality of the connections between and to the public clouds may change over time.

With new measurements, the VNP processes perform new path searches, which might result in new preferred paths through the public clouds, and/or deployment of new dedicated MFNs, for an entity. In some embodiments, the VNP processes make these changes automatically. In other embodiments, these processes generate recommendations to use these new paths and/or deploy new MFNs, and provide these recommendations for presentation through a UI management console or other interfaces (e.g., email, etc.) to the network administrators of the entity.

The VNP processes also perform new path searches, adjust the virtual network and/or generate new recommendations based on statistics that they collect from the dedicated MFNs that are deployed for an entity. In some of these embodiments, the VNP processes perform the new path searches based on both the collected statistics from the MFNs and new measurements from the measurement agents. Based on these new path searches, the VNP processes in some embodiments provide recommendation to add one or more public clouds, PCDs and/or PCD groups. Based on the analysis of the collected statistics and/or new measurements, the VNP processes in some embodiments also recommend removal of underutilized public clouds, PCDs and/or PCD groups.

FIG. 23 conceptually illustrates a VNP process 2300 that produces recommendations to add MFNs based on collected statistics and new measurements. In some embodiments, this process is performed iteratively (e.g., once every hour, few hours, a day, etc.) for each deployed virtual network of each entity. As shown, the process 2300 initially collects (at 2305) statistics from the MFNs and edge nodes that implement the virtual network of the entity. The collected statistics relate to the forwarding of the data message flows (e.g., number of data messages, number of bytes, delay in transmission of data messages, etc.) by the MFNs and edge nodes.

Next, at 2310, the process collects new measurement values generated by the measurement agents deployed in the PCDs or PCD groups in which the virtual network's MFNs are deployed (i.e., in the PCDs or PCD groups over which the virtual network currently spans). These measurements are network measurements for the connection between and to these PCDs and/or PCD groups. As mentioned above, any one network measurement (e.g., delay) for a connection link at any given time in some embodiments is a weight-blended average of measurement values (e.g., delays) generated for that connection link over a past duration of time (e.g., over the past few seconds, minutes, hours, days, etc.).

At 2315, the process identifies one or more candidate PCDs and/or PCD groups to add to current PCDs and/or PCD groups used to implement the virtual network, and collects network measurements that the measurement agents have generated for these new candidate PCDs and/or PCD groups. These measurements are network measurements for the connection between and to these PCDs and/or PCD groups.

In some embodiments, the candidate PCDs and/or PCD groups are PCDs and/or PCD groups that are nearby or in between the PCDs and/or PCD groups that are currently used to implement the virtual network. The candidate PCDs and/or PCD groups in some embodiments are identified from a look-up table that associates each PCD or PCD group (e.g., PCD or PCD group currently used by the virtual network) with other candidate PCD or PCD groups, or each connected pair of PCD and/or PCD groups (where each PCD/PCD group in a pair has an MFN exchange data message flows with an MFN in the other PCD/PCD group in the pair) with other candidate PCD or PCD groups. In these or other embodiments, the candidate PCDs and/or PCD groups are identified by identifying all PCDs and/or PCD groups that are within a threshold distance of PCDs and/or PCD groups currently used by the virtual network.

In some embodiments, the process 2300 does not identify new candidate PCDs/PCD groups for each current PCD/PCD group used by the virtual network. Rather, in these embodiments, the process 2300 only identifies candidate replacement PCDs/PCD groups for existing PCDs/PCD groups that are over congested, performing poorly, or on paths that are performing poorly. The process 2300 in some embodiments does not identify candidate PCDs or PCD groups that the entity has previously specifically rejected for the virtual network.

Based on the existing and candidate PCDs/PCD groups, the process creates (at 2320) a routing graph by using one of the approaches described above by reference to FIGS. 3-5. Next, at 2325, the process performs a new set of path searches to identify paths for connecting the entities machine endpoints (e.g., branch office, datacenters, mobile device access locations, etc.). To identify these paths, the process 2300 uses the path search techniques described above.

At 2330, the process 2300 determines whether the new set of path searches resulted in any path that is better for connecting two of the entity's machine endpoints than any path currently used by the virtual network. One path is better than another path in some embodiments if it has a better cost (e.g., smaller delay, fewer dropped packets, less jitter, more reliable, financial cost, etc.). The cost in some embodiments is a blended cost generated by blending multiple metric values (e.g., delay, dropped packets, jitter, reliability, financial cost, etc.). The metric values used in some embodiments are selected by the VNP processes, while in other embodiments they are specified by the entity. Also, some embodiments use the statistics collected at 2305 as the metric values or to generate the metric values for the current paths, while using the measurement generated by the measurement agents to generate the metric values for one or more portion of the newly identified paths. Some embodiments also use the measurements of the measurement agents to generate at least partially the metric values of the current paths.

When the process 2300 determines (at 2330) that each newly identified path is worse than its corresponding current path for connecting the same two entity machine endpoints, the process ends. Otherwise, the process generates (at 2335) a report for display through a UI (user interface) management console or other interfaces (e.g., email, etc.), to provide a recommendation to the entity administrator to add one or more candidate PCDs and/or PCD groups that improves the virtual network performance as gauged by the evaluated metric score.

The metric score in some embodiments includes the cost of the virtual network deployment. In other embodiments, the metric score does not include the cost. However, even in some such embodiments, the process 2300 provides (at 2335) a cost estimate for the virtual network with the recommendation that it provides to the network administrator of the entity. At 2335, the recommended PCDs/PCD groups can belong to different public cloud providers than those specified by the entity, and/or can be in different regions than the PCDs/PCD groups specified by the entity.

At 2340, the process determines whether the entity's administrator accepted any recommendation that the report presented at 2335. If not, the process ends. On the other hand, when the entity's administrator accepts one or more of the recommendations to add one or more PCDs/PCD groups, the process deploys (at 2345) new dedicated MFNs for the entity in the newly added PCDs and/or PCD groups. In some embodiments, the process deploys one MFN in each such PCD or PCD group. In other embodiments, the process can deploy more MFNs in a PCD or PCD group when additional MFNs are needed to handle the traffic load.

The process 2300 configures (at 2345) the newly deployed MFNs (e.g., the CFEs of the newly deployed MFNs) to implement one or more of the newly identified paths that were better than one or more previously used paths. It also reconfigures (at 2345) previously deployed MFNs (e.g., the CFEs of the previously deployed MFNs) to remove the older paths being replaced. To configure the newly deployed MFNs and reconfigure the previously deployed MFNs, the process (1) defines forwarding rules (e.g., next hop records) that configure the MFNs and edge nodes (in multi-machine compute nodes of the entity) to forward data message flows along the desired old and new paths, and (2) distributes these forwarding rules to the old and new MFNs and the edge nodes.

To distribute the forwarding rules (e.g., next hop records), the process in some embodiments provides the forwarding rules to a set of controllers, which then distribute them to the MFNs and edge nodes. When one or more old paths are removed, one or more previously deployed MFNs may no longer be needed. In such a case, the process terminates the operations of the unnecessary MFN(s). After 2345, the process ends.

FIG. 24 illustrates an example of adding a new PCD to a virtual network 2400 to improve its performance. This figure shows two operational stages 2405 and 2410 of the virtual network 2400. The first operational stage 2405 shows that after its initial deployment, the virtual network 2400 spans three PCDs of two public cloud providers in three cities, San Francisco, New York and Philadelphia. This virtual network connects two branch offices 2422 and 2424 and one datacenter 2426 of a corporation.

The second operational stage 2410 shows the virtual network 2400 after it has been modified to add a fourth PCD in Chicago. This PCD has been added to improve the performance of the path between the San Francisco branch office 2422 and the New York branch office 2424. As shown in the first stage 2405, the point-to-point path between the San Francisco and New York PCDs has a weight value (e.g., a delay value) of 12, while the path from San Francisco to Chicago PCDs and the path from Chicago to New York PCDs has a combined weight value of 10. Hence, in this example, the Chicago PCD is added after the virtual networks deployment to improve the connection between the San Francisco and New York offices. However, in this example, the virtual network 2400 continues using the direct connection between New York and San Francisco offices for flows from New York to San Francisco.

As mentioned above, the VNP processes in some embodiments also recommend removal of underutilized public clouds, PCDs and/or PCD groups based on the analysis of the collected statistics and/or new measurements. FIG. 25 conceptually illustrates a VNP process 2500 that produces recommendations to remove one or more underutilized MFNs. In some embodiments, this process is performed periodically (e.g., once every hour, few hours, a day, etc.) or iteratively for each deployed virtual network of each entity. In some embodiments, the process 2500 is also performed iteratively based on other events, e.g., significant changes in data traffic, operation outage of a PCD, etc.

As shown, the process 2500 initially collects (at 2505) statistics from MFNs that implement the virtual network of the entity. The collected statistics relate to the forwarding of the data message flows (e.g., number of data messages, number of bytes, delay in transmission of data messages, etc.) by the MFNs during a particular time period. At 2510, the process 2500 analyzes the collected statistics to identify any underutilized MFNs of the virtual network. In some embodiments, an underutilized MFN is an MFN that, in the particular time period, processes a number of data message flows that fall below a certain threshold. In other embodiments, an underutilized MFN is an MFN that, in the particular time period, forwards less than a threshold amount of data (e.g., threshold amount of bits per second).

At 2515, the process then determines whether it identified any underutilized MFN at 2510. If not, the process ends. Otherwise, the process examines (at 2520) removing the identified underutilized MFN(s) by performing path searches without the identified MFN(s). When more than one underutilized MFN is identified, the process in some embodiments performs just one set of path searches by removing all the underutilized MFNs and identifying a set of optimal paths without any of the removed MFNs. In such cases with multiple underutilized MFNs, the process 2500 in other embodiments performs different sets of path searches with different combinations of one or more utilized MFNs removed. These different path searches enable the process to provide different recommendations based on different combinations of underutilized MFNs being removed.

Next, based on the path searches performed at 2520, the process generates (at 2525) a report for display through a UI (user interface) management console or other interfaces (e.g., email, etc.), to provide one or more recommendations to the entity administrator to remove one or more existing PCDs and/or PCD groups that improved the virtual network performance (as gauged by the evaluated metric score) or improve the virtual network cost.

In the embodiments that deploy one MFN in each PCD/PCD group, the PCD(s) and/or PCD group(s) identified in each recommendation are PCD(s) and/or PCD group(s) in which an underutilized MFN is deployed. In other embodiments, each recommendation in some embodiments is provided by reference to removing a specific MFN (e.g., when more than one MFN can be deployed in each PCD/PCD group). In some embodiments, the process 2500 not only recommends removal of underutilized MFNs, but also recommends removal of other MFNs based on other criteria. For instance, in some embodiments, removal of an intermediate MFN might result in better speed or delay performance of the virtual network as the intermediate MFN slows down its performance.

In some embodiments, each provided recommendation (at 2525) is accompanied with a cost estimate and/or one or more expected performance metric for the virtual network if the recommendation is accepted. For instance, a recommendation could say that if the recommendation is accepted and the virtual network is deployed based on this recommendation, the virtual network would cost $X less per month, but the one or more paths between one or more pairs of machine endpoints would worsen by a certain percentage as gauged by one metric (e.g., slower by as much as Y % more). When more than one path is affected by the removal of a particular combination of one or more MFNs in a particular recommendation, the recommendation also expresses how each one of these paths is affected (e.g., by providing for each path a metric score percentage that expresses how much the path would be worse or better).

At 2530, the process determines whether the entity's administrator accepted any recommendation that the report presented at 2525. If not, the process ends. On the other hand, when the entity's administrator accepts one or more of the recommendations to remove one or more PCDs/PCD groups, the process removes (at 2535) any MFN that is designated for removal in the selected recommendation. When the removed MFN is implemented by one or more machines that are deployed in a PCD, the process 2500 removes the MFN by using the API of the PCD's public cloud provider to direct the provider's server to remove the MFN.

At 2535, the process also reconfigures the remaining deployed MFNs (e.g., the CFEs of these MFNs) and/or edge nodes to implement one or more new paths (identified at 2520) to connect one or more machine endpoints each of which was previously connected by a prior path that used a removed MFN. Like the other above-described processes, the process 2500 in some embodiments reconfigures the MFNs and/or edge nodes by defining and distributing next hop forwarding rules (e.g., next hop records) to one or more remaining MFNs. After 2535, the process ends.

FIG. 26 illustrates an example of removing a PCD 2616 from a virtual network 2600 in order to remove an underutilized MFN 2620 in this PCD. This figure shows two operational stages 2605 and 2610 of the virtual network 2600. The first operational stage 2605 shows that after its initial deployment, the virtual network 2600 spans three PCDs 2612, 2614, and 2616 of two public cloud providers in three cities, San Francisco, Los Angeles and San Diego. This virtual network connects three branch offices 2622, 2624, 2626 of a corporation.

The second operational stage 2610 shows the virtual network 2600 after it has been modified to remove the PCD 2616 in San Diego. This PCD has been removed as its MFN 2620 is underutilized. With this PCD removed, the San Diego office 2626 connects to the PCD 2614 in Los Angeles. As shown in the second stage 2610, the path between the Los Angeles and San Diego offices 2624 and 2626 is 10% slower, but the monthly cost of the virtual network has been reduced by 30%. This is an acceptable tradeoff given the small number of data message flows to and from the San Diego office.

The VNP processes of some embodiments allows an entity with a dedicated virtual network to use other MFNs that have not been specifically deployed for the entity under certain circumstances. These other MFNs in some embodiments are shared MFNs as they are used to deploy different virtual networks for different entities, as opposed to the dedicated MFNs that are specifically deployed for the single entity to deploy just the dedicated virtual network for this entity. One example of using shared MFNs for an entity with a dedicated virtual network is for alleviating congestion at a particular location in the dedicated virtual network.

Specifically, the VNP processes of some embodiments allow for temporary usage of one or more shared MFNs when a portion of the entity's dedicated virtual network (e.g., one or more dedicated MFNs of the entity) appears congested or is expected to be congested. In some embodiments, these shared MFNs are part of a shared virtual network that the VNP provider deploys to handle traffic overflow for all dedicated virtual networks that it has deployed. In other embodiments, the shared MFNs not only handles the overflow data traffic of one or more entities with dedicated virtual networks, but are also used to defined multiple separate virtual networks for multiple other entities, with each of these virtual networks passing the primary data message traffic of its associated entities. Examples of such shared virtual networks were described above by reference to FIGS. 1-20.

FIG. 27 conceptually illustrates a VNP process 2700 that produces recommendations to offload some of the data message traffic from a dedicated virtual network of the entity to one or more shared MFNs for at least a portion of at least one path between at least one pair of machine endpoints. In some embodiments, this process is performed iteratively (e.g., once every hour, few hours, a day, etc.) for each deployed virtual network of each entity.

As shown, the process 2700 initially collects (at 2705) statistics from MFNs that implement the virtual network of the entity. The collected statistics relate to the forwarding of the data message flows (e.g., number of data messages, number of bytes, delay in transmission of data messages, etc.) by the MFNs during a particular time period. At 2710, the process 2700 analyzes the collected statistics to identify one or more overutilized MFNs of the virtual network. In some embodiments, an overutilized MFN is an MFN that, in the particular time period, forwards a number of data messages or an amount of data messages that is greater than a certain threshold.

At 2715, the process then determines whether it identified any overutilized MFN at 2710. If not, the process ends. Otherwise, the process performs (at 2720) path searches to examine adding one or more paths that divert data message flows from each identified overutilized dedicated MFN to one or more shared MFNs (i.e., MFNs used to deploy multiple virtual networks for multiple entities), in order to reduce the load on the overutilized MFN. To divert only some of the data message flows away from the overutilized MFN, the path search in some embodiments defines weights (i.e., thresholds, etc.) to control the amount of data message flows that should be redirected from the existing overutilized MFN to a candidate shared MFN.

To identify each diverting path, the method identifies one or more candidate shared MFNs to divert some portion of the traffic for each identified, overutilized dedicated MFNs of the entity. In some embodiments, a candidate, shared MFN is in the same PCD or PCD group as the overutilized, dedicated MFN for which it is identified when such a candidate, shared MFN is available. When no such shared MFN candidate is available, the VNP process 2700 deploys one such MFN in the PCD or PCD group of the overutilized, dedicated MFN, or selects an existing shared MFN (or deploys on such MFN) in a PCD or PCD group that is nearby the PCD or PCD group of the overutilized, dedicated MFN.

Next, based on the path searches performed at 2720, the process generates (at 2725) a report for display through a UI (user interface) management console or other interfaces (e.g., email, etc.), to provide one or more recommendations to the entity administrator to redirect some of the data message flows away from one or more overutilized dedicated MFNs to the shared virtual network. In some embodiments, each provided recommendation (at 2725) is accompanied with a cost estimate and/or a performance expectation for the virtual network if the recommendation is accepted. For instance, a recommendation could say that if the recommendation is accepted, the virtual network would cost $X more or less per month, and improve the connection (as expressed by one or more of several metrics) between at least one particular pair of endpoint machines by Y %. When the adjustment would improve the performance of two or more connection between two or more endpoint-machine pairs, the recommendations in some embodiments express the improvement for each pair separately.

At 2730, the process determines whether the entity's administrator accepted any recommendation that the report presented at 2725. If not, the process ends. On the other hand, when the entity's administrator accepts one or more of the recommendations to divert some of the data message flows to the shared virtual network, the process defines (at 2735) new configuration data (1) to reconfigure the dedicated virtual network to divert some of the data message flows to the shared MFNs, and (2) to configure the shared MFNs (e.g., the CFEs of the shared MFNs) to forward the redirected data message flows to their destinations or back to the dedicated virtual network at another edge node of the dedicated virtual network.

In some embodiments, the process 2700 reconfigures the dedicated virtual network by configuring one or more front-end load balancers to divert some of the data message flows to shared MFNs that are used to deploy multiple shared virtual networks for multiple entities. This process in some embodiments configures the shared MFNs (e.g., the CFEs of the shared MFNs) by using the newly defined paths to define forwarding rules (e.g., next hop forwarding rules), which it then distributes (through controllers) to the shared MFNs to configure these MFNs.

In some embodiments, the process provides such forwarding rules to the front-end load balancers to configure their operations, along with weight values that specify how much of the data message flows the load balancers should divert to the shared MFNs. In other embodiments, the process 2700 reconfigures the dedicated virtual network by configuring one or more dedicated MFNs (e.g., the CFEs of the MFNs) with new WCMP (weight cost multipathing operation) parameters that control how these MFNs distribute the flows to the overutilized dedicated MFN and to alternative shared MFN(s), in order to reduce the load of the overutilized dedicated MFN. After 2735, the process ends.

FIG. 28 illustrates an example of directing some of the data message flows away from an over congested dedicated MFN 2820 in a dedicated virtual network 2800 to a shared virtual network 2850. This figure shows two operational stages 2805 and 2810 of the virtual network 2800 that connects three offices 2880, 2882 and 2884 of an entity in Los Angeles, Chicago and New York. The first operational stage 2805 shows that that the dedicated MFN 2820 in a Chicago PCD 2814 as being over congested. This MFN connects dedicated MFNs 2822 and 2824 in a Los Angeles PCD 2812 and a New York PCD 2816.

The second stage 2810 shows that the dedicated MFN 2822 reconfigured in the Los Angeles PCD 2812 to redirect the data message flows from the Los Angeles dedicated MFN 2822 to the New York dedicated MFN 2824 through a shared MFN 2830 in the same Chicago PCD 2814 as the overutilized dedicated MFN 2820. The shared MFN 2830 is part of the shared virtual network 2850, which is used by a second company to connect its Chicago and New York offices 2870 and 2872.

In this example, this shared MFN 2830 in Chicago forwards these data messages to the MFN 2832 in New York, which then provides them to the dedicated MFN 2824 in New York. In other examples, the shared MFN 2830 in Chicago can forward these data messages to the dedicated MFN 2824 in New York. Also, in the example in FIG. 28, the Chicago PCD 2814 is still used to exchange other messages between the LA and Chicago offices 2880 and 2882, between the NY and Chicago offices 2884 and 2882, and from New York office 2884 to the LA office 2880.

In some embodiments, the data message flows from LA to New York are forwarded to the shared MFN 2830 in Chicago by a load balancer, which can be separate from the LA MFN 2822, or part of this MFN 2822. In still other embodiments, this load balancing operation is part of WCMP operation that the cloud forwarding element of the MFN 2822 performs. Yet other embodiments deploy this load balancer in the Chicago PCD 2814 to distribute some of the load between the dedicated MFN 2820 and the shared MFN 2830. Instead of just forwarding all the flows from LA to New York through the shared virtual network, other embodiments use other techniques to distribute the load between the dedicated MFN 2820 and shared MFN 2830 in Chicago. For instance, the MFNs in LA and New York perform WCMP to distribute the flows that they send to Chicago among these two MFNs, i.e., use weights to specify percentage of flows that they direct to each of these MFNs.

In FIG. 28, the shared MFN 2830 is an intermediary node that redirects some of the flows away from the dedicated MFN 2820 but delivers these flows back to the dedicated virtual network at another dedicated MFN 2824. In other examples, the shared virtual network delivers the redirected data message flow to an entity's machine endpoint, e.g., an entity's office or branch location. FIG. 29 illustrates one such example. This example is similar to the example of FIG. 28, except that the shared MFN 2832 in New York provides the flows from the LA office directly to the New York office 2884 without first going through the dedicated MFN 2824 in New York.

In yet other examples, one or more shared MFNs of one or more shared virtual network are used in some embodiments as a way to relieve flow congestion at multiple different locations along a path through a dedicated virtual network. FIG. 30 illustrates one such example. The first stage 3005 in this figure shows a path making five hops along a dedicated virtual network 3000 that uses five PCDs 3011, 3012, 3014, 3016, and 3018 in Tokyo, Los Angeles, New York, Barcelona and Tel Aviv to connect two offices 3080 and 3082 in Tokyo and Tel Aviv. It also shows the MFNs 3020 and 3024 in LA and Barcelona as being used to process too many flows.

The second stage 3010 shows some of the data message flows exchanged between the Tokyo and Tel Aviv offices are redirected in the LA PCD 3012 and Barcelona PCD 3016 to shared virtual network 3090. In redirecting these flows, the Tokyo MFN 3021 is configured to forward certain number of flows to the shared MFN 3060 in the LA PCD 3012. The New York shared MFN 3062 receives these redirected flows and directs them back to the dedicated virtual network 3000 at the dedicated MFN 3022 in the New York PCD 3014.

As the dedicated virtual network 3000 is congested in Barcelona along the path from Tokyo to Tel Aviv, a dedicated MFN 3024 in Barcelona again redirects some of the data message flow to the shared virtual network 3090 by directing these flows to a shared MFN 3064 in the Barcelona PCD 3016. The Barcelona shared MFN 3064 receives these redirected flows, forwards them to a Tel Aviv shared MFN 3066, which then directs them back to the dedicated virtual network 3000 by forwarding them to the Tel Aviv dedicated MFN 3026.

In the example of FIG. 30, the redirection is accomplished in some embodiments by using load balancers, while in other embodiments it is accomplished through a set of weights that the cloud forwarding elements of the MFNs use to perform WCMP operations for data message flows from the Tokyo office 3080 to the Tel Aviv office 3082. Also, in this example, the offloading shared MFNs of the shared virtual network are in the same datacenters as their corresponding dedicated MFNs. As mentioned above, this does not have to be the case (i.e., the data message flows can be redirected to other MFNs in other datacenters, such as nearby datacenters).

After configuring one or more shared MFNs to handle some of the data message traffic for an entity's dedicated virtual network, the VNP processes of some embodiments continue monitoring the MFNs of the dedicated virtual network to determine whether the load on previously congested MFNs has fallen sufficiently such that one or more of the shared MFNs are no longer needed. FIG. 31 illustrates one such process 3100. This process is iteratively performed by the VNP machines after the process 2700 detects that at least one dedicated MFN for the entity is over congested and some or all of the traffic should be redirected away from it to one or more shared MFNs.

As shown, the process 3100 initially collects (at 3105) statistics from MFNs that implement the dedicated virtual network of the entity. The collected statistics relate to the forwarding of the data message flows (e.g., number of data messages, number of bytes, delay in transmission of data messages, etc.) by the MFNs during a particular time period. At 3110, the process 3100 analyzes the collected statistics to determine whether it should reclassify as not congested any dedicated MFNs that the process 2700 previously identified as over congested. For this reclassification of a previously identified overutilized MFN, the process 3100 in some embodiments requires the data message load on the MFN (e.g., the number of data message flows processed, or the overall number of bytes processed, by the MFN) to be below a certain threshold for a duration of time (e.g., for multiple iterations of the process 3100). This is done in order to ensure that one MFN does not constantly switch between an over congested status and a uncongested status.

At 3115, the process then determines whether it changed (at 3110) the status of any MFN from congested to not congested. If not, the process ends. Otherwise, the process reconfigures (at 3120) the dedicated virtual network to no longer redirect any data message traffic away from any dedicated MFNs that had its status changed (at 3110) from congested to not congested. In the embodiments in which the process 2700 used frontend load balancers to redirect some of the data message flow away from congested dedicated MFNs, the process 3100 does its reconfiguring by distributing new load balancing criteria to any frontend load balancer that the process 2700 deployed for any reclassified MFN (at 3110).

On the other hand, in the embodiments in which the process 2700 redirects part of the data message flow away from a congested dedicated MFNs by distributing WCMP parameters to the forwarding elements of the MFNs and edge nodes, the process 3100 does its reconfiguring (at 3120) by distributing new WCMP parameters to these cloud forwarding elements and edge nodes that forward data messages to a reclassified MFN (at 3110). These new WCMP parameters cause these forwarding elements to not redirect any data message flows away from the reclassified MFN. At 3120, the process 3100 also removes forwarding records from any shared MFN (e.g., the CFE of any shared MFN) of the VNP shared virtual network that are no longer needed to forward redirected traffic of the dedicated virtual network. After 3120, the process ends.

Another example of VNP processes of some embodiments allowing a dedicated virtual network to use one or more shared MFNs occurs when these processes allow the dedicated virtual network to use a shared MFN near or at the Internet backbone (called backbone MFN below) when the use of such an MFN would improve the performance of the entity's overall virtual network. As commonly understood, the Internet backbone is a collection of several redundant networks owned by numerous companies that include commercial, government, academic and other high-capacity network centers, etc. The backbone is defined typically by principal data routes between core networks and routers of these centers.

Certain datacenters (e.g., Equinux datacenters) are near datacenters that are part of the Internet backbone, and by virtue of their location, provide very fast connections to the Internet. These datacenters and a few other datacenters that service the Internet backbone provide limited hosting services. However, setting up machines near or at the Internet backbone is difficult and can be expensive for any one entity. Accordingly, entities might not typically request that their virtual networks have a dedicated MFN deployed near or at the Internet backbone. Deploying such dedicated MFNs might not even be possible for individual entities. However, the VNP in some embodiments deploys one or more MFNs in each of one or more backbone PCDs or near the backbone PCDs, so that these MFNs can be used by shared and dedicated virtual networks deployed by the VNP.

Before or after deploying the MFNs for an entity, the VNP processes perform path searches that might determine for certain compute nodes of the entity, it is desirable to use a path that traverses through one or more shared MFNs deployed near or at the Internet backbone (i.e., to use a path that leaves the dedicated virtual network of the entity for at least a portion of one or more paths in order to use MFN(s) near or at the Internet backbone). In such cases, the process of some embodiments provides a recommendation to the entity that the shared MFNs deployed near or at the Internet backbone should be used. When the entity accepts this recommendation, the process configures the MFNs to use the identified path(s) that use the shared MFNs near or at the Internet backbone.

FIG. 32 conceptually illustrates a VNP process 3200 that produces recommendations for a dedicated virtual network to use one or more backbone MFNs. In some embodiments, this process is performed iteratively (e.g., once every week, once every month, etc.) for each deployed virtual network of each entity. In some embodiments, the process 3200 is not performed for an entity that has specifically rejected the use of backbone MFNs generally, or rejected all viable backbone MFNs that are identified in previous iterations of the process 3200.

As shown, the process 3200 initially identifies (at 3205) one or more shared backbone MFNs that are candidates for forwarding some of the entity's data message traffic. In some embodiments, the process 3200 identifies (at 3205) the candidate backbone MFNs by identifying each backbone MFN that is within a threshold physical distance and/or within threshold network distance (e.g., within a certain connection delay) of the PCDs or PCD groups over which the entity's virtual network is defined.

At 3210, the process performs path searches that not only include as routing graph nodes the MFNs of the PCDs and/or PCD groups currently spanned by the entity's virtual network, but also include any shared backbone MFN identified at 3205 as routing group nodes (i.e., as nodes in the routing graph used for the path searches). By including the backbone MFN(s) as routing graph nodes in the path searches, the process tries to identify any optimal path that uses a backbone shared MFN to route data message flows from one location in the dedicated virtual network to the flow destinations or back to another location in the dedicated virtual network. For one pair of machine endpoints of the entity, the path searches of the process do not identify any path that uses a shared backbone MFN when these searches identify a better path (when gauged according to any set of one or more metrics, such as delay, loss, jitter, reliability, etc.) that connects the same endpoint pair by traversing only through the dedicated virtual network.

At 3215, the process determines whether it identified (at 3210) any backbone-using path that was better for one pair of machine endpoints than all other paths it identified for connecting the same endpoint pair by traversing only through the dedicated virtual network. If not, the process ends. Otherwise, at 3220, the process generates a report for display through a UI (user interface) management console or other interfaces (e.g., email, etc.), to provide one or more recommendations to the entity administrator to use one or more backbone MFNs to forward at least some of the data message flows of the entity.

In some embodiments, each provided recommendation (at 3220) is accompanied with a cost estimate and/or a performance expectation for the virtual network if the recommendation is accepted. For instance, a recommendation could say that if the recommendation is accepted, the virtual network would cost $X less per month, and improve the connection speed for a particular machine endpoint pair (as expressed by any one of several metrics) by Y %. If the adjustment would improve the performance of two or more connections between two or more endpoint-machine pairs, the recommendations in some embodiments express the improvement for each pair separately.

At 3225, the process determines whether the entity's administrator accepted any recommendation that the report presented at 3220. If not, the process ends. On the other hand, when the entity's administrator accepts one or more of the recommendations to divert some of the data message flows to one or more backbone MFNs identified in the presented recommendation(s), the process defines (at 3230) new configuration data (1) to reconfigure the dedicated virtual network to divert some of the data message flows to the VNP's shared virtual network and its shared backbone MFN, and (2) to configure the shared virtual network and its shared backbone MFN (e.g., the CFE of the shared backbone MFN) to forward the redirected data message flows to their destinations or back to the dedicated virtual network at another edge node of this dedicated virtual network.

In some embodiments, the process 3200 reconfigures the dedicated virtual network by configuring one or more forwarding elements of the MFNs and/or edge nodes to divert some of the data message flows to a shared backbone MFN. This process in some embodiments configures the shared virtual network by using the newly defined paths to define forwarding rules (e.g., next hop forwarding rules), which it then distributes (through controllers) to the shared MFNs of the shared virtual network to configure these MFNs. After 3230, the process ends.

FIG. 33 illustrates an example of directing some of the data message flows away from a dedicated virtual network 3300 to its destination through a shared virtual network 3350 and its shared backbone MFN 3355. This figure shows two operational stages 3305 and 3310 of the virtual network 3300 that connects three offices 3380, 3382 and 3384 of an entity in Los Angeles, Chicago and New York.

The first operational stage 3305 shows that a dedicated MFN 3320 in a Chicago PCD 3314 connecting the LA and Chicago offices 3380 and 3382. This MFN 3320 also connects the dedicated MFNs 3322 and 3324 in LA and NY PCD 3312 and 3316 in order to forward data messages from the LA office 3380 to the NY office 3384. For data messages from NY to LA, the NY dedicated MFN 3324 directly forwards the data messages to the LA dedicated MFN 3322 using a connection link between the NY and LA PCDs 3316 and 3312. This direct path is faster for flows from NY to LA, even though the direct path from LA to NY is slower than the path from LA to Chicago and Chicago to NY.

The second stage 3310 shows the use of the shared backbone MFN 3355 and the VNP's shared virtual network 3350 to forward flows from the LA office 3380 to the NY office 3384. As shown, the LA MFN 3322 provides these flows to the MFN 3355 in a backbone PCD 3360, which then forwards the flows to another shared MFN 3357 in another backbone PCD 3362. This other MFN 3357 provides the flows to the shared MFN 3332 in the NY PCD 3316, which then forwards the flows to the MFN 3324 in this PCD. This path is used as it is faster than the path that runs through the Chicago PCD for flows going from LA to NY. The Chicago PCD and its MFN, however, are still used for flows between LA and Chicago, and flows between Chicago and New York.

In FIG. 33, the shared backbone MFN 3355 is an intermediary node that redirects some of the flows away from the dedicated virtual network at the LA PCD 3312, but delivers these flows back to the dedicated virtual network at the NY PCD 3316. In other examples, the shared backbone MFN connects directly to the entity edge nodes (e.g., at branch offices or datacenters) to receive flows directly from, and/or to provide flows directly to, the entity's machine endpoint, e.g., an entity's office or branch location. FIG. 34 illustrates one such example. This example is similar to the example of FIG. 33, except that the LA office edge node provides its flows directly to the backbone MFN 3355, while the backbone MFN 3357 provides these flows directly to an edge node of the NY office 3384. In other examples, one of the LA and NY offices sends/receives data message flows directly to/from the backbone, while the other one sends/receives data message flows through an MFN in a PCD.

Another example in which an entity can use a shared MFN involves the use of shared MFNs in remote locations by the mobile devices of an entity in those location. For instance, an entity may predominantly operate in one region (e.g., only have offices in North America, etc.), but may have users that go on trips internationally and need to access the entity's dedicated virtual network through a virtual network at those remote locations. For such situations, the process of some embodiments allows the mobile devices (e.g., phones, tablets, laptops, etc.) of these traveling users to access its virtual network through one or more shared MFNs that the process deploys in one or more PCDs (e.g., public clouds in Europe or Asia) in foreign countries.

FIG. 35 illustrates a process 3500 that some embodiments use to deploy a dedicated virtual network for an entity with mobile device access support from remote locations provided through the VNP's shared MFNs. As shown, the process 3500 receives (at 3505) a first set of regions over which the entity's dedicated virtual network should be defined. In some embodiments, the process receives these regions as a list of cities (e.g., San Francisco, LA, NY, etc.), or regional areas (e.g., Northern California, Southern California, etc.), etc. In other embodiments, the process receives these regions as a list of PCDs or PCD groups of one or more public cloud providers.

Next, at 3510, the process receives a second set of regions for which the entity wants mobile device support outside of the first set of regions. For example, when the entity has offices in North America but has employees that regularly travel to China and Japan, it might specify that the dedicated virtual network be deployed over several public cloud datacenters in several US cities or geographic regions, but also request mobile device access to this dedicated virtual network from certain cities or geographic regions in China and Japan.

In the identified first and second set of regions, the process (at 3515) then identifies the PCDs or PCD groups over which the dedicated virtual network should span, or through which the mobile-device access should be available in remote locations. In some embodiments, PCDs and/or PCD groups are specifically identified in the user input provided at 3505 and 3510, while in other embodiments some or all of the PCDs and/or PCD groups are not identified by the entity.

Next, at 3520, the process performs a series of path searches to identify paths for defining the dedicated virtual network and paths to this network from the shared MFNs supporting remote location access of the mobile devices. To perform these path searches, the process generates a routing graph and uses the path search techniques (e.g., shortest path techniques) described above. After identifying paths to implement the dedicated virtual network and remote access to this network from remote locations through the VNP's shared MFNs, the process 3500 deploys (at 3525), for the entity, dedicated MFNs in the identified set of PCDs and/or PCD groups in the identified first set of regions.

The process also deploys (at 3525) shared MFNs in the identified PCD(s) and/or PCD group(s) in the identified second set of regions, when these PCD(s) and/or PCD group(s) did not have any such MFNs before. When the shared MFNs already were deployed in the identified PCD(s) and/or PCD group(s) in the identified second set of regions, the process identifies (at 3525) these share MFNs. At 3525, the process also distributes to the deployed dedicated MFNs (e.g., the CFEs of these dedicated MFNs) forwarding rules (e.g., next hop forwarding rules) to implement the paths identified (at 3520) for implementing the dedicated virtual network. It also distributes (at 3525) to the shared MFNs (deployed and/or identified at 3525) forwarding rules (e.g., next hop forwarding rules) to implement the paths from the VNP shared MFN(s) to the entity's dedicated virtual network. In some embodiments, these forwarding rules configure the CFEs of these shared MFNs to implement one or more paths identified 3520.

Once the dedicated and shared MFNs are configured with the appropriate forwarding rules, the process can receive (at 3530) request to access the dedicated virtual network from a mobile device that connects to a PCD or PCD group in one of the identified second set of regions. To connect, the mobile device initially performs a DNS operation to identify the optimal location to connect to the dedicated virtual network. Since the mobile device is in one of the second set of regions over which the dedicated virtual network does not span, the DNS server provides the network address of a shared MFN in a second-set region to which the mobile device should connect.

The mobile device then connects to this shared MFN and goes through the authentication/authorization process to access the dedicated virtual network. After processing the mobile device's authentication/authorization (e.g., forwarding the mobile device's authentication/authorization credentials to authentication/authorization servers), the shared MFN forwards (at 3535) data message flows from the mobile device to the dedicated virtual network based on its configured forwarding rules. This shared MFN might be able to provide the data message flows directly to a PCD and/or PCD group over which the dedicated virtual network spans, or it might have to indirectly provide these flows through one or more other shared MFNs of the VNP. After 3535, the process 3500 ends.

In some embodiments, a shared MFN has to be in the same PCD or PCD group before it can exchange flows with a dedicated MFN. In other embodiments, a shared MFN can exchange flows with a dedicated MFN in a different PCD or PCD group. In some of these other embodiments, the shared MFN can only exchange flows with a dedicated MFN in another PCD or PCD group so long as both MFNs operate in the facilities of the same public cloud provider.

When the data message flows from the mobile device reaches the entity's dedicated virtual network (i.e., reaches a dedicated MFN deployed for the entity), they are forwarded through this network to their machine endpoint destination, which can be a branch office or datacenter machine (through the branch office or datacenter edge node), a SaaS machine, or a machine of the entity that operates in a public cloud. The remote shared MFN to which the mobile device connects, and any intermediary shared MFNs of the VNP, also pass data message flows from the entity machines connected to the dedicated virtual network back to the mobile device.

In some embodiments, the VNP charges mobile device access to the dedicated virtual network from remote locations differently than direct machine access (mobile or otherwise) to the dedicated virtual network. For instance, in some embodiments, the dedicated and shared MFNs maintain statistics regarding the data message flows, and provide these statistics to the VNP's server set. This server set then uses one set of fees to compute the charges for data message flows that do not use shared MFNs, while using another, different set of fees to compute the charges for data message flows that use the shared MFNs. In some embodiments, the VNP charges mobile device access to the dedicated virtual network from remote locations differently than direct machine access to the dedicated virtual network

FIG. 36 illustrates an example of a mobile device 3605 in China connected to a dedicated virtual network 3600 defined in North America. As shown, the mobile device 3605 connects to VNP shared MFN 3610 in a PCD 3612 in China, in order to connect to the dedicated virtual network 3600 through another shared MFN 3615 in a PCD 3614 in Japan and a shared MFN 3620 in a PCD 3616 in LA. The shared MFN 3620 in PCD 3616 connects to the dedicated MFN 3625 of the virtual network 3600 in the same PCD 3616 in LA. From there, the mobile device 3605 is connected to the dedicated virtual network 3600. In other embodiments, the shared MFN 3610 is configured to directly forwards data messages from mobile device 3605 to the dedicated MFN 3625 or the shared MFN 3620. Specifically, some embodiments can configure just one shared MFN in an external region outside of the regions that implements an entity's virtual network, to forward data message flows from a mobile device in or near the external region to the entity's virtual network.

FIG. 37 illustrates a process 3700 that some embodiments use to identify optimal paths to SaaS provider from a set of machines of an entity for which the VNP deploys a dedicated virtual network. From the entity, the process 3700 initially receives (at 3705) a set of PCDs and/or PCD groups over which the entity's dedicated virtual network should be defined. For instance, for a company with offices in LA, San Francisco and New York, the company might specify that Amazon's PCDs in these three cities be used to define its virtual network.

At 3710, the process also receives a list of machine endpoints and network addresses for these endpoints when available. For instance, in the above example, the process in some embodiments would receive the network addresses of the LA, San Francisco and New York branch offices and/or datacenters. At 3710, the process in some embodiments also receives identification of regions in which the entity wants mobile device access support. The entity in some embodiments further provides (at 3715) a list of SaaS providers used by the entity. In some embodiments, SaaS providers on this list are identified through their domain names, or through any of the other ways for identifying SaaS providers that were described above.

Next, at 3720, the process 3700 performs a series of path searches to identify paths for defining the dedicated virtual network. These identified paths not only connect the machine endpoints of the entity in different locations, but also connect these machines to the SaaS provider machines. To perform these path searches, the process generates a routing graph and uses the path search techniques (e.g., shortest path techniques) described above.

Also, to identify the optimal paths to the SaaS provider machine endpoints, the process 3700 uses the methodologies described above. However, as the process 3700 uses this methodology in the context of the PCDs and/or PCD groups specified by the entity for the entity's dedicated virtual network, this methodology can identify a different set of SaaS provider machine endpoints for the entity than those that the VNP processes would identify had the entity not picked a specific set of PCDs and/or PCD groups, or the VNP processes would identify for a shared virtual network defined in the same regions as the entity's specified set of PCDs and/or PCD groups. One example of how the specific entity input regarding the desired set of PCDs and/or PCD groups can result in the use of another set of SaaS provider machine endpoints will be described by reference to FIG. 38.

After identifying paths to implement the dedicated virtual network and SaaS provider access through this network, the process 3700 deploys (at 3725), for the entity, dedicated MFNs in the specified set of PCDs and/or PCD groups. At 3725, the process distributes to the deployed dedicated MFNs (e.g., the CFEs of these dedicated MFNs) forwarding rules (e.g., next hop forwarding rules) to implement the paths identified (at 3725) for implementing the dedicated virtual network. After 3725, the process 3700 ends.

FIG. 38 illustrates an example in which the SaaS datacenter is selected based on the PCDs that an entity selects for deploying its virtual network. In this example, four PCDs are shown, two PCDs 3802 and 3804 selected by the entity and two PCDs 3806 and 3808 not selected by the entity. In some embodiments, the selected PCDs belong to one public cloud provider selected by the entity, while the unselected ones belong to another public cloud provider not selected by the entity. Had the entity selected the PCDs 3806 and 3808, the best path to the SaaS provider would have been from edge node 3801 in the office 3803 to the SaaS datacenter 2 through these two PCDs 3806 and 3808, as this path only has a cost of 4. However, since these two PCDs were not selected, the SaaS datacenter 1 is selected and the best path to it goes through MFNs 3812 and 3814 of the PCDs 3802 and 3804. This path has a total cost of 5, while the other paths have costs of 6 and 7.

In some embodiments, an edge node of a multi-machine compute node (MMCN) is an SD-WAN edge node that connects through multiple different network connections (called links) to one or more external networks that connect it to the Internet. FIG. 39 illustrates an example of such an SD-WAN edge node 3900 that connects multiple compute devices 3910 at an MMCN location 3905 (office, datacenter, etc.) to the Internet 3920 through multiple links 3902, 3904, and 3906. A different Internet service provider can connect each link to the Internet, e.g., an MPLS link would connect through an MPLS provider's, a high speed Internet connection link (e.g., cable modem) would connect through the high-speed Internet provider's network (cable provider's network), a wireless link would connect through a wireless telecommunication network provider, etc.

The VNP processes in some embodiments account for the availability of these different links and configure each SD-WAN edge node to use the best link for each MFN in the set of one or more MFNs to which the edge node connects. FIG. 40 illustrates one such process 4000 of some embodiments. For each SD-WAN edge node, the process 4000 initially has (at 4005) the measurement agents in nearby candidate PCDs and/or PCD groups take network connection measurements (e.g., measure RTT delay) to the edge node for each link of the SD-WAN.

The nearby candidate PCDs and/or PCD groups in some embodiments are the PCDs and/or PCD groups within a threshold physical or connection distance to each SD-WAN edge node that are viable PCDs and/or PCD groups (i.e., that have not been rejected, and/or are not part of a PCD/PCD group not accepted, by the entity for its dedicated virtual network). To take the measurements for the links, the measurement agents are provided with one or more network addresses (e.g., static IP addresses) associated with each link. These measurement agents in some embodiments use each address to send pinging messages (e.g., UDP echo messages) and measure the RTT delay and other characteristics of these messages.

Next, at 4010, the process generates a routing graph with a set of one or more links for each SD-WAN edge node. For each nearby candidate PCD and/or PCD group (i.e., for an MFN in each such candidate PCD/PCD group), the process 4000 specifies (at 4010) one link of each SD-WAN edge node for the routing graph. The specified link for each PCD/node pair is the best link for the pair when gauged based on a single metric value (e.g., delay, loss, etc.) or a blended metric value of two or more metrics. In other embodiments, the process includes in the routing graph more than one link between each edge node and its candidate PCD/PCD group.

At 4015, the process performs path searches that use the measurements generated by the measurement agents (including the different measurements to the different links of each SD-WAN edge node) to identify a set of paths connecting the entity's machines (including SaaS machines to use) across the set of PCDs and/or PCD groups. To account for mobile device connections, the path searches also identify paths between all possible PCD/PCD group pairs that can serve as ingress and egress nodes for paths across the dedicated virtual network. These path searches are shortest search path searches that try to find the minimal cost path between two machine endpoints, where a path cost is expressed in terms of one or more metric values (e.g., delay, jitter, loss, reliability, etc.).

After identifying the optimal paths for connecting different machine endpoints of the virtual network, the process 4000 (at 4020) deploys and configures dedicated MFNs (e.g., the CFEs of these MFNs) for the entity in the PCD and/or PCD groups spanned by the identified paths. To configure these MFNs, the process (1) uses the identified paths to define forwarding rules (e.g., next hop records) for the MFNs to use to forward data message flows along the paths, and (2) distributes these forwarding rules to the MFNs (e.g., to the CFEs of these MFNs). To distribute the forwarding rules, the process in some embodiments provides the rules to a set of controllers, which then distribute them to the MFNs. The process 4000 is used in some embodiments to deploy shared virtual networks for an entity. In such embodiments, the process 4000 configures (at 4020) shared MFNs to implement the paths identified at 4015.

The process 4000 also configures the SD-WAN edge nodes to forward data message flows to particular destinations along particular links to particular MFNs in the PCDs/PCD groups spanned by the paths identified at 4015. To do this, the process has the cloud forwarding elements of the MFNs configure these edge nodes by using BGP protocols to provide the edge nodes with a set of forwarding records to use. Using the BGP protocol, the MFNs provide the edge nodes with routes and route attributes, which allow the edge nodes to identify the best routes for them to use (e.g., based on weight attributes, local preference attributes, etc.).

FIG. 41 presents an example that illustrates configuring an SD-WAN edge node to use the best link/MFN pair for the best path to a destination endpoint in the virtual network. In this example, an office 4102 in Mexico City has to access a datacenter 4104 in Oregon through two sets of datacenters of two public cloud providers A and B. The office 4102 has an edge node 4105 with two different connection links 4112 and 4114, which can be an MPLS link and a cable modem link.

As shown, each of these links has a cost associated with it (i.e., a cost of 1 for link 4112 and a cost of 2 for link 4114). These costs are generated in some embodiments by the measurement agents in the Mexico City PCDs 4122 and 4124 of the PCPs A and B. As further shown, three different paths are explored between the Mexico City office 4102 and the Oregon datacenter 4104. Two of these paths go through link 4112, which is the better link for PCP A, while one path goes through link 4114, which is the better link for PCP B.

Of these three paths, the path 4150 that goes through the Mexico City PCD 4122 of PCP A and the Oregon PCD 4126 of PCP A is the best path for data message flows from the Mexico City office to the Oregon datacenter 4104. As shown, this path has a cost of 4, when computed based on a set of one or more metric values. The path that goes through the Mexico City PCD 4122 of PCP A and the SF PCD 4128 of PCP A has a cost of 5, while the path that goes through the Mexico City PCD 4124 of PCP B and the Oregon PCD 4132 of PCP B has a cost of 7. Hence, through BGP protocols, the MFN 4130 of the Mexico City PCD 4122 in some embodiments configures the edge node 4105 to forward flows to the Oregon datacenter 4104 through link 4112 and MFN 4130.

Many embodiments are described above by reference to processes and operations of a virtual network provider. One of ordinary skill will realize that many of the above-described processes and operations are performed in other embodiments by one public cloud provider to define a virtual network that spans multiple of its PCDs and/or PCD groups. Alternatively, in some embodiments, each entity will operate network managers/controllers that perform these processes and operations to deploy the entity's virtual network over one or more PCDs/PCD groups of one or more PCPs.

For such network managers/controllers, some embodiments do not deploy and configure MFNs to implement virtual networks. Instead, these embodiments provide measurements that quantify connections between PCDs or PCD groups to other processes that deploy and configure MFNs. Some embodiments provide these measurements to other processes that perform other cloud-based operations, such as processes that deploy application machines in the public clouds and use the measurements to identify the best locations for such deployments. Other processes (e.g., an entity's network managers/controllers) use these measurements to perform other cloud-based operations itself (e.g., deploying application machines in the public clouds and using the measurements to identify the best locations for such deployments).

FIG. 42 illustrates a process 4200 that some embodiments use to deploy a set of one or more resource in optimal locations in the public clouds based on measurements generated by the measurement infrastructure of some embodiments. The deployed set of resources can include any type of resource, such as compute resources (e.g., VMs, containers, servers, etc.), network resources (e.g., routers, switches, gateways, etc.) or service resources (e.g., any middlebox service machine or appliance, e.g., firewall, load balancer, etc.). However, in several examples provided below, the deployed resource is machine that executes an application or set of applications. In some embodiments, the process 4200 is performed by a deployment-location identifier 4300 illustrated in FIG. 43.

As shown in FIG. 42, the process 4200 starts when the deployment-location identifier 4300 receives (at 4205) a request for a server in a server set 4305 for an optimal location for deploying a machine (e.g., VM or container) to execute a particular application or a set of applications in one PCD among various possible candidate PCDs 4330. The server set 4305 in some embodiments is a set of one or more compute managers or controllers, which communicate with the deployment-location identifier 4300 through a network 4350 (e.g., a LAN, WAN or the Internet).

The received request in some embodiments provides (1) a list of candidate PCDs, PCD groups and/or PCP providers and/or (2) the locations (e.g., network addresses) of an entity's edge nodes 4345 that would access the machine that is to be deployed. In some embodiments, all or part of this information (i.e., the list of candidate PCDs, PCD groups and/or PCP providers, and/or the edge-node locations) is not provided with the request because the information was previously provided for an entity and hence is stored in a configuration database for the entity. To optimize machine location deployments for mobile device access locations, some embodiments define edge-node locations as locations of PCDs or PCD groups to which the mobile device typically connect. Also, the edge nodes in some embodiments are communicatively connected through a virtual network that is defined to span multiple of the PCDs and/or PCD groups. In other embodiments, no such virtual network is defined for connecting the edge nodes.

At 4210, the deployment-location identifier 4300 sends a request through the network 4350 to a measurement aggregator 4310 for a set of network-connection measurements between different pairs of PCDs and/or PCD groups that are candidate PCDs and/or PCD groups (1) for deploying the requested resource set or (2) for traversing to reach the deployed resource set. In the embodiments in which the request at 4205 does not provide the list of candidate PCDs and/or PCD groups (e.g., the request simply provides a list of PCP providers and/or network addresses of nodes for connecting to the PCDs), the process 4200 has to first identify the list of candidate PCDs and/or PCD groups before requesting the measurements at 4210.

To identify the candidate PCDs and/or PCD groups in such situations, the process 4200 in some embodiments uses a set of inputs that it receives with the request at 4205 to filter the list of available PCDs and/or PCD groups to discard PCDs and/or PCD groups that are not appropriate. For example, the server set 4305 in some embodiments provides two PCPs as acceptable PCPs and providers network addresses associated with offices in Northern California for accessing the deployed resource. In such a case, the deployment-location identifier would discard all PCDs and/or PCD groups that are not operated by the two acceptable PCPs, and then would discard the PCDs and/or PCD groups of these two acceptable PCPs that are outside of Northern California.

At 4210, the request that the deployment-location identifier 4300 sends to the measurement aggregator 4310 also requests in some embodiments a set of network-connection measurements that relate to the network connections between the different PCDs/PCD groups and the edge node locations of the entity (e.g., the MMCN locations of the entity). These measurements are used in some embodiments to express costs of links between the PCDs/PCD groups and the entity edge nodes. In some of these embodiments, the measurement agents not only ping other measurement agents in other PCDs/PCD groups, but also ping forwarding elements in the entity edge nodes to generate measurements between the PCDs/PCD groups and the entity edge nodes.

At 4215, the deployment-location identifier 4300 receives the measurements requested for the candidate PCDs and/or PCD groups from the measurement aggregator 4310. As described above, the measurement apparatus of some embodiments includes measurement agents 4335 in each of numerous PCDs and/or PCD groups 4330, and each such measurement agent continuously generates network measurements to quantify the quality of the network connections between its respective PCD or PCD group and PCDs/PCD groups of other measurement agents. The generation of such network measurements (e.g., delay measurements, jitter measurements, loss measurements, reliability measurements, etc.) was described above. In some embodiments, the measurement agents are deployed by the measurement aggregator. In other embodiments, the measurement agents are deployed by controllers and/or managers of the virtual network provider or another entity.

The measurement agents 4335 provide the network-connection measurements that they generate to the measurement aggregator 4310. In some embodiments, the measurement agents 4335 periodically push (forward) these measurements to the aggregator 4310, while in other embodiments periodically pulls (retrieves) these measurements from the agents 4335. The reporting periods are configurable in some embodiments, but typically are set for every hour, few hours (e.g., 6 or 12 hours), every day, etc.

In some embodiments, the measurement aggregator uses a weighted aggregation formulation (e.g., a weighted sum) to blend a new measurement for a network connection between a PCDs/PCD group pair (e.g., two PCDs, a PCD and a PCD group, or two PCD groups) in order to ensure that a new measurement does not solely define the quality of a network connection between the pair. The measurement aggregator 4310 is used in other embodiments as well, e.g., in the embodiments that deploy and configure MFNs to define virtual networks that span multiple PCDs/PCD groups for entities.

After receiving (at 4215) the network measurements, the process uses (at 4220) the received measurements to identify an optimal PCD or PCD group in which the requested set of resources should be deployed. To do this, the process 4200 performs a set of path searches to identify the deployment location that results in the best overall set of paths to the deployed location from all the locations that have to access the deployed set of resources. To identify the best overall set of paths, the process 4200 costs the paths based on one type of measurements (e.g., connection speeds) in some embodiments, while in other embodiments it costs the paths based on multiple types of measurements (e.g., connection speeds and packet loss).

To perform these path searches, the process 4200 in some embodiments not only uses the measurements regarding the network connections between PCDs/PCD groups, but also uses measurements regarding the network connections between PCDs/PCD groups and the locations (e.g., network addresses) of the entity that will access the deployed resource. For instance, in the example of FIG. 43, the deployment-location identifier 4300 uses the received set of measurements and the locations of the edge nodes 4345 to perform a set of path searches to identify an optimal PCD or PCD group in which the requested machine (for executing an application or application set) should be deployed for the edge node 4356.

FIG. 44 presents an example that further illustrates an optimal location for deploying a machine for a particular entity with a particular set of edge nodes that need to access the machine. In this example, there are eight PCDs 4410-4426 that are candidate PCDs in which the machine can be deployed for access by two machines in two edge nodes 4402 and 4404. Also, in this example, it is assumed that at least one MFN 4130 can be deployed in each PCD to allow the data message flows to travel between the machines at the edge nodes and the deployed machine.

FIG. 44 also displays connection links between different pairs of PCDs and the cost of each link next to the link. In some embodiments, the cost of each connection link between two PCDs is derived from the network connection measurement that the measurement agents in these two PCDs generate for quantifying the quality of the network connection between the two PCDs. For example, the cost of 3 between PCDs 4422 and 4424 signifies that the network connection between these two PCDs is much worse than the cost of 1 between PCDs 4410 and 4412.

For this example, the deployment-location identifier 4300 would explore various paths for each edge node 4402 or 4402 to one of the PCDs. The deployment-location identifier then identified the PCD that results in the lowest cost sum of the two paths from the two edge nodes. In FIG. 44, this identified PCD is PCD 4412 as the sum of the costs of the path 4440 from edge node 4402 and the path 4445 from edge node 4404 is the smallest overall cost of any other pair of paths to any other PCD from the edge nodes 4402 and 4404. The overall costs for all path pairs are listed in Table 1 below:

TABLE 1

Candidate PCD
Cost From 4402
Cost From 4404
Total

4410
1
3
4

4416
2
4
6

4422
2
4
6

4412
2
2
4

4418
3
3
6

4414
5
1
6

4420
5
1
6

4424
5
1
6

In this example, PCDs 4410 and 4412 have the same overall cost as indicated in Table 1, but the PCD 4412 is selected based on other criteria (e.g., based on cost, based on physical proximity to both edge nodes 4402 and 4404, etc.).

In the example illustrated in FIG. 44, each edge node is treated the same as the other edge node. In practice, one edge node might need to access the deployed machine much more frequently than the other edge node. To facilitate this, some embodiments use weights to differentiate the access cost of the different edge nodes. For instance, if a first edge node will have 80% of access while the second edge node has 20% of access, some embodiments will multiple the path cost of the first edge node by 0.8 while multiplying the path cost of the second edge node by 0.2, before adding the resulting path cost values.

After identifying an optimal PCD or PCD group for deploying the resource set, the process 4225 provides the identity of the optimal PCD or PCD group to the server that called the process. This resource can then be deployed at the identified PCD/PCD group (e.g., deployed and configured by a compute manager/controller). After providing the optimal location, the process 4200 ends.

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.

While the above discussion primarily refers to microprocessor or multi-core processors that execute software, some embodiments are performed by one or more integrated circuits, such as application specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs). In some embodiments, such integrated circuits execute instructions that are stored on the circuit itself.

As used in this specification, the terms “computer”, “server”, “processor”, and “memory” all refer to electronic or other technological devices. These terms exclude people or groups of people. For the purposes of the specification, the terms display or displaying means displaying on an electronic device. As used in this specification, the terms “computer readable medium,” “computer readable media,” and “machine readable medium” are entirely restricted to tangible, physical objects that store information in a form that is readable by a computer. These terms exclude any wireless signals, wired download signals, and any other ephemeral or transitory signals.

FIG. 45 conceptually illustrates a computer system 4500 with which some embodiments of the invention are implemented. The computer system 4500 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 4500 includes a bus 4505, processing unit(s) 4510, a system memory 4525, a read-only memory 4530, a permanent storage device 4535, input devices 4540, and output devices 4545.

The bus 4505 collectively represents all system, peripheral, and chipset buses that communicatively connect the numerous internal devices of the computer system 4500. For instance, the bus 4505 communicatively connects the processing unit(s) 4510 with the read-only memory 4530, the system memory 4525, and the permanent storage device 4535.

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

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 4535, the system memory 4525 is a read-and-write memory device. However, unlike storage device 4535, the system memory is a volatile read-and-write memory, such a random access memory. The system memory stores some of the instructions and data that the processor needs at runtime. In some embodiments, the invention's processes are stored in the system memory 4525, the permanent storage device 4535, and/or the read-only memory 4530. From these various memory units, the processing unit(s) 4510 retrieve instructions to execute and data to process in order to execute the processes of some embodiments.

The bus 4505 also connects to the input and output devices 4540 and 4545. The input devices enable the user to communicate information and select commands to the computer system. The input devices 4540 include alphanumeric keyboards and pointing devices (also called “cursor control devices”). The output devices 4545 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 a touchscreen that function as both input and output devices.

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

Some embodiments include electronic components, such as microprocessors, storage and memory that store computer program instructions in a machine-readable or computer-readable medium (alternatively referred to as computer-readable storage media, machine-readable media, or machine-readable storage media). Some examples of such computer-readable media include RAM, ROM, read-only compact discs (CD-ROM), recordable compact discs (CD-R), rewritable compact discs (CD-RW), read-only digital versatile discs (e.g., DVD-ROM, dual-layer DVD-ROM), a variety of recordable/rewritable DVDs (e.g., DVD-RAM, DVD-RW, DVD+RW, etc.), flash memory (e.g., SD cards, mini-SD cards, micro-SD cards, etc.), magnetic and/or solid state hard drives, read-only and recordable Blu-Ray® discs, ultra-density optical discs, any other optical or magnetic media, and floppy disks. The computer-readable media may store a computer program that is executable by at least one processing unit and includes sets of instructions for performing various operations. Examples of computer programs or computer code include machine code, such as is produced by a compiler, and files including higher-level code that are executed by a computer, an electronic component, or a microprocessor using an interpreter.

While the 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, several of the above-described examples illustrate virtual corporate WANs of corporate tenants of a virtual network provider. One of ordinary skill will realize that in some embodiments, the virtual network provider deploys virtual networks over several public cloud datacenters of one or more public cloud providers for non-corporate tenants (e.g., for schools, colleges, universities, non-profit entities, etc.). These virtual networks are virtual WANs that connect multiple compute endpoints (e.g., offices, datacenters, computers and devices of remote users, etc.) of the non-corporate entities.

Several embodiments described above include various pieces of data in the overlay encapsulation headers. One of ordinary skill will realize that other embodiments might not use the encapsulation headers to relay all of this data. For instance, instead of including the tenant identifier in the overlay encapsulation header, other embodiments derive the tenant identifier from the addresses of the CFEs that forward the data messages, e.g., in some embodiments in which different tenants have their own MFNs deployed in the public clouds, the tenant identity is associated with the MFN's that process the tenant messages.

Also, several figures conceptually illustrate processes of some embodiments of the invention. In other embodiments, the specific operations of these processes may not be performed in the exact order shown and described in these figures. The specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments. For instance, for an entity, some embodiments deploy some or all of the MFNs in PCDs/PCD groups before paths are generated for the entity, even though some of the above-described figures illustrate the deployment of the MFNs after the path searches. Furthermore, the process could be implemented using several sub-processes, or as part of a larger macro process.

Several embodiments described above allow a dedicated virtual network that is deployed for one entity to use one or more shared MFNs when a portion of the entity's dedicated virtual network (e.g., one or more dedicated MFNs of the entity) appears congested or is expected to be congested. Other embodiments deal with such congestions differently. For instance, some embodiments deploy additional dedicated MFNs (i.e., redundant MFNs) to portions of the dedicated virtual network that are congested or expected to be congested. Some of these embodiments then configure forwarding elements (e.g., frontend load balancers) in the PCDs, edge nodes at MMCNs, and other dedicated MFNs to distribute load among a cluster of duplicate (e.g., redundant) MFNs. 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 of providing recommendations regarding a virtual network of an entity that is defined over two or more public cloud datacenters, the method comprising: receiving, from an entity, identities of a set of public cloud datacenters to define the virtual network for the entity;deploying and configuring a set of forwarding elements operating in the set of public cloud datacenters to implement the virtual network for the entity;monitoring operation of the virtual network to identify at least one particular public cloud datacenter to remove from the set of public cloud datacenters;providing a recommendation to remove the particular public cloud datacenter from the set of public cloud datacenters in order to improve a performance metric of the virtual network.
2. The method of claim 1, wherein monitoring operation of the virtual network comprises: collecting statistics regarding data message flows that traverse through the forwarding elements in the set of forwarding elements;using the statistics to identify a forwarding element in the particular public cloud datacenter that is being used less than a threshold amount;based on the identification, determining that the forwarding element should be removed from the first set of forwarding elements that are deployed and configured for the entity.
3. The method of claim 1 further comprising: when the entity accepts the recommendation, terminating operation of the particular forwarding element in the particular public cloud datacenter.
4. The method of claim 3, wherein the particular forwarding element is a particular machine instance deployed on a host computer in the particular public cloud datacenter and configured to perform forwarding element operations, andterminating the operation of the particular forwarding element comprises using an API of the particular public cloud datacenter to shutdown the particular machine instance.
5. The method of claim 1, wherein configuring the set of forwarding elements before the monitoring comprises performing a first set of path searches to identify a first set of paths through the set of forwarding elements and using the identified first set of paths to configure the set of forwarding elements to implement the virtual network.
6. The method of claim 5 further comprising when the entity accepts the recommendation performing a second set of paths searches to identify a second set of paths through a modified set of forwarding elements without the particular forwarding element to implement the virtual network, and configuring the modified set of forwarding elements to implement the virtual network based on the second set of paths.
7. The method of claim 1, wherein the forwarding elements comprise routers and configuring the forwarding elements comprises providing routing records to the routers based on the identified paths.
8. The method of claim 7, wherein the routing records are next hop records.
9. The method of claim 1, wherein the forwarding elements comprise forwarding elements implemented as machines that execute on host computers in the public cloud datacenters, at least one host computer executing at least one machine instance of at least one tenant of a public cloud datacenter different than the entity.
10. The method of claim 1, wherein the performance metric is a cost value.
11. The method of claim 10, wherein providing the recommendation comprises providing an improved cost value along with an adjusted operational metric value that is expected for the virtual network if the recommendation is accepted and the particular public cloud datacenter is removed from the set of public cloud datacenters that the virtual network spans.
12. The method of claim 1, wherein the set of public cloud datacenters comprises public cloud datacenters operated by different public cloud providers.
13. The method of claim 1, wherein the virtual network connects a set of machines of the entity that comprise machines outside of the set of public cloud datacenters and that include mobile machines, office machines or private datacenter machines of the entity.
14. A non-transitory machine readable medium storing a program for providing recommendations regarding a virtual network of an entity that is defined over a set of two or more public cloud datacenters, the program for execution by at least one processing unit, the program comprising sets of instructions for: identifying a set of public cloud datacenters specified by the entity to define the virtual network for the entity;configuring a set of forwarding elements deployed in the set of public cloud datacenters to implement the virtual network for the entity;monitoring operation of the virtual network to identify at least one particular public cloud datacenter to remove from the set of public cloud datacenters;providing a recommendation to remove the particular public cloud datacenter from the set of public cloud datacenters in order to improve a performance metric of the virtual network.
15. The non-transitory machine readable medium of claim 14, wherein the set of instructions for monitoring operation of the virtual network comprises sets of instructions for: collecting statistics regarding data message flows that traverse through the forwarding elements in the set of forwarding elements;using the statistics to identify a forwarding element in the particular public cloud datacenter that is being used less than a threshold amount;based on the identification, determining that the forwarding element should be removed from the first set of forwarding elements that are deployed and configured for the entity.
16. The non-transitory machine readable medium of claim 14, wherein the program further comprises sets of instructions for when the entity accepts the recommendation, terminating operation of the particular forwarding element in the particular public cloud datacenter.
17. The non-transitory machine readable medium of claim 16, wherein the particular forwarding element is a particular machine instance deployed on a host computer in the particular public cloud datacenter and configured to perform forwarding element operations, and the set of instructions for terminating the operation of the particular forwarding element comprises a set of instructions for using an API of the particular public cloud datacenter to shutdown the particular machine instance.
18. The non-transitory machine readable medium of claim 14, wherein the set of instructions for configuring the set of forwarding elements before the monitoring comprises a set of instructions for performing a first set of path searches to identify a first set of paths through the set of forwarding elements and using the identified first set of paths to configure the set of forwarding elements to implement the virtual network.
19. The non-transitory machine readable medium of claim 18, wherein the program further comprises a set of instructions for performing a second set of paths searches when the entity accepts the recommendation, the second path search to identify a second set of paths through a modified set of forwarding elements without the particular forwarding element to implement the virtual network, and configuring the modified set of forwarding elements to implement the virtual network based on the second set of paths.
20. The non-transitory machine readable medium of claim 14, wherein the forwarding elements comprise routers and configuring the forwarding elements comprises providing routing records to the routers based on the identified paths.

CLAIM OF BENEFIT TO PRIOR APPLICATIONS

This application is a continuation application of U.S. patent application Ser. No. 18/102,687, filed Jan. 28, 2023, now published as U.S. Patent Publication 2023/0179543. U.S. patent application Ser. No. 18/102,687 is a continuation application of U.S. patent application Ser. No. 17/542,413, filed Dec. 4, 2021, now issued as U.S. Pat. No. 11,606,314. U.S. patent application Ser. No. 17/542,413 is a continuation application of U.S. patent application Ser. No. 16/662,427, filed Oct. 24, 2019, now issued as U.S. Pat. No. 11,212,238. U.S. patent application Ser. No. 16/662,427 claims the benefit of U.S. Provisional Patent Application 62/892,473, filed Aug. 27, 2019. U.S. patent application Ser. No. 18/102,687, now published as U.S. Patent Publication 2023/0179543, U.S. patent application Ser. No. 17/542,413, now issued as U.S. Pat. No. 11,606,314, U.S. patent application Ser. No. 16/662,427, now issued as U.S. Pat. No. 11,212,238, are incorporated herein by reference.

US Referenced Citations (1019)

Number	Name	Date	Kind
5652751	Sharony	Jul 1997	A
5909553	Campbell et al.	Jun 1999	A
6154465	Pickett	Nov 2000	A
6157648	Voit et al.	Dec 2000	A
6201810	Masuda et al.	Mar 2001	B1
6363378	Conklin et al.	Mar 2002	B1
6445682	Weitz	Sep 2002	B1
6744775	Beshai et al.	Jun 2004	B1
6976087	Westfall et al.	Dec 2005	B1
7003481	Banka et al.	Feb 2006	B2
7280476	Anderson	Oct 2007	B2
7313629	Nucci et al.	Dec 2007	B1
7320017	Kurapati et al.	Jan 2008	B1
7373660	Guichard et al.	May 2008	B1
7581022	Griffin et al.	Aug 2009	B1
7680925	Sathyanarayana et al.	Mar 2010	B2
7681236	Tamura et al.	Mar 2010	B2
7751409	Carolan	Jul 2010	B1
7962458	Holenstein et al.	Jun 2011	B2
8094575	Vadlakonda et al.	Jan 2012	B1
8094659	Arad	Jan 2012	B1
8111692	Ray	Feb 2012	B2
8141156	Mao et al.	Mar 2012	B1
8224971	Miller et al.	Jul 2012	B1
8228928	Parandekar et al.	Jul 2012	B2
8243589	Trost et al.	Aug 2012	B1
8259566	Chen et al.	Sep 2012	B2
8274891	Averi et al.	Sep 2012	B2
8301749	Finklestein et al.	Oct 2012	B1
8385227	Downey	Feb 2013	B1
8516129	Skene	Aug 2013	B1
8566452	Goodwin, III et al.	Oct 2013	B1
8588066	Goel et al.	Nov 2013	B2
8630291	Shaffer et al.	Jan 2014	B2
8661295	Khanna et al.	Feb 2014	B1
8724456	Hong et al.	May 2014	B1
8724503	Johnsson et al.	May 2014	B2
8745177	Kazerani et al.	Jun 2014	B1
8797874	Yu et al.	Aug 2014	B2
8799504	Capone et al.	Aug 2014	B2
8804745	Sinn	Aug 2014	B1
8806482	Nagargadde et al.	Aug 2014	B1
8855071	Sankaran et al.	Oct 2014	B1
8856339	Mestery et al.	Oct 2014	B2
8964548	Keralapura et al.	Feb 2015	B1
8989199	Sella et al.	Mar 2015	B1
9009217	Nagargadde et al.	Apr 2015	B1
9015299	Shah	Apr 2015	B1
9055000	Ghosh et al.	Jun 2015	B1
9060025	Xu	Jun 2015	B2
9071607	Twitchell, Jr.	Jun 2015	B2
9075771	Gawali et al.	Jul 2015	B1
9100329	Jiang et al.	Aug 2015	B1
9135037	Petrescu-Prahova et al.	Sep 2015	B1
9137334	Zhou	Sep 2015	B2
9154327	Marino et al.	Oct 2015	B1
9203764	Shirazipour et al.	Dec 2015	B2
9225591	Beheshti-Zavareh et al.	Dec 2015	B2
9306949	Richard et al.	Apr 2016	B1
9323561	Ayala et al.	Apr 2016	B2
9336040	Dong et al.	May 2016	B2
9354983	Yenamandra et al.	May 2016	B1
9356943	Lopilato et al.	May 2016	B1
9379981	Zhou et al.	Jun 2016	B1
9413724	Xu	Aug 2016	B2
9419878	Asiao et al.	Aug 2016	B2
9432245	Sorenson, III et al.	Aug 2016	B1
9438566	Zhang et al.	Sep 2016	B2
9450817	Bahadur et al.	Sep 2016	B1
9450852	Chen et al.	Sep 2016	B1
9462010	Stevenson	Oct 2016	B1
9467478	Khan et al.	Oct 2016	B1
9485163	Fries et al.	Nov 2016	B1
9521067	Michael et al.	Dec 2016	B2
9525564	Lee	Dec 2016	B2
9542219	Bryant et al.	Jan 2017	B1
9559951	Sajassi et al.	Jan 2017	B1
9563423	Pittman	Feb 2017	B1
9602389	Maveli et al.	Mar 2017	B1
9608917	Anderson et al.	Mar 2017	B1
9608962	Chang	Mar 2017	B1
9614748	Battersby et al.	Apr 2017	B1
9621460	Mehta et al.	Apr 2017	B2
9641551	Kariyanahalli	May 2017	B1
9648547	Hart et al.	May 2017	B1
9665432	Kruse et al.	May 2017	B2
9686127	Ramachandran et al.	Jun 2017	B2
9692714	Nair et al.	Jun 2017	B1
9715401	Devine et al.	Jul 2017	B2
9717021	Hughes et al.	Jul 2017	B2
9722815	Mukundan et al.	Aug 2017	B2
9747249	Cherian et al.	Aug 2017	B2
9755965	Yadav et al.	Sep 2017	B1
9787559	Schroeder	Oct 2017	B1
9807004	Koley et al.	Oct 2017	B2
9819540	Bahadur et al.	Nov 2017	B1
9819565	Djukic et al.	Nov 2017	B2
9825822	Holland	Nov 2017	B1
9825911	Brandwine	Nov 2017	B1
9825992	Xu	Nov 2017	B2
9832128	Ashner et al.	Nov 2017	B1
9832205	Santhi et al.	Nov 2017	B2
9875355	Williams	Jan 2018	B1
9906401	Rao	Feb 2018	B1
9923826	Murgia	Mar 2018	B2
9930011	Clemons, Jr. et al.	Mar 2018	B1
9935829	Miller et al.	Apr 2018	B1
9942787	Tillotson	Apr 2018	B1
9996370	Khafizov et al.	Jun 2018	B1
10038601	Becker et al.	Jul 2018	B1
10057183	Salle et al.	Aug 2018	B2
10057294	Xu	Aug 2018	B2
10116593	Sinn et al.	Oct 2018	B1
10135789	Mayya et al.	Nov 2018	B2
10142226	Wu et al.	Nov 2018	B1
10178032	Freitas	Jan 2019	B1
10178037	Appleby et al.	Jan 2019	B2
10187289	Chen et al.	Jan 2019	B1
10200264	Menon et al.	Feb 2019	B2
10229017	Zou et al.	Mar 2019	B1
10237123	Dubey et al.	Mar 2019	B2
10250498	Bales et al.	Apr 2019	B1
10263832	Ghosh	Apr 2019	B1
10320664	Nainar et al.	Jun 2019	B2
10320691	Matthews et al.	Jun 2019	B1
10326830	Singh	Jun 2019	B1
10348767	Lee et al.	Jul 2019	B1
10355989	Panchal et al.	Jul 2019	B1
10425382	Mayya et al.	Sep 2019	B2
10454708	Mibu	Oct 2019	B2
10454714	Mayya et al.	Oct 2019	B2
10461993	Turabi et al.	Oct 2019	B2
10498652	Mayya et al.	Dec 2019	B2
10511546	Singarayan et al.	Dec 2019	B2
10523539	Mayya et al.	Dec 2019	B2
10550093	Ojima et al.	Feb 2020	B2
10554538	Spohn et al.	Feb 2020	B2
10560431	Chen et al.	Feb 2020	B1
10565464	Han et al.	Feb 2020	B2
10567519	Mukhopadhyaya et al.	Feb 2020	B1
10574482	Oréet al.	Feb 2020	B2
10574528	Mayya et al.	Feb 2020	B2
10594516	Cidon et al.	Mar 2020	B2
10594591	Houjyo et al.	Mar 2020	B2
10594659	El-Moussa et al.	Mar 2020	B2
10608844	Cidon et al.	Mar 2020	B2
10630505	Rubenstein et al.	Apr 2020	B2
10637889	Ermagan et al.	Apr 2020	B2
10666460	Cidon et al.	May 2020	B2
10666497	Tahhan et al.	May 2020	B2
10686625	Cidon et al.	Jun 2020	B2
10693739	Naseri et al.	Jun 2020	B1
10708144	Mohan et al.	Jul 2020	B2
10715427	Raj et al.	Jul 2020	B2
10749711	Mukundan et al.	Aug 2020	B2
10778466	Cidon et al.	Sep 2020	B2
10778528	Mayya et al.	Sep 2020	B2
10778557	Ganichev et al.	Sep 2020	B2
10805114	Cidon et al.	Oct 2020	B2
10805272	Mayya et al.	Oct 2020	B2
10819564	Turabi et al.	Oct 2020	B2
10826775	Moreno et al.	Nov 2020	B1
10841131	Cidon et al.	Nov 2020	B2
10911374	Kumar et al.	Feb 2021	B1
10938693	Mayya et al.	Mar 2021	B2
10951529	Duan et al.	Mar 2021	B2
10958479	Cidon et al.	Mar 2021	B2
10959098	Cidon et al.	Mar 2021	B2
10992558	Silva et al.	Apr 2021	B1
10992568	Michael et al.	Apr 2021	B2
10999100	Cidon et al.	May 2021	B2
10999137	Cidon et al.	May 2021	B2
10999165	Cidon et al.	May 2021	B2
10999197	Hooda et al.	May 2021	B2
11005684	Cidon	May 2021	B2
11018995	Cidon et al.	May 2021	B2
11044190	Ramaswamy et al.	Jun 2021	B2
11050588	Mayya et al.	Jun 2021	B2
11050644	Hegde et al.	Jun 2021	B2
11071005	Shen et al.	Jul 2021	B2
11089111	Markuze et al.	Aug 2021	B2
11095612	Oswal et al.	Aug 2021	B1
11102032	Cidon et al.	Aug 2021	B2
11108595	Knutsen et al.	Aug 2021	B2
11108851	Kurmala et al.	Aug 2021	B1
11115347	Gupta et al.	Sep 2021	B2
11115426	Pazhyannur et al.	Sep 2021	B1
11115480	Markuze et al.	Sep 2021	B2
11121962	Michael et al.	Sep 2021	B2
11121985	Cidon et al.	Sep 2021	B2
11128492	Sethi et al.	Sep 2021	B2
11146632	Rubenstein	Oct 2021	B2
11153230	Cidon et al.	Oct 2021	B2
11171885	Cidon et al.	Nov 2021	B2
11212140	Mukundan et al.	Dec 2021	B2
11212238	Cidon et al.	Dec 2021	B2
11223514	Mayya et al.	Jan 2022	B2
11245641	Ramaswamy et al.	Feb 2022	B2
11252079	Michael et al.	Feb 2022	B2
11252105	Cidon et al.	Feb 2022	B2
11252106	Cidon et al.	Feb 2022	B2
11258728	Cidon et al.	Feb 2022	B2
11310170	Cidon et al.	Apr 2022	B2
11323307	Mayya et al.	May 2022	B2
11349722	Mayya et al.	May 2022	B2
11363124	Markuze et al.	Jun 2022	B2
11374904	Mayya et al.	Jun 2022	B2
11375005	Rolando et al.	Jun 2022	B1
11381474	Kumar et al.	Jul 2022	B1
11381499	Ramaswamy et al.	Jul 2022	B1
11388086	Ramaswamy et al.	Jul 2022	B1
11394640	Ramaswamy et al.	Jul 2022	B2
11418997	Devadoss et al.	Aug 2022	B2
11438789	Devadoss et al.	Sep 2022	B2
11444865	Ramaswamy et al.	Sep 2022	B2
11444872	Mayya et al.	Sep 2022	B2
11477127	Ramaswamy et al.	Oct 2022	B2
11489720	Kempanna et al.	Nov 2022	B1
11489783	Ramaswamy et al.	Nov 2022	B2
11509571	Ramaswamy et al.	Nov 2022	B1
11516049	Cidon et al.	Nov 2022	B2
11522780	Wallace et al.	Dec 2022	B1
11526434	Brooker et al.	Dec 2022	B1
11533248	Mayya et al.	Dec 2022	B2
11552874	Pragada et al.	Jan 2023	B1
11575591	Ramaswamy et al.	Feb 2023	B2
11575600	Markuze et al.	Feb 2023	B2
11582144	Ramaswamy et al.	Feb 2023	B2
11582298	Hood et al.	Feb 2023	B2
11601356	Gandhi et al.	Mar 2023	B2
11606225	Cidon et al.	Mar 2023	B2
11606286	Michael et al.	Mar 2023	B2
11606314	Cidon et al.	Mar 2023	B2
11606712	Devadoss et al.	Mar 2023	B2
11611507	Ramaswamy et al.	Mar 2023	B2
11637768	Ramaswamy et al.	Apr 2023	B2
11677720	Mayya et al.	Jun 2023	B2
11689959	Devadoss et al.	Jun 2023	B2
11700196	Michael et al.	Jul 2023	B2
11706126	Silva et al.	Jul 2023	B2
11706127	Michael et al.	Jul 2023	B2
11709710	Markuze et al.	Jul 2023	B2
11716286	Ramaswamy et al.	Aug 2023	B2
11722925	Devadoss et al.	Aug 2023	B2
11729065	Ramaswamy et al.	Aug 2023	B2
20020049687	Helsper et al.	Apr 2002	A1
20020075542	Kumar et al.	Jun 2002	A1
20020085488	Kobayashi	Jul 2002	A1
20020087716	Mustafa	Jul 2002	A1
20020152306	Tuck	Oct 2002	A1
20020186682	Kawano et al.	Dec 2002	A1
20020198840	Banka et al.	Dec 2002	A1
20030050061	Wu et al.	Mar 2003	A1
20030061269	Hathaway et al.	Mar 2003	A1
20030088697	Matsuhira	May 2003	A1
20030112766	Riedel et al.	Jun 2003	A1
20030112808	Solomon	Jun 2003	A1
20030126468	Markham	Jul 2003	A1
20030161313	Jinmei et al.	Aug 2003	A1
20030189919	Gupta et al.	Oct 2003	A1
20030202506	Perkins et al.	Oct 2003	A1
20030219030	Gubbi	Nov 2003	A1
20040059831	Chu et al.	Mar 2004	A1
20040068668	Lor et al.	Apr 2004	A1
20040165601	Liu et al.	Aug 2004	A1
20040224771	Chen et al.	Nov 2004	A1
20050078690	DeLangis	Apr 2005	A1
20050149604	Navada	Jul 2005	A1
20050154790	Nagata et al.	Jul 2005	A1
20050172161	Cruz et al.	Aug 2005	A1
20050195754	Nosella	Sep 2005	A1
20050210479	Andjelic	Sep 2005	A1
20050265255	Kodialam et al.	Dec 2005	A1
20060002291	Alicherry et al.	Jan 2006	A1
20060034335	Karaoguz et al.	Feb 2006	A1
20060114838	Mandavilli et al.	Jun 2006	A1
20060171365	Borella	Aug 2006	A1
20060182034	Klinker et al.	Aug 2006	A1
20060182035	Vasseur	Aug 2006	A1
20060193247	Naseh et al.	Aug 2006	A1
20060193252	Naseh et al.	Aug 2006	A1
20060195605	Sundarrajan et al.	Aug 2006	A1
20060245414	Susai et al.	Nov 2006	A1
20070050594	Augsburg et al.	Mar 2007	A1
20070064604	Chen et al.	Mar 2007	A1
20070064702	Bates et al.	Mar 2007	A1
20070083727	Johnston et al.	Apr 2007	A1
20070091794	Filsfils et al.	Apr 2007	A1
20070103548	Carter	May 2007	A1
20070115812	Hughes	May 2007	A1
20070121486	Guichard et al.	May 2007	A1
20070130325	Lesser	Jun 2007	A1
20070162619	Aloni et al.	Jul 2007	A1
20070162639	Chu et al.	Jul 2007	A1
20070177511	Das et al.	Aug 2007	A1
20070195797	Patel et al.	Aug 2007	A1
20070237081	Kodialam et al.	Oct 2007	A1
20070260746	Mirtorabi et al.	Nov 2007	A1
20070268882	Breslau et al.	Nov 2007	A1
20080002670	Bugenhagen et al.	Jan 2008	A1
20080049621	McGuire et al.	Feb 2008	A1
20080055241	Goldenberg et al.	Mar 2008	A1
20080080509	Khanna et al.	Apr 2008	A1
20080095187	Jung et al.	Apr 2008	A1
20080117930	Chakareski et al.	May 2008	A1
20080144532	Chamarajanagar et al.	Jun 2008	A1
20080168086	Miller et al.	Jul 2008	A1
20080175150	Bolt et al.	Jul 2008	A1
20080181116	Kavanaugh et al.	Jul 2008	A1
20080219276	Shah	Sep 2008	A1
20080240121	Xiong et al.	Oct 2008	A1
20080263218	Beerends et al.	Oct 2008	A1
20090013210	McIntosh et al.	Jan 2009	A1
20090028092	Rothschild	Jan 2009	A1
20090125617	Klessig et al.	May 2009	A1
20090141642	Sun	Jun 2009	A1
20090154463	Hines et al.	Jun 2009	A1
20090182874	Morford et al.	Jul 2009	A1
20090247204	Sennett et al.	Oct 2009	A1
20090268605	Campbell et al.	Oct 2009	A1
20090274045	Meier et al.	Nov 2009	A1
20090276657	Wetmore et al.	Nov 2009	A1
20090303880	Maltz et al.	Dec 2009	A1
20100008361	Guichard et al.	Jan 2010	A1
20100017802	Lojewski	Jan 2010	A1
20100046532	Okita	Feb 2010	A1
20100061379	Parandekar et al.	Mar 2010	A1
20100080129	Strahan et al.	Apr 2010	A1
20100088440	Banks et al.	Apr 2010	A1
20100091782	Hiscock	Apr 2010	A1
20100091823	Retana et al.	Apr 2010	A1
20100107162	Edwards et al.	Apr 2010	A1
20100118727	Draves et al.	May 2010	A1
20100118886	Saavedra	May 2010	A1
20100128600	Srinivasmurthy et al.	May 2010	A1
20100165985	Sharma et al.	Jul 2010	A1
20100191884	Holenstein et al.	Jul 2010	A1
20100223621	Joshi et al.	Sep 2010	A1
20100226246	Proulx	Sep 2010	A1
20100290422	Haigh et al.	Nov 2010	A1
20100309841	Conte	Dec 2010	A1
20100309912	Mehta et al.	Dec 2010	A1
20100322255	Hao et al.	Dec 2010	A1
20100332657	Elyashev et al.	Dec 2010	A1
20110001604	Ludlow et al.	Jan 2011	A1
20110007752	Silva et al.	Jan 2011	A1
20110032939	Nozaki et al.	Feb 2011	A1
20110035187	DeJori et al.	Feb 2011	A1
20110040814	Higgins	Feb 2011	A1
20110075674	Li et al.	Mar 2011	A1
20110078783	Duan et al.	Mar 2011	A1
20110107139	Middlecamp et al.	May 2011	A1
20110110370	Moreno et al.	May 2011	A1
20110141877	Xu et al.	Jun 2011	A1
20110142041	Imai	Jun 2011	A1
20110153909	Dong	Jun 2011	A1
20110235509	Szymanski	Sep 2011	A1
20110255397	Kadakia et al.	Oct 2011	A1
20110302663	Prodan et al.	Dec 2011	A1
20120008630	Ould-Brahim	Jan 2012	A1
20120027013	Napierala	Feb 2012	A1
20120039309	Evans et al.	Feb 2012	A1
20120099601	Haddad et al.	Apr 2012	A1
20120136697	Peles et al.	May 2012	A1
20120140935	Kruglick	Jun 2012	A1
20120157068	Eichen et al.	Jun 2012	A1
20120173694	Yan et al.	Jul 2012	A1
20120173919	Patel et al.	Jul 2012	A1
20120182940	Taleb et al.	Jul 2012	A1
20120221955	Raleigh et al.	Aug 2012	A1
20120227093	Shatzkamer et al.	Sep 2012	A1
20120240185	Kapoor et al.	Sep 2012	A1
20120250682	Vincent et al.	Oct 2012	A1
20120250686	Vincent et al.	Oct 2012	A1
20120266026	Chikkalingaiah et al.	Oct 2012	A1
20120281706	Agarwal et al.	Nov 2012	A1
20120287818	Corti et al.	Nov 2012	A1
20120300615	Kempf et al.	Nov 2012	A1
20120307659	Yamada	Dec 2012	A1
20120317270	Vrbaski et al.	Dec 2012	A1
20120317291	Wolfe	Dec 2012	A1
20130007505	Spear	Jan 2013	A1
20130019005	Hui et al.	Jan 2013	A1
20130021968	Reznik et al.	Jan 2013	A1
20130044764	Casado et al.	Feb 2013	A1
20130051237	Ong	Feb 2013	A1
20130051399	Zhang et al.	Feb 2013	A1
20130054763	Merwe et al.	Feb 2013	A1
20130086267	Gelenbe et al.	Apr 2013	A1
20130097304	Asthana et al.	Apr 2013	A1
20130103729	Cooney et al.	Apr 2013	A1
20130103834	Dzerve et al.	Apr 2013	A1
20130117530	Kim et al.	May 2013	A1
20130124718	Griffith et al.	May 2013	A1
20130124911	Griffith et al.	May 2013	A1
20130124912	Griffith et al.	May 2013	A1
20130128889	Mathur et al.	May 2013	A1
20130142201	Kim et al.	Jun 2013	A1
20130170354	Takashima et al.	Jul 2013	A1
20130173768	Kundu et al.	Jul 2013	A1
20130173788	Song	Jul 2013	A1
20130182712	Aguayo et al.	Jul 2013	A1
20130185446	Zeng et al.	Jul 2013	A1
20130185729	Vasic et al.	Jul 2013	A1
20130191688	Agarwal et al.	Jul 2013	A1
20130223226	Narayanan et al.	Aug 2013	A1
20130223454	Dunbar et al.	Aug 2013	A1
20130235870	Tripathi et al.	Sep 2013	A1
20130238782	Zhao et al.	Sep 2013	A1
20130242718	Zhang	Sep 2013	A1
20130254599	Katkar et al.	Sep 2013	A1
20130258839	Wang et al.	Oct 2013	A1
20130258847	Zhang et al.	Oct 2013	A1
20130266015	Qu et al.	Oct 2013	A1
20130266019	Qu et al.	Oct 2013	A1
20130283364	Chang et al.	Oct 2013	A1
20130286846	Atlas et al.	Oct 2013	A1
20130297611	Moritz et al.	Nov 2013	A1
20130297770	Zhang	Nov 2013	A1
20130301469	Suga	Nov 2013	A1
20130301642	Radhakrishnan et al.	Nov 2013	A1
20130308444	Sem-Jacobsen et al.	Nov 2013	A1
20130315242	Wang et al.	Nov 2013	A1
20130315243	Huang et al.	Nov 2013	A1
20130329548	Nakil et al.	Dec 2013	A1
20130329601	Yin et al.	Dec 2013	A1
20130329734	Chesla et al.	Dec 2013	A1
20130346470	Obstfeld et al.	Dec 2013	A1
20140016464	Shirazipour et al.	Jan 2014	A1
20140019604	Twitchell, Jr.	Jan 2014	A1
20140019750	Dodgson et al.	Jan 2014	A1
20140040975	Raleigh et al.	Feb 2014	A1
20140064283	Balus et al.	Mar 2014	A1
20140071832	Johnsson et al.	Mar 2014	A1
20140092907	Sridhar et al.	Apr 2014	A1
20140108665	Arora et al.	Apr 2014	A1
20140112171	Pasdar	Apr 2014	A1
20140115584	Mudigonda et al.	Apr 2014	A1
20140122559	Branson et al.	May 2014	A1
20140123135	Huang et al.	May 2014	A1
20140126418	Brendel et al.	May 2014	A1
20140156818	Hunt	Jun 2014	A1
20140156823	Liu et al.	Jun 2014	A1
20140157363	Banerjee	Jun 2014	A1
20140160935	Zecharia et al.	Jun 2014	A1
20140164560	Ko et al.	Jun 2014	A1
20140164617	Jalan et al.	Jun 2014	A1
20140164718	Schaik et al.	Jun 2014	A1
20140173113	Vemuri et al.	Jun 2014	A1
20140173331	Martin et al.	Jun 2014	A1
20140181824	Saund et al.	Jun 2014	A1
20140189074	Parker	Jul 2014	A1
20140208317	Nakagawa	Jul 2014	A1
20140219135	Li et al.	Aug 2014	A1
20140223507	Xu	Aug 2014	A1
20140229210	Sharifian et al.	Aug 2014	A1
20140244851	Lee	Aug 2014	A1
20140258535	Zhang	Sep 2014	A1
20140269690	Tu	Sep 2014	A1
20140279862	Dietz et al.	Sep 2014	A1
20140280499	Basavaiah et al.	Sep 2014	A1
20140310282	Sprague et al.	Oct 2014	A1
20140317440	Biermayr et al.	Oct 2014	A1
20140321277	Lynn, Jr. et al.	Oct 2014	A1
20140337500	Lee	Nov 2014	A1
20140337674	Ivancic et al.	Nov 2014	A1
20140341109	Cartmell et al.	Nov 2014	A1
20140355441	Jain	Dec 2014	A1
20140365834	Stone et al.	Dec 2014	A1
20140372582	Ghanwani et al.	Dec 2014	A1
20150003240	Drwiega et al.	Jan 2015	A1
20150016249	Mukundan et al.	Jan 2015	A1
20150029864	Raileanu et al.	Jan 2015	A1
20150039744	Niazi et al.	Feb 2015	A1
20150046572	Cheng et al.	Feb 2015	A1
20150052247	Threefoot et al.	Feb 2015	A1
20150052517	Raghu et al.	Feb 2015	A1
20150056960	Egner et al.	Feb 2015	A1
20150058917	Xu	Feb 2015	A1
20150088942	Shah	Mar 2015	A1
20150089628	Lang	Mar 2015	A1
20150092603	Aguayo et al.	Apr 2015	A1
20150096011	Watt	Apr 2015	A1
20150100958	Banavalikar et al.	Apr 2015	A1
20150106809	Reddy et al.	Apr 2015	A1
20150124603	Ketheesan et al.	May 2015	A1
20150134777	Onoue	May 2015	A1
20150139238	Pourzandi et al.	May 2015	A1
20150146539	Mehta et al.	May 2015	A1
20150163152	Li	Jun 2015	A1
20150169340	Haddad et al.	Jun 2015	A1
20150172121	Farkas et al.	Jun 2015	A1
20150172169	DeCusatis et al.	Jun 2015	A1
20150188823	Williams et al.	Jul 2015	A1
20150189009	Bemmel	Jul 2015	A1
20150195178	Bhattacharya et al.	Jul 2015	A1
20150201036	Nishiki et al.	Jul 2015	A1
20150222543	Song	Aug 2015	A1
20150222638	Morley	Aug 2015	A1
20150236945	Michael et al.	Aug 2015	A1
20150236962	Veres et al.	Aug 2015	A1
20150244617	Nakil et al.	Aug 2015	A1
20150249644	Xu	Sep 2015	A1
20150257081	Ramanujan et al.	Sep 2015	A1
20150264055	Budhani et al.	Sep 2015	A1
20150271056	Chunduri et al.	Sep 2015	A1
20150271104	Chikkamath et al.	Sep 2015	A1
20150271303	Neginhal et al.	Sep 2015	A1
20150281004	Kakadia et al.	Oct 2015	A1
20150312142	Barabash et al.	Oct 2015	A1
20150312760	O'Toole	Oct 2015	A1
20150317169	Sinha et al.	Nov 2015	A1
20150326426	Luo et al.	Nov 2015	A1
20150334025	Rader	Nov 2015	A1
20150334696	Gu et al.	Nov 2015	A1
20150341271	Gomez	Nov 2015	A1
20150349978	Wu et al.	Dec 2015	A1
20150350907	Timariu et al.	Dec 2015	A1
20150358232	Chen et al.	Dec 2015	A1
20150358236	Roach et al.	Dec 2015	A1
20150363221	Terayama et al.	Dec 2015	A1
20150363733	Brown	Dec 2015	A1
20150365323	Duminuco et al.	Dec 2015	A1
20150372943	Hasan et al.	Dec 2015	A1
20150372982	Herle et al.	Dec 2015	A1
20150381407	Wang et al.	Dec 2015	A1
20150381462	Choi et al.	Dec 2015	A1
20150381493	Bansal et al.	Dec 2015	A1
20160019317	Pawar et al.	Jan 2016	A1
20160020844	Hart et al.	Jan 2016	A1
20160021597	Hart et al.	Jan 2016	A1
20160035183	Buchholz et al.	Feb 2016	A1
20160036924	Koppolu et al.	Feb 2016	A1
20160036938	Aviles et al.	Feb 2016	A1
20160037434	Gopal et al.	Feb 2016	A1
20160072669	Saavedra	Mar 2016	A1
20160072684	Manuguri et al.	Mar 2016	A1
20160080268	Anand et al.	Mar 2016	A1
20160080502	Yadav et al.	Mar 2016	A1
20160105353	Cociglio	Apr 2016	A1
20160105392	Thakkar et al.	Apr 2016	A1
20160105471	Nunes et al.	Apr 2016	A1
20160105488	Thakkar et al.	Apr 2016	A1
20160117185	Fang et al.	Apr 2016	A1
20160134461	Sampath et al.	May 2016	A1
20160134527	Kwak et al.	May 2016	A1
20160134528	Lin et al.	May 2016	A1
20160134591	Liao et al.	May 2016	A1
20160142373	Ossipov	May 2016	A1
20160147607	Dornemann et al.	May 2016	A1
20160150055	Choi	May 2016	A1
20160164832	Bellagamba et al.	Jun 2016	A1
20160164914	Madhav et al.	Jun 2016	A1
20160173338	Wolting	Jun 2016	A1
20160191363	Haraszti et al.	Jun 2016	A1
20160191374	Singh et al.	Jun 2016	A1
20160192403	Gupta et al.	Jun 2016	A1
20160197834	Luft	Jul 2016	A1
20160197835	Luft	Jul 2016	A1
20160198003	Luft	Jul 2016	A1
20160205071	Cooper et al.	Jul 2016	A1
20160210209	Verkaik et al.	Jul 2016	A1
20160212773	Kanderholm et al.	Jul 2016	A1
20160218947	Hughes et al.	Jul 2016	A1
20160218951	Vasseur et al.	Jul 2016	A1
20160234099	Jiao	Aug 2016	A1
20160234161	Banerjee et al.	Aug 2016	A1
20160255169	Kovvuri et al.	Sep 2016	A1
20160255542	Hughes et al.	Sep 2016	A1
20160261493	Li	Sep 2016	A1
20160261495	Xia et al.	Sep 2016	A1
20160261506	Hegde et al.	Sep 2016	A1
20160261639	Xu	Sep 2016	A1
20160269298	Li et al.	Sep 2016	A1
20160269926	Sundaram	Sep 2016	A1
20160285736	Gu	Sep 2016	A1
20160299775	Madapurath et al.	Oct 2016	A1
20160301471	Kunz et al.	Oct 2016	A1
20160308762	Teng et al.	Oct 2016	A1
20160315912	Mayya et al.	Oct 2016	A1
20160323377	Einkauf et al.	Nov 2016	A1
20160328159	Coddington et al.	Nov 2016	A1
20160330111	Manghirmalani et al.	Nov 2016	A1
20160337202	Ben-Itzhak et al.	Nov 2016	A1
20160352588	Subbarayan et al.	Dec 2016	A1
20160353268	Senarath et al.	Dec 2016	A1
20160359738	Sullenberger et al.	Dec 2016	A1
20160366187	Kamble	Dec 2016	A1
20160371153	Dornemann	Dec 2016	A1
20160378527	Zamir	Dec 2016	A1
20160380886	Blair et al.	Dec 2016	A1
20160380906	Hodique et al.	Dec 2016	A1
20170005986	Bansal et al.	Jan 2017	A1
20170006499	Hampel et al.	Jan 2017	A1
20170012870	Blair et al.	Jan 2017	A1
20170019428	Cohn	Jan 2017	A1
20170024260	Chandrasekaran et al.	Jan 2017	A1
20170026273	Yao et al.	Jan 2017	A1
20170026283	Williams et al.	Jan 2017	A1
20170026355	Mathaiyan et al.	Jan 2017	A1
20170034046	Cai et al.	Feb 2017	A1
20170034052	Chanda et al.	Feb 2017	A1
20170034129	Sawant et al.	Feb 2017	A1
20170048296	Ramalho et al.	Feb 2017	A1
20170053258	Carney et al.	Feb 2017	A1
20170055131	Kong et al.	Feb 2017	A1
20170063674	Maskalik et al.	Mar 2017	A1
20170063782	Jain et al.	Mar 2017	A1
20170063783	Yong et al.	Mar 2017	A1
20170063794	Jain et al.	Mar 2017	A1
20170064005	Lee	Mar 2017	A1
20170075710	Prasad et al.	Mar 2017	A1
20170093625	Pera et al.	Mar 2017	A1
20170097841	Chang et al.	Apr 2017	A1
20170104653	Badea et al.	Apr 2017	A1
20170104755	Arregoces et al.	Apr 2017	A1
20170109212	Gaurav et al.	Apr 2017	A1
20170118067	Vedula	Apr 2017	A1
20170118173	Arramreddy et al.	Apr 2017	A1
20170123939	Maheshwari et al.	May 2017	A1
20170126475	Mahkonen et al.	May 2017	A1
20170126516	Tiagi et al.	May 2017	A1
20170126564	Mayya et al.	May 2017	A1
20170134186	Mukundan et al.	May 2017	A1
20170134520	Abbasi et al.	May 2017	A1
20170139789	Fries et al.	May 2017	A1
20170142000	Cai et al.	May 2017	A1
20170149637	Banikazemi et al.	May 2017	A1
20170155557	Desai et al.	Jun 2017	A1
20170155566	Martinsen et al.	Jun 2017	A1
20170155590	Dillon et al.	Jun 2017	A1
20170163473	Sadana et al.	Jun 2017	A1
20170171024	Anerousis et al.	Jun 2017	A1
20170171310	Gardner	Jun 2017	A1
20170180220	Leckey et al.	Jun 2017	A1
20170181210	Nadella et al.	Jun 2017	A1
20170195161	Ruel et al.	Jul 2017	A1
20170195169	Mills et al.	Jul 2017	A1
20170201568	Hussam et al.	Jul 2017	A1
20170201585	Doraiswamy et al.	Jul 2017	A1
20170207976	Rovner et al.	Jul 2017	A1
20170214545	Cheng et al.	Jul 2017	A1
20170214701	Hasan	Jul 2017	A1
20170223117	Messerli et al.	Aug 2017	A1
20170236060	Ignatyev	Aug 2017	A1
20170237710	Mayya et al.	Aug 2017	A1
20170242784	Heorhiadi et al.	Aug 2017	A1
20170257260	Govindan et al.	Sep 2017	A1
20170257309	Appanna	Sep 2017	A1
20170264496	Ao et al.	Sep 2017	A1
20170279717	Bethers et al.	Sep 2017	A1
20170279741	Elias et al.	Sep 2017	A1
20170279803	Desai et al.	Sep 2017	A1
20170280474	Vesterinen et al.	Sep 2017	A1
20170288987	Pasupathy et al.	Oct 2017	A1
20170289002	Ganguli et al.	Oct 2017	A1
20170289027	Ratnasingham	Oct 2017	A1
20170295264	Touitou et al.	Oct 2017	A1
20170302501	Shi et al.	Oct 2017	A1
20170302565	Ghobadi et al.	Oct 2017	A1
20170310641	Jiang et al.	Oct 2017	A1
20170310691	Vasseur et al.	Oct 2017	A1
20170317945	Guo et al.	Nov 2017	A1
20170317954	Masurekar et al.	Nov 2017	A1
20170317969	Masurekar et al.	Nov 2017	A1
20170317974	Masurekar et al.	Nov 2017	A1
20170324628	Dhanabalan	Nov 2017	A1
20170337086	Zhu et al.	Nov 2017	A1
20170339022	Hegde et al.	Nov 2017	A1
20170339054	Yadav et al.	Nov 2017	A1
20170339070	Chang et al.	Nov 2017	A1
20170346722	Smith et al.	Nov 2017	A1
20170364419	Lo	Dec 2017	A1
20170366445	Nemirovsky et al.	Dec 2017	A1
20170366467	Martin et al.	Dec 2017	A1
20170373950	Szilagyi et al.	Dec 2017	A1
20170374174	Evens et al.	Dec 2017	A1
20180006995	Bickhart et al.	Jan 2018	A1
20180007005	Chanda et al.	Jan 2018	A1
20180007123	Cheng et al.	Jan 2018	A1
20180013636	Seetharamaiah et al.	Jan 2018	A1
20180014051	Phillips et al.	Jan 2018	A1
20180020035	Boggia et al.	Jan 2018	A1
20180034668	Mayya et al.	Feb 2018	A1
20180041425	Zhang	Feb 2018	A1
20180062875	Tumuluru	Mar 2018	A1
20180062914	Boutros et al.	Mar 2018	A1
20180062917	Chandrashekhar et al.	Mar 2018	A1
20180063036	Chandrashekhar et al.	Mar 2018	A1
20180063193	Chandrashekhar et al.	Mar 2018	A1
20180063233	Park	Mar 2018	A1
20180063743	Tumuluru et al.	Mar 2018	A1
20180069924	Tumuluru et al.	Mar 2018	A1
20180074909	Bishop et al.	Mar 2018	A1
20180077081	Lauer et al.	Mar 2018	A1
20180077202	Xu	Mar 2018	A1
20180084081	Kuchibhotla et al.	Mar 2018	A1
20180091370	Arai	Mar 2018	A1
20180097725	Wood et al.	Apr 2018	A1
20180114569	Strachan et al.	Apr 2018	A1
20180123910	Fitzgibbon	May 2018	A1
20180123946	Ramachandran et al.	May 2018	A1
20180131608	Jiang et al.	May 2018	A1
20180131615	Zhang	May 2018	A1
20180131720	Hobson et al.	May 2018	A1
20180145899	Rao	May 2018	A1
20180159796	Wang et al.	Jun 2018	A1
20180159856	Gujarathi	Jun 2018	A1
20180167378	Kostyukov et al.	Jun 2018	A1
20180176073	Dubey et al.	Jun 2018	A1
20180176082	Katz et al.	Jun 2018	A1
20180176130	Banerjee et al.	Jun 2018	A1
20180176252	Nimmagadda et al.	Jun 2018	A1
20180181423	Gunda et al.	Jun 2018	A1
20180205746	Boutnaru et al.	Jul 2018	A1
20180213472	Ishii et al.	Jul 2018	A1
20180219765	Michael et al.	Aug 2018	A1
20180219766	Michael et al.	Aug 2018	A1
20180234300	Mayya et al.	Aug 2018	A1
20180248790	Tan et al.	Aug 2018	A1
20180260125	Botes et al.	Sep 2018	A1
20180261085	Liu et al.	Sep 2018	A1
20180262468	Kumar et al.	Sep 2018	A1
20180270104	Zheng et al.	Sep 2018	A1
20180278541	Wu et al.	Sep 2018	A1
20180287907	Kulshreshtha et al.	Oct 2018	A1
20180295101	Gehrmann	Oct 2018	A1
20180295529	Jen et al.	Oct 2018	A1
20180302286	Mayya et al.	Oct 2018	A1
20180302321	Manthiramoorthy et al.	Oct 2018	A1
20180307851	Lewis	Oct 2018	A1
20180316606	Sung et al.	Nov 2018	A1
20180351855	Sood et al.	Dec 2018	A1
20180351862	Jeganathan et al.	Dec 2018	A1
20180351863	Vairavakkalai et al.	Dec 2018	A1
20180351882	Jeganathan et al.	Dec 2018	A1
20180359323	Madden	Dec 2018	A1
20180367445	Bajaj	Dec 2018	A1
20180373558	Chang et al.	Dec 2018	A1
20180375744	Mayya et al.	Dec 2018	A1
20180375824	Mayya et al.	Dec 2018	A1
20180375967	Pithawala et al.	Dec 2018	A1
20190013883	Vargas et al.	Jan 2019	A1
20190014038	Ritchie	Jan 2019	A1
20190020588	Twitchell, Jr.	Jan 2019	A1
20190020627	Yuan	Jan 2019	A1
20190021085	Mochizuki et al.	Jan 2019	A1
20190028378	Houjyo et al.	Jan 2019	A1
20190028552	Johnson et al.	Jan 2019	A1
20190036808	Shenoy et al.	Jan 2019	A1
20190036810	Michael et al.	Jan 2019	A1
20190036813	Shenoy et al.	Jan 2019	A1
20190046056	Khachaturian et al.	Feb 2019	A1
20190058657	Chunduri et al.	Feb 2019	A1
20190058709	Kempf et al.	Feb 2019	A1
20190068470	Mirsky	Feb 2019	A1
20190068493	Ram et al.	Feb 2019	A1
20190068500	Hira	Feb 2019	A1
20190075083	Mayya et al.	Mar 2019	A1
20190081894	Yousaf et al.	Mar 2019	A1
20190103990	Cidon et al.	Apr 2019	A1
20190103991	Cidon et al.	Apr 2019	A1
20190103992	Cidon et al.	Apr 2019	A1
20190103993	Cidon et al.	Apr 2019	A1
20190104035	Cidon et al.	Apr 2019	A1
20190104049	Cidon et al.	Apr 2019	A1
20190104050	Cidon et al.	Apr 2019	A1
20190104051	Cidon et al.	Apr 2019	A1
20190104052	Cidon et al.	Apr 2019	A1
20190104053	Cidon et al.	Apr 2019	A1
20190104063	Cidon et al.	Apr 2019	A1
20190104064	Cidon et al.	Apr 2019	A1
20190104109	Cidon et al.	Apr 2019	A1
20190104111	Cidon et al.	Apr 2019	A1
20190104413	Cidon et al.	Apr 2019	A1
20190109769	Jain et al.	Apr 2019	A1
20190132221	Boutros et al.	May 2019	A1
20190132234	Dong et al.	May 2019	A1
20190132322	Song et al.	May 2019	A1
20190140889	Mayya et al.	May 2019	A1
20190140890	Mayya et al.	May 2019	A1
20190149525	Gunda et al.	May 2019	A1
20190158371	Dillon et al.	May 2019	A1
20190158605	Markuze et al.	May 2019	A1
20190199539	Deng et al.	Jun 2019	A1
20190220703	Prakash et al.	Jul 2019	A1
20190222499	Chen et al.	Jul 2019	A1
20190238364	Boutros et al.	Aug 2019	A1
20190238446	Barzik et al.	Aug 2019	A1
20190238449	Michael et al.	Aug 2019	A1
20190238450	Michael et al.	Aug 2019	A1
20190238483	Marichetty et al.	Aug 2019	A1
20190238497	Tourrilhes et al.	Aug 2019	A1
20190268421	Markuze et al.	Aug 2019	A1
20190268973	Bull et al.	Aug 2019	A1
20190278631	Bernat et al.	Sep 2019	A1
20190280962	Michael et al.	Sep 2019	A1
20190280963	Michael et al.	Sep 2019	A1
20190280964	Michael et al.	Sep 2019	A1
20190288875	Shen et al.	Sep 2019	A1
20190306197	Degioanni	Oct 2019	A1
20190306282	Masputra et al.	Oct 2019	A1
20190313278	Liu	Oct 2019	A1
20190313907	Khachaturian et al.	Oct 2019	A1
20190319847	Nahar et al.	Oct 2019	A1
20190319881	Maskara et al.	Oct 2019	A1
20190327109	Guichard et al.	Oct 2019	A1
20190334786	Dutta et al.	Oct 2019	A1
20190334813	Raj et al.	Oct 2019	A1
20190334820	Zhao	Oct 2019	A1
20190342201	Singh	Nov 2019	A1
20190342219	Liu et al.	Nov 2019	A1
20190356736	Narayanaswamy et al.	Nov 2019	A1
20190364099	Thakkar et al.	Nov 2019	A1
20190364456	Yu	Nov 2019	A1
20190372888	Michael et al.	Dec 2019	A1
20190372889	Michael et al.	Dec 2019	A1
20190372890	Michael et al.	Dec 2019	A1
20190394081	Tahhan et al.	Dec 2019	A1
20200014609	Hockett et al.	Jan 2020	A1
20200014615	Michael et al.	Jan 2020	A1
20200014616	Michael et al.	Jan 2020	A1
20200014661	Mayya et al.	Jan 2020	A1
20200014663	Chen et al.	Jan 2020	A1
20200021514	Michael et al.	Jan 2020	A1
20200021515	Michael et al.	Jan 2020	A1
20200036624	Michael et al.	Jan 2020	A1
20200044943	Bor-Yaliniz et al.	Feb 2020	A1
20200044969	Hao et al.	Feb 2020	A1
20200059420	Abraham	Feb 2020	A1
20200059457	Raza et al.	Feb 2020	A1
20200059459	Abraham et al.	Feb 2020	A1
20200067831	Spraggins et al.	Feb 2020	A1
20200092207	Sipra et al.	Mar 2020	A1
20200097327	Beyer et al.	Mar 2020	A1
20200099625	Yigit et al.	Mar 2020	A1
20200099659	Cometto et al.	Mar 2020	A1
20200106696	Michael et al.	Apr 2020	A1
20200106706	Mayya et al.	Apr 2020	A1
20200119952	Mayya et al.	Apr 2020	A1
20200127905	Mayya et al.	Apr 2020	A1
20200127911	Gilson et al.	Apr 2020	A1
20200153701	Mohan et al.	May 2020	A1
20200153736	Liebherr et al.	May 2020	A1
20200159661	Keymolen et al.	May 2020	A1
20200162407	Tillotson	May 2020	A1
20200169473	Rimar et al.	May 2020	A1
20200177503	Hooda et al.	Jun 2020	A1
20200177550	Valluri et al.	Jun 2020	A1
20200177629	Hooda et al.	Jun 2020	A1
20200186471	Shen et al.	Jun 2020	A1
20200195557	Duan et al.	Jun 2020	A1
20200204460	Schneider et al.	Jun 2020	A1
20200213212	Dillon et al.	Jul 2020	A1
20200213224	Cheng et al.	Jul 2020	A1
20200218558	Sreenath et al.	Jul 2020	A1
20200235990	Janakiraman et al.	Jul 2020	A1
20200235999	Mayya et al.	Jul 2020	A1
20200236046	Jain et al.	Jul 2020	A1
20200241927	Yang et al.	Jul 2020	A1
20200244721	S et al.	Jul 2020	A1
20200252234	Ramamoorthi et al.	Aug 2020	A1
20200259700	Bhalla et al.	Aug 2020	A1
20200267184	Vera-Schockner	Aug 2020	A1
20200267203	Jindal et al.	Aug 2020	A1
20200280587	Janakiraman et al.	Sep 2020	A1
20200287819	Theogaraj et al.	Sep 2020	A1
20200287976	Theogaraj et al.	Sep 2020	A1
20200296011	Jain et al.	Sep 2020	A1
20200296026	Michael et al.	Sep 2020	A1
20200301764	Thoresen et al.	Sep 2020	A1
20200314006	Mackie et al.	Oct 2020	A1
20200314614	Moustafa et al.	Oct 2020	A1
20200322230	Natal et al.	Oct 2020	A1
20200322287	Connor et al.	Oct 2020	A1
20200336336	Sethi et al.	Oct 2020	A1
20200344089	Motwani et al.	Oct 2020	A1
20200344143	Faseela et al.	Oct 2020	A1
20200344163	Gupta et al.	Oct 2020	A1
20200351188	Arora et al.	Nov 2020	A1
20200358878	Bansal et al.	Nov 2020	A1
20200366530	Mukundan et al.	Nov 2020	A1
20200366562	Mayya et al.	Nov 2020	A1
20200382345	Zhao et al.	Dec 2020	A1
20200382387	Pasupathy et al.	Dec 2020	A1
20200403821	Dev et al.	Dec 2020	A1
20200412483	Tan et al.	Dec 2020	A1
20200412576	Kondapavuluru et al.	Dec 2020	A1
20200413283	Shen et al.	Dec 2020	A1
20210006482	Hwang et al.	Jan 2021	A1
20210006490	Michael et al.	Jan 2021	A1
20210021538	Meck et al.	Jan 2021	A1
20210029019	Kottapalli	Jan 2021	A1
20210029088	Mayya et al.	Jan 2021	A1
20210036888	Makkalla et al.	Feb 2021	A1
20210036987	Mishra et al.	Feb 2021	A1
20210037159	Shimokawa	Feb 2021	A1
20210049191	Masson et al.	Feb 2021	A1
20210067372	Cidon et al.	Mar 2021	A1
20210067373	Cidon et al.	Mar 2021	A1
20210067374	Cidon et al.	Mar 2021	A1
20210067375	Cidon et al.	Mar 2021	A1
20210067407	Cidon et al.	Mar 2021	A1
20210067427	Cidon et al.	Mar 2021	A1
20210067442	Sundararajan et al.	Mar 2021	A1
20210067461	Cidon et al.	Mar 2021	A1
20210067464	Cidon et al.	Mar 2021	A1
20210067467	Cidon et al.	Mar 2021	A1
20210067468	Cidon et al.	Mar 2021	A1
20210073001	Rogers et al.	Mar 2021	A1
20210092062	Dhanabalan et al.	Mar 2021	A1
20210099360	Parsons et al.	Apr 2021	A1
20210105199	H et al.	Apr 2021	A1
20210111998	Saavedra	Apr 2021	A1
20210112034	Sundararajan et al.	Apr 2021	A1
20210126830	R. et al.	Apr 2021	A1
20210126853	Ramaswamy et al.	Apr 2021	A1
20210126854	Guo et al.	Apr 2021	A1
20210126860	Ramaswamy et al.	Apr 2021	A1
20210144091	H et al.	May 2021	A1
20210160169	Shen et al.	May 2021	A1
20210160813	Gupta et al.	May 2021	A1
20210176255	Hill et al.	Jun 2021	A1
20210184952	Mayya et al.	Jun 2021	A1
20210184966	Ramaswamy et al.	Jun 2021	A1
20210184983	Ramaswamy et al.	Jun 2021	A1
20210194814	Roux et al.	Jun 2021	A1
20210226880	Ramamoorthy et al.	Jul 2021	A1
20210234728	Cidon et al.	Jul 2021	A1
20210234775	Devadoss et al.	Jul 2021	A1
20210234786	Devadoss et al.	Jul 2021	A1
20210234804	Devadoss et al.	Jul 2021	A1
20210234805	Devadoss et al.	Jul 2021	A1
20210235312	Devadoss et al.	Jul 2021	A1
20210235313	Devadoss et al.	Jul 2021	A1
20210266262	Subramanian et al.	Aug 2021	A1
20210279069	Salgaonkar et al.	Sep 2021	A1
20210314289	Chandrashekhar et al.	Oct 2021	A1
20210314385	Pande et al.	Oct 2021	A1
20210328835	Mayya et al.	Oct 2021	A1
20210336880	Gupta et al.	Oct 2021	A1
20210377109	Shrivastava et al.	Dec 2021	A1
20210377156	Michael et al.	Dec 2021	A1
20210392060	Silva et al.	Dec 2021	A1
20210392070	Tootaghaj et al.	Dec 2021	A1
20210399920	Sundararajan et al.	Dec 2021	A1
20210399978	Michael et al.	Dec 2021	A9
20210400113	Markuze et al.	Dec 2021	A1
20210400512	Agarwal et al.	Dec 2021	A1
20210409277	Jeuk et al.	Dec 2021	A1
20220006726	Michael et al.	Jan 2022	A1
20220006751	Ramaswamy et al.	Jan 2022	A1
20220006756	Ramaswamy et al.	Jan 2022	A1
20220029902	Shemer et al.	Jan 2022	A1
20220035673	Markuze et al.	Feb 2022	A1
20220038370	Vasseur et al.	Feb 2022	A1
20220038557	Markuze et al.	Feb 2022	A1
20220045927	Liu et al.	Feb 2022	A1
20220052928	Sundararajan et al.	Feb 2022	A1
20220061059	Dunsmore et al.	Feb 2022	A1
20220086035	Devaraj et al.	Mar 2022	A1
20220094644	Cidon et al.	Mar 2022	A1
20220123961	Mukundan et al.	Apr 2022	A1
20220131740	Mayya et al.	Apr 2022	A1
20220131807	Srinivas et al.	Apr 2022	A1
20220131898	Hooda et al.	Apr 2022	A1
20220141184	Oswal et al.	May 2022	A1
20220158923	Ramaswamy et al.	May 2022	A1
20220158924	Ramaswamy et al.	May 2022	A1
20220158926	Wennerstrom et al.	May 2022	A1
20220166713	Markuze et al.	May 2022	A1
20220191719	Roy	Jun 2022	A1
20220198229	López et al.	Jun 2022	A1
20220210035	Hendrickson et al.	Jun 2022	A1
20220210041	Gandhi et al.	Jun 2022	A1
20220210042	Gandhi et al.	Jun 2022	A1
20220210122	Levin et al.	Jun 2022	A1
20220217015	Vuggrala et al.	Jul 2022	A1
20220231949	Ramaswamy et al.	Jul 2022	A1
20220231950	Ramaswamy et al.	Jul 2022	A1
20220232411	Vijayakumar et al.	Jul 2022	A1
20220239596	Kumar et al.	Jul 2022	A1
20220294701	Mayya et al.	Sep 2022	A1
20220335027	Seshadri et al.	Oct 2022	A1
20220337553	Mayya et al.	Oct 2022	A1
20220353152	Ramaswamy	Nov 2022	A1
20220353171	Ramaswamy et al.	Nov 2022	A1
20220353175	Ramaswamy et al.	Nov 2022	A1
20220353182	Ramaswamy et al.	Nov 2022	A1
20220353190	Ramaswamy et al.	Nov 2022	A1
20220360500	Ramaswamy et al.	Nov 2022	A1
20220407773	Kempanna et al.	Dec 2022	A1
20220407774	Kempanna et al.	Dec 2022	A1
20220407790	Kempanna et al.	Dec 2022	A1
20220407820	Kempanna et al.	Dec 2022	A1
20220407915	Kempanna et al.	Dec 2022	A1
20230006929	Mayya et al.	Jan 2023	A1
20230025586	Rolando et al.	Jan 2023	A1
20230026330	Rolando et al.	Jan 2023	A1
20230026865	Rolando et al.	Jan 2023	A1
20230028872	Ramaswamy	Jan 2023	A1
20230039869	Ramaswamy et al.	Feb 2023	A1
20230041916	Zhang et al.	Feb 2023	A1
20230054961	Ramaswamy et al.	Feb 2023	A1
20230105680	Simlai et al.	Apr 2023	A1
20230121871	Mayya et al.	Apr 2023	A1
20230179445	Cidon et al.	Jun 2023	A1
20230179502	Ramaswamy et al.	Jun 2023	A1
20230179521	Markuze et al.	Jun 2023	A1
20230179543	Cidon et al.	Jun 2023	A1
20230216768	Zohar et al.	Jul 2023	A1
20230216801	Markuze et al.	Jul 2023	A1
20230216804	Zohar et al.	Jul 2023	A1
20230221874	Markuze et al.	Jul 2023	A1
20230224356	Markuze et al.	Jul 2023	A1
20230224759	Ramaswamy	Jul 2023	A1
20230231845	Manoharan et al.	Jul 2023	A1
20230239234	Zohar et al.	Jul 2023	A1
20230261974	Ramaswamy et al.	Aug 2023	A1

Foreign Referenced Citations (52)

Number	Date	Country
2020336161	Mar 2022	AU
1926809	Mar 2007	CN
102577270	Jul 2012	CN
102811165	Dec 2012	CN
104956329	Sep 2015	CN
106230650	Dec 2016	CN
106656847	May 2017	CN
106998284	Aug 2017	CN
110447209	Nov 2019	CN
111198764	May 2020	CN
1912381	Apr 2008	EP
2538637	Dec 2012	EP
2763362	Aug 2014	EP
3041178	Jul 2016	EP
3297211	Mar 2018	EP
3509256	Jul 2019	EP
3346650	Nov 2019	EP
4022863	Jul 2022	EP
2002368792	Dec 2002	JP
2010233126	Oct 2010	JP
2014200010	Oct 2014	JP
2017059991	Mar 2017	JP
2017524290	Aug 2017	JP
20170058201	May 2017	KR
2574350	Feb 2016	RU
03073701	Sep 2003	WO
2005071861	Aug 2005	WO
2007016834	Feb 2007	WO
2012167184	Dec 2012	WO
2015092565	Jun 2015	WO
2016061546	Apr 2016	WO
2016123314	Aug 2016	WO
2017083975	May 2017	WO
2019070611	Apr 2019	WO
2019094522	May 2019	WO
2020012491	Jan 2020	WO
2020018704	Jan 2020	WO
2020091777	May 2020	WO
2020101922	May 2020	WO
2020112345	Jun 2020	WO
2021040934	Mar 2021	WO
2021118717	Jun 2021	WO
2021150465	Jul 2021	WO
2021211906	Oct 2021	WO
2022005607	Jan 2022	WO
2022082680	Apr 2022	WO
2022154850	Jul 2022	WO
2022159156	Jul 2022	WO
2022231668	Nov 2022	WO
2022235303	Nov 2022	WO
2022265681	Dec 2022	WO
2023009159	Feb 2023	WO

Non-Patent Literature Citations (37)

Entry
Alsaeedi, Mohammed, et al., “Toward Adaptive and Scalable OpenFlow-SDN Flow Control: A Survey,” IEEE Access, Aug. 1, 2019, 34 pages, vol. 7, IEEE, retrieved from https://ieeexplore.ieee.org/document/8784036.
Alvizu, Rodolfo, et al., “SDN-Based Network Orchestration for New Dynamic Enterprise Networking Services,” 2017 19th International Conference on Transparent Optical Networks, Jul. 2-6, 2017, 4 pages, IEEE, Girona, Spain.
Author Unknown, “VeloCloud Administration Guide: VMware SD-WAN by VeloCloud 3.3,” Month Unknown 2019, 366 pages, VMware, Inc., Palo Alto, CA, USA.
Barozet, Jean-Marc, “Cisco SD-WAN as a Managed Service,” BRKRST-2558, Jan. 27-31, 2020, 98 pages, Cisco, Barcelona, Spain, retrieved from https://www.ciscolive.com/c/dam/r/ciscolive/emea/docs/2020/pdf/BRKRST-2558.pdf.
Barozet, Jean-Marc, “Cisco SDWAN,” Deep Dive, Dec. 2017, 185 pages, Cisco, Retreived from https://www.coursehero.com/file/71671376/Cisco-SDWAN-Deep-Divepdf/.
Bertaux, Lionel, et al., “Software Defined Networking and Virtualization for Broadband Satellite Networks,” IEEE Communications Magazine, Mar. 18, 2015, 7 pages, vol. 53, IEEE, retrieved from https://ieeexplore.ieee.org/document/7060482.
Cox, Jacob H., et al., “Advancing Software-Defined Networks: A Survey,” IEEE Access, Oct. 12, 2017, 40 pages, vol. 5, IEEE, retrieved from https://ieeexplore.ieee.org/document/8066287.
Del Piccolo, Valentin, et al., “A Survey of Network Isolation Solutions for Multi-Tenant Data Centers,” IEEE Communications Society, Apr. 20, 2016, vol. 18, No. 4, 37 pages, IEEE.
Duan, Zhenhai, et al., “Service Overlay Networks: SLAs, QoS, and Bandwidth Provisioning,” IEEE/ACM Transactions on Networking, Dec. 2003, 14 pages, vol. 11, IEEE, New York, NY, USA.
Fortz, Bernard, et al., “Internet Traffic Engineering by Optimizing OSPF Weights,” Proceedings IEEE INFOCOM 2000, Conference on Computer Communications, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 26-30, 2000, 11 pages, IEEE, Tel Aviv, Israel, Israel.
Francois, Frederic, et al., “Optimizing Secure SDN-enabled Inter-Data Centre Overlay Networks through Cognitive Routing,” 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), Sep. 19-21, 2016, 10 pages, IEEE, London, UK.
Funabiki, Nobuo, et al., “A Frame Aggregation Extension of Routing Algorithm for Wireless Mesh Networks,” 2014 Second International Symposium on Computing and Networking, Dec. 10-12, 2014, 5 pages, IEEE, Shizuoka, Japan.
Guo, Xiangyi, et al., U.S. Appl. No. 62/925,193, filed Oct. 23, 2019, 26 pages.
Huang, Cancan, et al., “Modification of Q.SD-WAN,” Rapporteur Group Meeting—Doc, Study Period 2017-2020, Q4/11-DOC1 (190410), Study Group 11, Apr. 10, 2019, 19 pages, International Telecommunication Union, Geneva, Switzerland.
Jivorasetkul, Supalerk, et al., “End-to-End Header Compression over Software-Defined Networks: a Low Latency Network Architecture,” 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems, Sep. 19-21, 2012, 2 pages, IEEE, Bucharest, Romania.
Lasserre, Marc, et al., “Framework for Data Center (DC) Network Virtualization,” RFC 7365, Oct. 2014, 26 pages, IETF.
Li, Shengru, et al., “Source Routing with Protocol-oblivious Forwarding (POF) to Enable Efficient e-Health Data Transfers,” 2016 IEEE International Conference on Communications (ICC), May 22-27, 2016, 6 pages, IEEE, Kuala Lumpur, Malaysia.
Lin, Weidong, et al., “Using Path Label Routing in Wide Area Software-Defined Networks with Open Flow,” 2016 International Conference on Networking and Network Applications, Jul. 2016, 6 pages, IEEE.
Long, Feng, “Research and Application of Cloud Storage Technology in University Information Service,” Chinese Excellent Masters' Theses Full-text Database, Mar. 2013, 72 pages, China Academic Journals Electronic Publishing House, China.
Michael, Nithin, et al., “HALO: Hop-by-Hop Adaptive Link-State Optimal Routing,” IEEE/ACM Transactions on Networking, Dec. 2015, 14 pages, vol. 23, No. 6, IEEE.
Ming, Gao, et al., “A Design of SD-WAN-Oriented Wide Area Network Access,” 2020 International Conference on Computer Communication and Network Security (CCNS), Aug. 21-23, 2020, 4 pages, IEEE, Xi'an, China.
Mishra, Mayank, et al., “Managing Network Reservation for Tenants in Oversubscribed Clouds,” 2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems, Aug. 14-16, 2013, 10 pages, IEEE, San Francisco, CA, USA.
Mudigonda, Jayaram, et al., “NetLord: A Scalable Multi-Tenant Network Architecture for Virtualized Datacenters,” Proceedings of the ACM SIGCOMM 2011 Conference, Aug. 15-19, 2011, 12 pages, ACM, Toronto, Canada.
Non-Published Commonly Owned U.S. Appl. No. 18/222,864, filed Jul. 17, 2023, 350 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 18/222,868, filed Jul. 17, 2023, 22 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 15/803,964, filed Nov. 6, 2017, 15 pages, The Mode Group.
Noormohammadpour, Mohammad, et al., “DCRoute: Speeding up Inter-Datacenter Traffic Allocation while Guaranteeing Deadlines,” 2016 IEEE 23rd International Conference on High Performance Computing (HiPC), Dec. 19-22, 2016, 9 pages, IEEE, Hyderabad, India.
PCT International Search Report and Written Opinion of Commonly Owned International Patent Application PCT/US2020/043635, mailed Sep. 17, 2020, 12 pages, International Searching Authority (EPO).
Ray, Saikat, et al., “Always Acyclic Distributed Path Computation,” University of Pennsylvania Department of Electrical and Systems Engineering Technical Report, May 2008, 16 pages, University of Pennsylvania ScholarlyCommons.
Sarhan, Soliman Abd Elmonsef, et al., “Data Inspection in SDN Network,” 2018 13th International Conference on Computer Engineering and Systems (ICCES), Dec. 18-19, 2018, 6 pages, IEEE, Cairo, Egypt.
Taleb, Tarik, “D4.1 Mobile Network Cloud Component Design,” Mobile Cloud Networking, Nov. 8, 2013, 210 pages, MobileCloud Networking Consortium, retrieved from http://www.mobile-cloud-networking.eu/site/index.php?process=download&id=127&code=89d30565cd2ce087d3f8e95f9ad683066510a61f.
Tootaghaj, Diman Zad, et al., “Homa: An Efficient Topology and Route Management Approach in SD-WAN Overlays,” IEEE INFOCOM 2020—IEEE Conference on Computer Communications, Jul. 6-9, 2020, 10 pages, IEEE, Toronto, ON, Canada.
Valtulina, Luca, “Seamless Distributed Mobility Management (DMM) Solution in Cloud Based LTE Systems,” Master Thesis, Nov. 2013, 168 pages, University of Twente, retrieved from http://essay.utwente.nl/64411/1/Luca_Valtulina_MSc_Report_final.pdf.
Webb, Kevin C., et al., “Blender: Upgrading Tenant-Based Data Center Networking,” 2014 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), Oct. 20-21, 2014, 11 pages, IEEE, Marina del Rey, CA, USA.
Xie, Junfeng, et al., A Survey of Machine Learning Techniques Applied to Software Defined Networking (SDN): Research Issues and Challenges, IEEE Communications Surveys & Tutorials, Aug. 23, 2018, 38 pages, vol. 21, Issue 1, IEEE.
Yap, Kok-Kiong, et al., “Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering,” SIGCOMM '17: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, Aug. 21-25, 2017, 14 pages, Los Angeles, CA.
Zakurdaev, Gieorgi, et al., “Dynamic On-Demand Virtual Extensible LAN Tunnels via Software-Defined Wide Area Networks,” 2022 IEEE 12th Annual Computing and Communication Workshop and Conference, Jan. 26-29, 2022, 6 pages, IEEE, Las Vegas, NV, USA.

Related Publications (1)

	Number	Date	Country
	20230412525 A1	Dec 2023	US

Provisional Applications (1)

	Number	Date	Country
	62892473	Aug 2019	US

Continuations (3)

	Number	Date	Country
Parent	18102687	Jan 2023	US
Child	18235879		US
Parent	17542413	Dec 2021	US
Child	18102687		US
Parent	16662427	Oct 2019	US
Child	17542413		US

Providing recommendations for implementing virtual networks

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

US

International Classifications

Disclaimer

Term Extension

Abstract