Managing forwarding elements at edge nodes connected to a virtual network

Information

  • Patent Grant
  • 11044190
  • Patent Number
    11,044,190
  • Date Filed
    Friday, December 20, 2019
    5 years ago
  • Date Issued
    Tuesday, June 22, 2021
    3 years ago
Abstract
Some embodiments provide a method for maintaining a virtual network that spans at least one cloud datacenter separate from multi-machine edge nodes of an entity. This method configures a gateway in the cloud datacenter to establish secure connections with several edge devices at several multi-machine edge nodes (e.g., branch offices, datacenters, etc.) in order to establish the virtual network. The method configures the gateway to assess quality of connection links with different edge devices, and to terminate a secure connection with a particular edge device for a duration of time after the assessed quality of the connection link to the particular edge device is worse than a threshold value. In some embodiments, the gateway is configured to distribute routes to edge devices at the edge nodes, and to forgo distributing any route to the particular edge device along the connection link for the duration of time when the assessed quality of the connection link is worse than (e.g., less than) a threshold value. In different embodiments, the gateway assesses the quality of the connection link based on different factors or different combinations of factors. Examples of such factors in some embodiments include the following attributes of a connection link: packet loss, latency, signal jitter, etc. Also, the routes that the gateway distributes in some embodiments include routes that the edge devices distribute to the gateway, as well as routes that the gateway learns on its own.
Description
RELATED APPLICATIONS

Benefit is claimed under 35 U.S.C. 119(a)-(d) to Foreign Application Serial No. 201941043654 filed in India entitled “MANAGING FORWARDING ELEMENTS AT EDGE NODES CONNECTED TO A VIRTUAL NETWORK”, on Oct. 28, 2019, by VMWARE, INC., which is herein incorporated in its entirety by reference for all purposes.


In recent years, several companies have brought to market solutions for deploying software-defined (SD) wide-area networks (WANs) for enterprises. Some such SD-WAN solutions use external third-party private or public cloud datacenters (clouds) to define different virtual WANs for different enterprises. These solutions typically have edge forwarding elements (called edge devices) at edge nodes of an enterprise that connect with one or more gateway forwarding elements (called gateway devices or gateways) that are deployed in the third-party clouds.


In such a deployment, an edge device connects through one or more secure connections with a gateway, with these connections traversing one or more network links that connect the edge device with an external network. Examples of such network links include MPLS links, 5G LTE links, commercial broadband Internet links (e.g., cable modem links or fiber optic links), etc. The edge nodes include branch offices (called branches) of the enterprise, and these offices are often spread across geographies with network links to the gateways of various different network connectivity types. These network links often exhibit varying network path characteristics with respect to packet loss, latency, jitter, etc. Such multi-site connectivity in SD-WAN implementation needs to be reliable and resilient.


BRIEF SUMMARY

Some embodiments of the invention provide a method for maintaining a virtual network that spans at least one cloud datacenter separate from multi-machine edge nodes of an entity. This method configures a gateway in the cloud datacenter to establish secure connections with several edge devices at several multi-machine edge nodes (e.g., branch offices, datacenters, etc.) in order to establish the virtual network. The method configures the gateway to assess the quality of the connection links with different edge devices, and to terminate a secure connection with a particular edge device for a duration of time after the assessed quality of the connection link to the particular edge device is worse than a threshold value.


In some embodiments, the gateway is configured to distribute routes to edge devices at the edge nodes, and to forgo distributing any route to the particular edge device along the connection link for the duration of time when the assessed quality of the connection link is worse than (e.g., less than) a threshold value. In different embodiments, the gateway assesses the quality of the connection link based on different factors or different combination of factors. Examples of such factors, in some embodiments, include the following attributes of a connection link: packet loss, latency, signal jitter, etc. Also, the routes that the gateway distributes in some embodiments include routes that the edge devices distribute to the gateway, as well as routes that the gateway learns on its own.


In some embodiments, the particular edge device has connections with first and second gateways in first and second cloud datacenters. After the quality of the network link that connects the particular edge device to the first gateway degrades, the particular edge device does not receive routes from the first gateway. In some embodiments, this is achieved by the first gateway terminating the secure connection with the particular edge device and not establishing a new connection for a duration of time. However, during this period, the particular edge device can continue to receive routes from the second gateway in the second cloud datacenter, as the secure connection between the particular edge device and the second gateway uses a network link that is good.


In some embodiments, the particular edge device connects to several external networks through several network links comprising first and second network links. In some embodiments, examples of such external network links include a commercial broadband Internet link, a wireless telecommunication link, and an MPLS link. When the particular edge device connects to the first gateway through first and second network connection links, with the first connection link having an assessed quality that is worse than a threshold value while the second connection link has a quality that is better than the threshold value, the first gateway can continue to distribute routes to the particular edge device through the second connection link.


To reject connection requests from the particular edge device for the duration of time, the gateway adds the particular edge device to a blacklist that includes the edge device to which the gateway should not accept secure connection requests. In some embodiments, each edge device on the blacklist is identified in terms of a network address that is associated with a network link that is connected to the edge devices. The gateway device removes the particular edge device from the blacklist after the duration of time


In some embodiments, the gateway detects an anomaly in routes that are maintained at a particular edge device, and directs the particular edge device to perform a route reset operation to re-identify routes across the virtual network. The gateway detects the anomaly in some embodiments by detecting a drop in a number of routes maintained at the particular edge device that is larger than a threshold value. In some embodiments, the gateway stores an old list of routes that are maintained at the particular edge node. It then identifies a new list of routes that are maintained at the particular edge node, and compares these two lists to identify routes in the old list that are not in the new list. When more than the threshold value of routes is missing from the new list, the gateway specifies that an anomaly has been detected. In some embodiments, the gateway obtains the new list of routes from the particular edge node. Also, in some embodiments, the gateway stores the new list as the old list when changes to the new list do not exceed a threshold value.


The particular edge node, in some embodiments, is configured to exchange routes with another edge node. In some such embodiments, the detected anomaly can be caused by race conditions that incorrectly cause the particular edge node to filter out a subset of the routes when synchronizing routes with the other edge node. These two edge nodes are configured, in some embodiments, to establish a tunnel through which the two edge nodes forward data messages and forward the routes used to forward data messages to each other and to one or more gateways and/or other edge devices. In some embodiments, these two edge nodes are configured in a hub/spoke topology.


When the particular edge device performs the route reset operation, the particular edge device in some embodiments directs at least one other edge to synchronize the set of routes maintained by the other edge with the particular edge device. Conjunctively, or alternatively, the particular edge device in some embodiments performs the route reset operation by directing the anomaly-detecting gateway or another gateway to synchronize the set of routes maintained by the gateway with the particular edge device. In some embodiments, these routes are routes identified by one or more other edge devices and/or one or more gateways.


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





BRIEF DESCRIPTION OF THE DRAWINGS

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



FIG. 1 illustrates an example of a virtual network that is created for a particular entity by two gateways that are deployed in two different public cloud datacenters of two different public cloud providers.



FIG. 2 presents an example that illustrates the gateway terminating its secure connection with the edge forwarding element when it assesses that the quality of the network connection with this forwarding element has deteriorated by more than an acceptable amount.



FIG. 3 presents an example that illustrates an edge forwarding element with a poor network connection to one gateway connecting to the virtual network through another gateway.



FIG. 4 presents an example that illustrates that, after a gateway terminates a connection link with the edge forwarding element for a duration of time, this forwarding element can connect to the virtual network through another connection link with the same gateway.



FIG. 5 illustrates a process that a gateway periodically performs in some embodiments to maintain its sets of whitelisted connection endpoints and blacklisted connection endpoints.



FIG. 6 illustrates examples of a blacklist and a whitelist of a gateway.



FIG. 7 illustrates a process that a gateway performs in some embodiments to establish a secure connection with an edge endpoint of an edge node's forwarding element.



FIG. 8 illustrates a process that a gateway performs to distribute a route to edge forwarding elements.



FIGS. 9-12 illustrate an example of the gateway directing an edge forwarding element to rebuild its route data for a virtual network after detecting an anomaly in the routes maintained by the forwarding element.



FIG. 13 illustrates a process performed by a gateway to detect an anomaly in the set of routes that is maintained by an edge forwarding element that has an active connection session with the gateway.



FIG. 14 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 of the invention provide a method for maintaining a virtual network that spans at least one cloud datacenter separate from multi-machine edge nodes of an entity. In some embodiments, this method is implemented by a gateway in the cloud datacenter. This gateway is configured to establish secure connections with several edge devices at several multi-machine edge nodes (e.g., branch offices, datacenters, etc.) in order to establish the virtual network. According to this method, the gateway assesses the quality of connection links with different edge devices, and terminates a secure connection with a particular edge device for a duration of time when the assessed quality of the connection link to the particular edge device is worse than a threshold value.


In some embodiments, the gateway is configured to distribute routes to edge devices at the edge nodes, and to forgo distributing any route to the particular edge device along the connection link for the duration of time when the assessed quality of the connection link is worse than (e.g., less than) a threshold value. In different embodiments, the gateway assesses the quality of the connection link based on different factors or different combination of factors. Examples of such factors in some embodiments include the following attributes of a connection link: packet loss, latency, signal jitter, etc. Also, the routes that the gateway distributes in some embodiments include routes that the edge devices distribute to the gateway, as well as routes that the gateway learns on its own.


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 may be used herein to refer to various formatted collections of bits that may be sent across a network, such as 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, layer 7) are references, respectively, to the second data link layer, the third network layer, the fourth transport layer, and the seventh application layer of the OSI (Open System Interconnection) layer model.



FIG. 1 illustrates an example of a virtual network 100 that is created for a particular entity by two gateways 105 and 107 that are deployed in two different public cloud datacenters 110 and 112 of two different public cloud providers. Examples of public cloud providers include Amazon Web Services (AWS), Google Cloud Platform (GCP), Microsoft Azure, etc., while examples of entities include a company (e.g., corporation, partnership, etc.), an organization (e.g., a school, a non-profit, a government entity, etc.), etc. In FIG. 1, the gateways are multi-tenant forwarding elements that can be used to establish secure connection links (e.g., tunnels) with edge forwarding elements at the particular entity's multi-machine sites, such as branch offices, datacenters, etc. These multi-machine sites are often at different physical locations (e.g., different buildings, different cities, different states, etc.) and are referred to below as multi-machine edge nodes.


Five such edge nodes 120-128 are illustrated in FIG. 1. Each of these edge nodes is shown to include at least one edge forwarding element 130-138 that exchanges data messages with one or more gateways through one or more secure connection links between the edge forwarding element and the gateway(s). As shown by edge node 124 and gateway 105, multiple secure connection links (e.g., multiple secure tunnels) can be established between one edge node and a gateway. When multiple such links are defined between an edge node and a gateway, each secure connection link in some embodiments is associated with a different physical network link between the edge node and an external network. For instance, to access external networks, an edge node in some embodiments has one or more commercial broadband Internet links (e.g., a cable modem, a fiber optic link) to access the Internet, an MPLS (multiprotocol label switching) link to access external networks through an MPLS provider's network, a wireless cellular link (e.g., a 5G LTE network), as further described below by reference to FIG. 4.


In FIG. 1, each gateway is used to connect two edge nodes through at least two secure connection links between the gateway and the two edge forwarding elements at the two edge nodes. In some embodiments, each secure connection link is formed as a VPN (virtual private network) tunnel between the gateway and an edge forwarding element. The collection of the edge forwarding elements, gateways, and the secure connections between the edge forwarding elements and the gateways forms the virtual network 100 for the particular entity that spans the two public cloud datacenters 110 and 112 to connect the edge nodes 120-128.


In some embodiments, secure connection links are defined between gateways to allow paths through the virtual network to traverse from one public cloud datacenter to another, while no such links are defined in other embodiments. Also, as the gateways 105 and 107 are multi-tenant gateways, they are used in some embodiments to define other virtual networks for other entities (e.g., other companies, organizations, etc.). Some such embodiments use tenant identifiers to create tunnels between a gateway and edge forwarding elements of a particular entity, and then use tunnel identifiers of the created tunnels to allow the gateway to differentiate data message flows that it receives from edge forwarding elements of one entity from data message flows that it receives along other tunnels of other entities. In other embodiments, the gateways are single tenant and are specifically deployed to be used by just one entity.



FIG. 1 illustrates a cluster of controllers 140 in the public cloud datacenter 110. This controller cluster 140 serves as a central point for managing (e.g., defining and modifying) configuration data that is provided to the edge nodes and/or gateways to configure some or all of the operations. In some embodiments, the controller cluster 140 has a set of manager servers that define and modify the configuration data, and a set of controller servers that distribute the configuration data to the edge forwarding elements and/or gateways. In some embodiments, the controller cluster 140 directs edge forwarding elements to use certain gateways (i.e., assigns gateway to the edge forwarding elements).


Although FIG. 1 illustrates the controller cluster 140 residing in one public cloud datacenter 110, the controllers in some embodiments reside in multiple different public cloud datacenters and/or in a private cloud datacenter. Also, some embodiments deploy one or more gateways in one or more private cloud datacenters, e.g., datacenters of the entity that deploys the gateways and provides the controllers for configuring the gateways to implement virtual networks.



FIG. 2 presents an example that illustrates the gateway 105 terminating its secure connection with the edge forwarding element 130 when it assesses that the quality of the network connection with this forwarding element has deteriorated by more than an acceptable amount. As further described below, each gateway iteratively performs a set of measurement operations that assess the quality of the network link used by an edge forwarding element to establish a secure connection link with the gateway. In some embodiments, these measurements quantify a number of factors (such as connectivity speed, packet loss, signal jitter, etc.) from which the gateway generates a score that quantifies the quality of a network connection.



FIG. 2 presents its example in two stages. In a first stage 202, the gateway 105 is shown to have a secure connection 205 with the edge forwarding element 130. Through this secure connection, the edge forwarding element 130 connects its edge node 120 to the virtual network 100 established by the gateways 105 and 107, the edge forwarding elements 130-138, and their secure connections.


In the second stage 204, the gateway 105 detects an unacceptable deterioration of service in the network connection that the edge forwarding element 130 uses for the secure connection 205. Hence, as shown, the gateway 105 terminates this connection link and rejects subsequent requests from the edge forwarding element 130 for a duration of time. The gateway takes these actions in order to prevent an edge forwarding element with a weak network connection from adversely affecting the performance of the virtual network.


For instance, in some embodiments, the gateways operate as route reflectors that obtain routes (i.e., definitions of routes) through the virtual network from other gateways and/or edge forwarding elements, and distribute these routes to other edge forwarding elements. In some embodiments, the gateways also distribute routes that they learn on their own. Distribution of routes, however, can become problematic when one edge node has a poor network connection with the gateway that distributes the routes. For instance, because of a poor connection, a gateway might have to iteratively try to transmit a new set of routes to the edge node with the poor network connection, only to fail iteratively. Such iterative operations, in turn, can adversely affect other operations of the gateway (e.g., data message processing delay or data message loss).


Hence, after detecting that the quality of the connection link with the edge forwarding element 130 has degraded below an acceptable amount, the gateway 105 terminates the secure connection link 205 with this forwarding element, and places this forwarding element on its blacklist for a duration of time so that it rejects all attempts by this forwarding element to establish the secure connection link 205 again. With this connection link down, the gateway forgoes forwarding routes to the edge forwarding element 130 for a duration of time.


After a gateway terminates a connection link with a particular edge forwarding element for a duration of time, that forwarding element and its corresponding multi-machine edge node can connect to the virtual network through another connection link with the same gateway or a connection link with another gateway, so long as these other connection links do not suffer from poor network connectivity (i.e., so long as the physical network link for these other connections still meets acceptable performance metrics). FIG. 3 presents an example that illustrates an edge forwarding element with a poor network connection to one gateway connecting to the virtual network 100 through another gateway. Again, this example is illustrated in two stages 302 and 304.


The first stage 302 shows the edge forwarding element 132 connecting to the virtual network 100 through two secure connection links 305 and 310 to the gateways 105 and 107. The second stage 304 then shows the gateway 105 detecting an unacceptable deterioration of service in the network connection that the edge forwarding element 132 uses for the secure connection 305, terminating this connection link and rejecting subsequent requests from the edge forwarding element 132 for a duration of time. Again, the gateway 105 takes these actions in order to prevent the edge forwarding element 132 with a weak network connection from adversely affecting the performance of the virtual network 100.


The second stage 304 also shows that while the gateway 105 terminates its connection with the edge forwarding element 132 for a duration of time, the gateway 107 maintains its connection link 310 with this edge forwarding element 132 during this time period. This is because, during this time period, the quality of the network link that is used for the connection link 310 does not degrade to an extent that would require the gateway 107 to terminate this link. Hence, during this period, the edge forwarding element 132 can connect to the virtual network 100 through the gateway 107. Through this connection, the edge forwarding element 132 can continue to receive routes from the gateway 107 for the virtual network 100.



FIG. 4 presents an example that illustrates that after the gateway 105 terminates a connection link 405 with the edge forwarding element 134 for a duration of time, this forwarding element 134 can connect to the virtual network 100 through another connection link 410 with the same gateway 105. This example is illustrated in two stages 402 and 404. The first stage 402 shows the edge forwarding element 134 connecting to the virtual network 100 through two secure connection links 405 and 410 to the gateway 105. In this example, one connection link 405 uses a cable modem to access the gateway 105 through the Internet, while the other connection link 410 uses an MPLS device to reach the gateway 105 through an MPLS network.


The second stage 404 shows the gateway 105 detecting an unacceptable deterioration of service for the connection link 405, terminating this connection link, and rejecting subsequent requests from the edge forwarding element 134 for a duration of time to re-establish this connection link. The gateway 105 takes these actions in order to prevent the weak network connectivity that is used by edge forwarding element 134 for this connection link 405 from adversely affecting the performance of the virtual network.


The second stage 404 also shows that while the gateway 105 terminates its connection link 405 with the edge forwarding element 134 for a duration of time, this gateway 105 maintains its connection link 410 with this edge forwarding element 134 during this time period. This is because, during this time period, the quality of the network link that is used for the connection link 410 does not degrade to an extent that would require the gateway 105 to terminate this link. Hence, during this period, the edge forwarding element 134 can connect to the virtual network 100 through the gateway 105 and the connection link 410. Through this connection link, the edge forwarding element 134 can continue to receive routes from the gateway 105 for the virtual network 100.



FIG. 5 illustrates a process 500 that a gateway periodically performs in some embodiments to maintain its sets of whitelisted connection endpoints and blacklisted connection endpoints. In some embodiments, the gateway performs this process once every N (e.g., 30, 60, 120, 240, etc.) minutes. As shown, the process 500 collects (at 505) network measurements that one or more measurement agents associated with the gateway have produced since the last time that the gateway performed the process 500. These network measurements express the quality of the network connections between the gateway and candidate edge endpoints for the gateway. The candidate edge endpoints for the gateway are specified in terms of their network addresses (e.g., IP addresses) in some embodiments.


The measurement agent set in some embodiments is co-located with the gateway in the same datacenter, so that the measurements that this set produces accurately reflect the network connections that the gateway experiences with its set of candidate edge endpoints. The measurement agent set, in some embodiments, produces a set of network measurements for each candidate edge endpoint for the gateway. For each candidate edge endpoint of the gateway, the measurement agent set produces several different types of network measurements in some embodiments. These measurements include data message delay, data message loss, signal jitter, etc. Examples of taking such measurements are further described in U.S. Pat. No. 9,722,815, which is incorporated herein by reference.


The gateway's candidate edge endpoints are specified in terms of their network addresses (e.g., IP addresses) on a candidate edge endpoint list that the gateway receives from the controller cluster as part of its configuration data. The gateway might have an active connection session with an edge endpoint on this candidate edge endpoint list, in which case the candidate edge endpoint is on the gateway's whitelist of endpoints. Alternatively, a candidate edge endpoint might be on the gateway's blacklist of endpoints when it is a candidate edge endpoint to connect with the gateway, but the gateway has determined that it should not connect to the edge endpoint for a duration of time.


After collecting (at 505) the network measurements, the process selects a candidate edge endpoint that is on its list of candidate edge endpoints. This endpoint might be on the whitelisted endpoint list or the blacklisted endpoint list of the gateway, depending on whether the gateway previously blacklisted the endpoint based on its poor network connection. At 515, the process computes a weighted score for the edge endpoint selected at 510 by using a series of weight values to combine different network measurements that the process has collected for the selected endpoint. In some embodiments, the computed score also accounts for scores that the process 500 previously computed for the selected edge endpoint in its previous iterations. In some such embodiments, the process 500 uses another set of weight values to combine the weighted sum produced with the most recent collected measurements with scores computed for the selected endpoint in the previous iterations of the process 500.


Next, at 520, the process determines whether the selected endpoint has been blacklisted (i.e., whether it is on the gateway blacklist of endpoints). If so, the process determines (at 525) whether the score computed at 515 is now an acceptable score for removing the candidate endpoint from the blacklist. Such a score would indicate that the network connection of the candidate endpoint has improved enough to be considered a good network connection. When the computed score is deemed (at 525) to be acceptable, the process 500 places (at 530) the candidate endpoint on the gateway's whitelist and then transitions to 545. The process also transitions to 545 when it determines (at 525) that the computed score is not acceptable.


When the process determines (at 520) that the selected endpoint has not been blacklisted (i.e., determines that the selected endpoint is on the gateway's whitelist of endpoints), the process determines (at 535) whether the score computed at 515 is still an acceptable score for keeping the candidate endpoint on the gateway's whitelist. When such a score is not acceptable, it would be indicative that the network connection of the selected candidate endpoint has deteriorated too much for it to be considered a good network connection. When the computed score is deemed (at 535) not to be acceptable, the process 500 places (at 540) the candidate endpoint on the gateway's blacklist and then transitions to 545. The process also transitions to 545 when it determines (at 535) that the computed score is still acceptable.


At 545, the process determines whether it has examined all the connection endpoints on its list of candidate endpoints. If not, it returns to 510 to select another candidate endpoint and to repeat its operations for this newly selected endpoint. When the process determines (at 545) that it has examined all the connection endpoints, the process 500 ends.



FIG. 6 illustrates examples of a blacklist 605 and a whitelist 610 of a gateway. As shown, each list specifies an endpoint identifier along with an endpoint network address. As described above, the gateway will reject connection requests from endpoints on the blacklist. The gateway will forgo performing certain operations (e.g., route re-distributions) for endpoints on the blacklist. In other words, the gateway will perform certain operations (e.g., route re-distributions) for endpoints on the whitelist.



FIG. 7 illustrates a process 700 that a gateway performs in some embodiments to establish a secure connection with an edge endpoint of an edge node's forwarding element. As shown, the process 700 starts when the gateway receives (at 705) a connection request from an edge endpoint associated with an edge node's forwarding element. Next, at 710, the process 700 determines whether the edge endpoint is on its blacklist. In some embodiments, the process makes this determination (at 710) by determining whether the network address of the requesting forwarding element is on its blacklist.


If so, the process rejects (at 715) this request, and then ends. Otherwise, the process performs (at 720) a tunnel set-up operation to establish a secure tunnel with the requesting edge endpoint, and then ends. In some embodiments, this tunnel that is defined requires the gateway and the edge endpoint to exchange control signals (e.g., BFD signals) to ensure that the tunnel is operational (i.e., to ensure that the endpoints of the tunnels and their intervening connection are still operational). In other embodiments, the tunnel defined at 720 does not need its endpoints to exchange control signals.



FIG. 8 illustrates a process 800 that a gateway performs to distribute a route to edge forwarding elements. In some embodiments, the gateways perform this operation as they serve as route reflectors that remove or reduce the amount of routes that the edge forwarding elements have to distribute to other edge forwarding elements. In some embodiments, the gateway performs this process 800 each time it identifies that it has received a new route from another device (e.g., another edge forwarding element, another gateway, etc.) for a particular entity. The gateway in some embodiments receives new routes from other devices dynamically through one or more routing protocols, such as standard protocols, like BGP (Border Gateway Protocol) and OSPF (Open Shortest Path First), or proprietary protocols, like VCRP (Velocloud Routing Protocol). VCRP is described in U.S. Published Patent Application 2017/0237710, which is incorporated herein by reference.


In some embodiments, the routes are defined in terms of next-hop forwarding records, with each record having a match criteria and a forwarding network address. In some embodiments, the match criteria can be specified just in terms of a destination IP address, or in terms of additional header values (e.g., other five tuple header values, such as source IP address, source and/or destination port addresses, protocol). After receiving route records through one of the standard or proprietary protocols, the edge forwarding element builds its routing table (e.g., builds it FIB, forwarding information base) based on the received routing tables.


As shown, the process 800 starts when the gateway identifies (at 805) a route to distribute to one or more edge forwarding elements of the particular entity. From the list of active connection sessions that it maintains for the entity, the process then selects (at 810) an edge endpoint that has an active connection session with the gateway. At 815, the process then determines whether this selected edge endpoint should receive the route. The edge endpoint should not receive the route when it is the endpoint that provided the route to the gateway. The particular entity's edge endpoints that are currently blacklisted, and hence do not have current active connection sessions with the gateway, also do not get the route as they are never selected at 810.


If the selected edge endpoint should not receive the route, the process 800 transitions to 825, which will be further described below. Otherwise, the process sends (at 820) the route's information to the selected edge endpoint by using a routing protocol, such as BGP, OSPF, or VCRP. As mentioned above, the route information is distributed as next-hop route records in some embodiments. After 820, the process transitions to 825, where it determines whether it has examined all the edge endpoints associated with its current active connection sessions for the particular entity. If not, the process returns to 810 to select another edge endpoint. Otherwise, the process 800 ends.


In some embodiments, the gateway detects an anomaly in routes that are maintained at a particular edge forwarding element at a particular edge node, and based on this detection, directs the particular edge forwarding element to perform a route reset operation to re-identify routes across the virtual network. The gateway detects the anomaly in some embodiments by detecting a drop in a number of routes maintained at the particular edge forwarding element that is larger than a threshold value.


In some embodiments, the gateway stores an old list of routes that are maintained at the particular edge forwarding element. It then identifies a new list of routes that are maintained at the particular edge forwarding element, and compares these two lists to identify routes in the old list that are not in the new list. When more than the threshold value of routes are missing from the new list, the gateway specifies that an anomaly has been detected. In some embodiments, the gateway obtains the new list of routes from the particular edge forwarding element. Also, in some embodiments, the gateway stores the new list as the old list when changes to the new list do not exceed a threshold value.


In some such embodiments, the detected anomaly can be caused by race conditions that incorrectly cause the particular edge forwarding element to filter out a subset of the routes when synchronizing routes with another device (e.g., routes from another edge forwarding element). A controller cluster in some embodiments can direct one edge forwarding element to establish with another edge forwarding element a tunnel for a direct connection session so that the two edge forwarding elements can forward data messages directly. In some embodiments, edge forwarding elements can be configured in a hub/spoke topology with one edge forwarding element serving as a hub for relaying data messages between the other edge forwarding elements that are deployed as spokes in this topology. When a deployed virtual network includes a hub/spoke topology between some or all of its edge forwarding elements, race conditions that cause one edge forwarding element to filter out or to forgo building its routing table can occur, and this can result in severe degradation of services provided by the edge forwarding elements.


When the particular edge forwarding element performs the route reset operation, the particular edge forwarding element in some embodiments directs all the gateways (including the anomaly-detecting gateway) to which it connects to synchronize the routes that they maintain with the particular edge forwarding element. Conjunctively, or alternatively, the particular forwarding element in some embodiments performs the route reset operation by directing other edge forwarding elements to synchronize the routes that they maintain with the particular edge forwarding element. In some embodiments, these routes are routes identified by one or more other edge forwarding elements and/or one or more gateways.



FIGS. 9-12 illustrate an example of the gateway directing an edge forwarding element to rebuild its route data for a virtual network after detecting an anomaly in the routes maintained by the forwarding element. FIG. 9 illustrates a virtual network 900 that is formed by two gateways 905 and 907 and four edge forwarding elements 930-936 at four edge nodes 920-926. The gateways are deployed in two public cloud datacenters 910 and 912, while the edge nodes are branch offices and/or datacenters of a particular entity (e.g., a particular corporation). Along with the gateways, a cluster of controllers 940 are also deployed in one or both of the public cloud datacenters 910 and 912.


The gateways serve as intermediate forwarding elements to define a path through the virtual network from one edge forwarding element to another edge forwarding element. The gateways also serve as route reflectors in that they distribute to the edge forwarding elements routes that they learn or routes that they obtain from other edge forwarding elements and/or other gateways. The controller cluster 940 in some embodiments provides instructions for directing the edge forwarding elements to connect to certain gateways, while in other embodiments it provides the gateways with instructions to connect to certain edge forwarding elements.


Also, in some embodiments, the gateways and/or controller cluster provide instructions (e.g., configuration data) to direct the edge forwarding elements to form direct connections with each other. In other words, one edge forwarding element in some embodiments can form a direct connection session (one that does not go through a gateway) with another edge forwarding element. In FIG. 9, the edge forwarding elements 930-932 have a direct connection session between them. Sometimes one edge forwarding element (e.g., an edge forwarding element in a datacenter) operates as a hub in a hub-spoke topology in which the other edge forwarding elements connect directly to it as spokes in the topology.



FIG. 9 shows a routing table 950 of the edge forwarding element 934 as storing twenty routes across the virtual network. Some of these routes traverse through a gateway while other routes traverse through another edge forwarding element that is directly connected to the edge forwarding element 934. As shown, the gateway 905 maintains data regarding these twenty routes that are stored by the edge forwarding element 934. In some embodiments, the gateway simply stores the number of routes maintained by the edge forwarding element 934. In other embodiments, it maintains a duplicate coup of the routes maintained by the edge forwarding element 934. In still other embodiments, it stores other data regarding the routes maintained by the edge forwarding element 934.



FIG. 10 shows the state of the virtual network 900 a period of time later after the time period shown in FIG. 9. In FIG. 10, the number of routes that the edge forwarding element 934 stores has dropped to 5. The gateway 905 detects this change, and directs the edge forwarding element 934 to reset its set of routes. FIG. 11 then shows the edge forwarding element 934 directing the gateways 905 and 910 to synchronize the routes that they maintain with the edge forwarding element 934. It also shows these gateways using a route sharing protocol (such as BGP, OSPF, or VCRP) to provide the routes that they learned and/or received with the edge forwarding element 934. FIG. 12 shows the routing table 950 of the edge forwarding element 934 as once again storing twenty routes across the virtual network.


In the example illustrated in FIG. 9-12, the edge forwarding element 934 performs the route reset operation by directing all the gateways (including the anomaly-detecting gateway) to which it connects to synchronize the routes that they maintain with the edge forwarding element 934. Conjunctively, or alternatively, the edge forwarding element 934 in other embodiments performs the route reset operation by directing other edge forwarding elements to synchronize the routes that they maintain with the particular edge forwarding element.



FIG. 13 illustrates a process 1300 performed by a gateway to detect an anomaly in the set of routes (across the virtual network) that is maintained by an edge forwarding element that has an active connection session with the gateway. The gateway periodically (e.g., once every 5 minutes, 15 minutes, 30 minutes, etc.) performs this process in order to ensure that the edge forwarding element's maintained set of routes have not been corrupted. In some embodiments, this corruption simply entails an unacceptable reduction in the number of maintained routes, while in other embodiments, it entails an unacceptable amount of changes (e.g., additions, modifications, etc.) to the maintained routes.


As shown, the process 1300 starts by the gateway obtaining (at 1305) data regarding the current state of the edge forwarding element's maintained set of routes. In some embodiments, this data is in the form of the number of routes, while in other embodiments the data includes the actual maintained routes. Next, at 1310, the process 1300 compares the current state of the set of routes maintained by the edge forwarding element with the prior state that the gateway obtained in its prior iteration of the process 1300.


This comparison in some embodiments simply entails comparing the current number of maintained routes with the number of maintained routes that it previously identified for the edge forwarding element. In other embodiments, this comparison involves performing a differential synchronization operation (e.g., using Merkel trees) to identify the differences between the current route list and the prior route list obtained from the edge forwarding element.


At 1315, the process determines whether the comparison operation (at 1310) identified changes between the old and current maintained route list that is beyond an acceptable threshold value of change. When just comparing the number of maintained routes, the determination (at 1315) is whether the number of changed routes exceeds a certain acceptable threshold. When the comparison involves comparing actual routes between the old and new lists, the determination (at 1315) involves a determination as to whether the number of changes in the routes exceeds a certain acceptable threshold.


When the process determines (at 1315) that the changes are not beyond an acceptable threshold, the process ends. Otherwise, when the changes are beyond an acceptable threshold, the gateway directs (at 1320) the edge forwarding element to perform a route reset operation, and then ends. As mentioned above, an edge forwarding element performs a route reset operation in some embodiments by directing the gateways, with which it has active connection sessions, to synchronize the routes that they maintain with the edge forwarding element.


In some embodiments, an edge forwarding element, or another module executing on the same device or another device in the forwarding element's associated edge node, performs the process 1300 to detect an anomaly in its maintained list of routes. To do this, the edge node monitoring agent (i.e., the edge forwarding element or the other module operating in its edge node) maintains one or more sets of prior routes of the edge forwarding element. During each check, the monitoring agent compares the prior route set(s) with the current route set of the edge forwarding element to identify any anomaly between the two sets that is beyond an acceptable threshold. Upon detecting this condition, the monitoring agent in some embodiments directs the edge forwarding element to perform a route reset operation to obtain new routes from the gateways. Conjunctively, or alternative, the monitoring agent in some embodiments generates a report to alert an administrator and makes this report available through email or text, and/or through a user interface of a management tool.


Many of the above-described features and applications are implemented as software processes that are specified as a set of instructions recorded on a computer readable storage medium (also referred to as computer readable medium). When these instructions are executed by one or more processing unit(s) (e.g., one or more processors, cores of processors, or other processing units), they cause the processing unit(s) to perform the actions indicated in the instructions. Examples of computer readable media include, but are not limited to, CD-ROMs, flash drives, RAM chips, hard drives, EPROMs, etc. The computer readable media does not include carrier waves and electronic signals passing wirelessly or over wired connections.


In this specification, the term “software” is meant to include firmware residing in read-only memory or applications stored in magnetic storage, which can be read into memory for processing by a processor. Also, in some embodiments, multiple software inventions can be implemented as sub-parts of a larger program while remaining distinct software inventions. In some embodiments, multiple software inventions can also be implemented as separate programs. Finally, any combination of separate programs that together implement a software invention described here is within the scope of the invention. In some embodiments, the software programs, when installed to operate on one or more electronic systems, define one or more specific machine implementations that execute and perform the operations of the software programs.



FIG. 14 conceptually illustrates a computer system 1400 with which some embodiments of the invention are implemented. The computer system 1400 can be used to implement any of the above-described hosts, controllers, gateway and edge forwarding elements. 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 1400 includes a bus 1405, processing unit(s) 1410, a system memory 1425, a read-only memory 1430, a permanent storage device 1435, input devices 1440, and output devices 1445.


The bus 1405 collectively represents all system, peripheral, and chipset buses that communicatively connect the numerous internal devices of the computer system 1400. For instance, the bus 1405 communicatively connects the processing unit(s) 1410 with the read-only memory 1430, the system memory 1425, and the permanent storage device 1435.


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


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


The bus 1405 also connects to the input and output devices 1440 and 1445. The input devices enable the user to communicate information and select commands to the computer system. The input devices 1440 include alphanumeric keyboards and pointing devices (also called “cursor control devices”). The output devices 1445 display images generated by the computer system. The output devices include printers and display devices, such as cathode ray tubes (CRT) or liquid crystal displays (LCD). Some embodiments include devices such as touchscreens that function as both input and output devices.


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


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


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


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


While the invention has been described with reference to numerous specific details, one of ordinary skill in the art will recognize that the invention can be embodied in other specific forms without departing from the spirit of the invention. For instance, several of the above-described embodiments deploy gateways in public cloud datacenters. However, in other embodiments, the gateways are deployed in a third-party's private cloud datacenters (e.g., datacenters that the third-party uses to deploy cloud gateways for different entities in order to deploy virtual networks for these entities). 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 maintaining a virtual wide area network (WAN) that spans at least one cloud datacenter separate from multi-machine edge nodes of an entity, the method comprising: at a gateway in the cloud datacenter that is used to establish the virtual WAN with a plurality of edge devices at a plurality of edge nodes: establishing secure connections with the plurality of edge devices at the plurality of edge nodes in order to establish the virtual WAN;examining route records maintained at a particular edge device for routes across the virtual WAN, in order to detect an anomaly in the route records indicative of the route records being corrupted;detecting the anomaly in route records maintained at the particular edge device for routes across the virtual WAN; andin response to the detecting, directing the particular edge device to perform a route reset operation to re-identify route records for routes across the virtual WAN.
  • 2. The method of claim 1, wherein detecting the anomaly comprises detecting a drop in a number of route records maintained at the particular edge device that is larger than a threshold value.
  • 3. The method of claim 1, wherein examining the route records comprises: at the gateway, storing an old list of route records that are maintained at the particular edge node;identifying a new list of route records that are maintained at the particular edge node;performing a differential synchronization operation that compares the old and new lists to identify changes to the new list; andwhen changes to the new list exceed a threshold value, detecting the anomaly.
  • 4. The method of claim 3, wherein identifying the new list comprises obtaining the new list from the particular edge node.
  • 5. The method of claim 3 further comprising storing the new list as the old list when changes to the new list do not exceed a threshold value.
  • 6. The method of claim 1, wherein the detected anomaly relates to race conditions that incorrectly cause the particular edge node to filter out a subset of the route records.
  • 7. The method of claim 6, wherein another edge node and the particular edge node are configured to establish a tunnel through which the two edge nodes forward data messages and forward routes to use to forward data messages to each other and to one or more gateways.
  • 8. The method of claim 7, wherein the other edge node and the particular edge node are configured in a hub/spoke topology.
  • 9. The method of claim 1, wherein the particular edge device performs the route reset operation by directing at least one other edge device to synchronize the set of route records maintained by the other edge device with the particular edge device.
  • 10. The method of claim 1, wherein the particular edge device performs the route reset operation by directing the gateway to synchronize the set of route records maintained by the gateway with the particular edge device.
  • 11. The method of claim 1, wherein the particular edge device performs the route reset operation by directing at least one other gateway to synchronize the set of route records maintained by the gateway with the particular edge device.
  • 12. The method of claim 1, wherein the route records comprise route records identified by other edge devices.
  • 13. The method of claim 1, wherein the route records comprise route records learned by the gateway.
  • 14. The method of claim 1, wherein the edge nodes comprise at least one of branch offices of an entity and datacenters of the entity.
  • 15. A non-transitory machine readable medium storing a program for execution by at least one processing unit of a device implementing a gateway to maintain a virtual wide area network (WAN) that spans at least one cloud datacenter separate from multi-machine edge nodes of an entity, the program comprising sets of instructions for: at the gateway in the cloud datacenter that is used to establish the virtual WAN with a plurality of edge devices at a plurality of edge nodes: establishing secure connections with the plurality of edge devices at the plurality of edge nodes in order to establish the virtual WAN;detecting an anomaly in route records maintained at a particular edge device for routes across the virtual WAN; andin response to the detecting, directing the particular edge device to perform a route reset operation to re-identify route records for routes across the virtual WAN.
  • 16. The non-transitory machine readable medium of claim 15, wherein the set of instructions for detecting the anomaly comprises a set of instructions for detecting a drop in a number of route records maintained at the particular edge device that is larger than a threshold value.
  • 17. The non-transitory machine readable medium of claim 15, wherein the set of instructions for detecting the anomaly comprises sets of instructions for: storing an old list of route records that are maintained at the particular edge node;identifying a new list of route records that are maintained at the particular edge node;performing a differential synchronization operation that compares the old and new lists to identify changes to the new list;when changes to the new list exceed a threshold value, specifying that an anomaly has been detected.
  • 18. The non-transitory machine readable medium of claim 17, wherein the set of instructions for identifying the new list comprises a set of instructions for obtaining the new list from the particular edge node.
  • 19. The non-transitory machine readable medium of claim 17, wherein the program further comprises a set of instructions for storing the new list as the old list when changes to the new list do not exceed a threshold value.
  • 20. The non-transitory machine readable medium of claim 15, wherein the detected anomaly relates to race conditions that incorrectly cause the particular edge node to filter out a subset of the route records.
Priority Claims (1)
Number Date Country Kind
201941043654 Oct 2019 IN national
US Referenced Citations (485)
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
7581022 Griffin et al. Aug 2009 B1
7680925 Sathyanarayana et al. Mar 2010 B2
7681236 Tamura et al. Mar 2010 B2
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 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
8566452 Goodwin et al. Oct 2013 B1
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
8799504 Capone et al. Aug 2014 B2
8804745 Sinn Aug 2014 B1
8806482 Nagargadde et al. Aug 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
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
9137334 Zhou Sep 2015 B2
9154327 Marino et al. Oct 2015 B1
9306949 Richard et al. Apr 2016 B1
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 Hsiao et al. Aug 2016 B2
9432245 Sorenson 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
9559951 Sajassi et al. Jan 2017 B1
9602389 Maveli et al. Mar 2017 B1
9608962 Chang Mar 2017 B1
9621460 Mehta et al. Apr 2017 B2
9641551 Kariyanahalli May 2017 B1
9665432 Kruse et al. May 2017 B2
9686127 Ramachandran et al. Jun 2017 B2
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
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
9906401 Rao Feb 2018 B1
9930011 Clemons, Jr. et al. Mar 2018 B1
9942787 Tillotson Apr 2018 B1
10038601 Becker et al. Jul 2018 B1
10057183 Salle et al. Aug 2018 B2
10057294 Xu Aug 2018 B2
10135789 Mayya et al. Nov 2018 B2
10142226 Wu et al. Nov 2018 B1
10178032 Freitas Jan 2019 B1
10187289 Chen et al. Jan 2019 B1
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
10326830 Singh Jun 2019 B1
10348767 Lee et al. Jul 2019 B1
10425382 Mayya et al. Sep 2019 B2
10454708 Mibu Oct 2019 B2
10454714 Mayya 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
10554538 Spohn et al. Feb 2020 B2
10560431 Chen et al. Feb 2020 B1
10565464 Han et al. Feb 2020 B2
10574528 Mayya et al. Feb 2020 B2
10594516 Cidon et al. Mar 2020 B2
10608844 Cidon et al. Mar 2020 B2
10637889 Ermagan et al. Apr 2020 B2
10666460 Cidon et al. May 2020 B2
10686625 Cidon et al. Jun 2020 B2
10749711 Mukundan et al. Aug 2020 B2
10778466 Cidon et al. Sep 2020 B2
10778528 Mayya et al. Sep 2020 B2
10805114 Cidon et al. Oct 2020 B2
10805272 Mayya et al. Oct 2020 B2
10826775 Moreno et al. Nov 2020 B1
10841131 Cidon et al. Nov 2020 B2
20020198840 Banka et al. Dec 2002 A1
20030088697 Matsuhira May 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
20050154790 Nagata et al. Jul 2005 A1
20050172161 Cruz et al. Aug 2005 A1
20050265255 Kodialam et al. Dec 2005 A1
20060002291 Alicherry et al. Jan 2006 A1
20060114838 Mandavilli et al. Jun 2006 A1
20060171365 Borella Aug 2006 A1
20060182034 Klinker et al. Aug 2006 A1
20060193247 Naseh et al. Aug 2006 A1
20060193252 Naseh et al. Aug 2006 A1
20070064604 Chen et al. Mar 2007 A1
20070064702 Bates et al. Mar 2007 A1
20070091794 Filsfils et al. Apr 2007 A1
20070121486 Guichard et al. May 2007 A1
20070130325 Lesser Jun 2007 A1
20070177511 Das 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
20080080509 Khanna et al. Apr 2008 A1
20080095187 Jung et al. Apr 2008 A1
20080144532 Chamarajanagar et al. Jun 2008 A1
20080219276 Shah Sep 2008 A1
20080240121 Xiong et al. Oct 2008 A1
20090013210 McIntosh et al. Jan 2009 A1
20090125617 Klessig et al. May 2009 A1
20090154463 Hines et al. Jun 2009 A1
20090247204 Sennett et al. Oct 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
20100088440 Banks et al. Apr 2010 A1
20100091823 Retana et al. Apr 2010 A1
20100107162 Edwards et al. Apr 2010 A1
20100118727 Draves et al. May 2010 A1
20100191884 Holenstein et al. Jul 2010 A1
20100223621 Joshi et al. Sep 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
20110007752 Silva et al. Jan 2011 A1
20110032939 Nozaki et al. Feb 2011 A1
20110040814 Higgins Feb 2011 A1
20110075674 Li 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
20120008630 Ould-Brahim Jan 2012 A1
20120027013 Napierala Feb 2012 A1
20120136697 Peles et al. May 2012 A1
20120157068 Eichen et al. Jun 2012 A1
20120173694 Yan et al. Jul 2012 A1
20120173919 Patel et al. Jul 2012 A1
20120221955 Raleigh et al. Aug 2012 A1
20120250682 Vincent et al. Oct 2012 A1
20120250686 Vincent et al. Oct 2012 A1
20120300615 Kempf et al. Nov 2012 A1
20120317291 Wolfe Dec 2012 A1
20130019005 Hui et al. Jan 2013 A1
20130021968 Reznik et al. Jan 2013 A1
20130044764 Casado et al. Feb 2013 A1
20130051399 Zhang et al. Feb 2013 A1
20130054763 Merwe et al. Feb 2013 A1
20130103834 Dzerve et al. Apr 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
20130173788 Song Jul 2013 A1
20130182712 Aguayo et al. Jul 2013 A1
20130191688 Agarwal Jul 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
20130283364 Chang et al. Oct 2013 A1
20130286846 Atlas et al. Oct 2013 A1
20130301642 Radhakrishnan et al. Nov 2013 A1
20130308444 Sem-Jacobsen 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
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
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
20140126418 Brendel et al. May 2014 A1
20140156818 Hunt Jun 2014 A1
20140156823 Liu et al. Jun 2014 A1
20140164560 Ko et al. Jun 2014 A1
20140164617 Jalan et al. Jun 2014 A1
20140173113 Vemuri et al. Jun 2014 A1
20140173331 Martin et al. Jun 2014 A1
20140208317 Nakagawa Jul 2014 A1
20140219135 Li et al. Aug 2014 A1
20140223507 Xu 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
20140317440 Biermayr et al. Oct 2014 A1
20140337500 Lee Nov 2014 A1
20140341109 Cartmell et al. Nov 2014 A1
20140372582 Ghanwani et al. Dec 2014 A1
20150016249 Mukundan et al. Jan 2015 A1
20150029864 Raileanu et al. Jan 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
20150134777 Onoue May 2015 A1
20150139238 Pourzandi et al. May 2015 A1
20150146539 Mehta et al. May 2015 A1
20150163152 Li 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
20150271104 Chikkamath et al. Sep 2015 A1
20150271303 Neginhal et al. Sep 2015 A1
20150312142 Barabash et al. Oct 2015 A1
20150334696 Gu et al. Nov 2015 A1
20150349978 Wu et al. Dec 2015 A1
20150350907 Timariu et al. Dec 2015 A1
20150363733 Brown Dec 2015 A1
20150372943 Hasan et al. Dec 2015 A1
20150372982 Herle et al. Dec 2015 A1
20150381407 Wang et al. Dec 2015 A1
20150381493 Bansal et al. Dec 2015 A1
20160035183 Buchholz et al. Feb 2016 A1
20160036924 Koppolu et al. Feb 2016 A1
20160037434 Gopal et al. Feb 2016 A1
20160072669 Saavedra Mar 2016 A1
20160080502 Yadav et al. Mar 2016 A1
20160105392 Thakkar et al. Apr 2016 A1
20160105471 Nunes et al. Apr 2016 A1
20160134528 Lin et al. May 2016 A1
20160134591 Liao et al. May 2016 A1
20160142373 Ossipov 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
20160197834 Luft Jul 2016 A1
20160197835 Luft Jul 2016 A1
20160198003 Luft Jul 2016 A1
20160210209 Verkaik et al. Jul 2016 A1
20160218947 Hughes et al. Jul 2016 A1
20160255169 Kovvuri et al. Sep 2016 A1
20160261495 Xia et al. Sep 2016 A1
20160261639 Xu Sep 2016 A1
20160269926 Sundaram Sep 2016 A1
20160308762 Teng et al. Oct 2016 A1
20160315912 Mayya et al. Oct 2016 A1
20160323377 Einkauf et al. Nov 2016 A1
20160352588 Subbarayan et al. Dec 2016 A1
20160359738 Sullenberger et al. Dec 2016 A1
20160366187 Kamble Dec 2016 A1
20160380886 Blair et al. Dec 2016 A1
20170005986 Bansal et al. Jan 2017 A1
20170012870 Blair et al. Jan 2017 A1
20170019428 Cohn Jan 2017 A1
20170026283 Williams et al. Jan 2017 A1
20170026355 Mathaiyan et al. Jan 2017 A1
20170034046 Cai et al. Feb 2017 A1
20170034129 Sawant 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
20170063794 Jain et al. Mar 2017 A1
20170064005 Lee Mar 2017 A1
20170093625 Pera et al. Mar 2017 A1
20170097841 Chang et al. Apr 2017 A1
20170104755 Arregoces et al. Apr 2017 A1
20170118173 Arramreddy et al. Apr 2017 A1
20170123939 Maheshwari et al. May 2017 A1
20170126564 Mayya et al. May 2017 A1
20170134186 Mukundan et al. May 2017 A1
20170139789 Fries et al. May 2017 A1
20170155557 Desai et al. Jun 2017 A1
20170163473 Sadana et al. Jun 2017 A1
20170171310 Gardner Jun 2017 A1
20170181210 Nadella et al. Jun 2017 A1
20170195169 Mills 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
20170237710 Mayya 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
20170279803 Desai et al. Sep 2017 A1
20170289002 Ganguli et al. Oct 2017 A1
20170310641 Jiang et al. Oct 2017 A1
20170310691 Vasseur et al. Oct 2017 A1
20170317974 Masurekar et al. Nov 2017 A1
20170337086 Zhu et al. Nov 2017 A1
20170339054 Yadav et al. Nov 2017 A1
20170339070 Chang et al. Nov 2017 A1
20170364419 Lo Dec 2017 A1
20170366445 Nemirovsky et al. Dec 2017 A1
20170374174 Evens et al. Dec 2017 A1
20180006995 Bickhart et al. Jan 2018 A1
20180007123 Cheng et al. Jan 2018 A1
20180014051 Phillips et al. Jan 2018 A1
20180034668 Mayya et al. Feb 2018 A1
20180041425 Zhang Feb 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
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
20180114569 Strachan et al. Apr 2018 A1
20180131615 Zhang May 2018 A1
20180131720 Hobson et al. May 2018 A1
20180145899 Rao May 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
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
20180260125 Botes et al. Sep 2018 A1
20180262468 Kumar Sep 2018 A1
20180270104 Zheng et al. Sep 2018 A1
20180278541 Wu et al. Sep 2018 A1
20180295529 Jen et al. Oct 2018 A1
20180302286 Mayya et al. Oct 2018 A1
20180302321 Manthiramoorthy et al. Oct 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
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
20190014038 Ritchie Jan 2019 A1
20190020588 Twitchell, Jr. Jan 2019 A1
20190020627 Yuan Jan 2019 A1
20190028552 Johnson et al. Jan 2019 A1
20190036810 Michael 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
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
20190140889 Mayya et al. May 2019 A1
20190140890 Mayya 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
20190238364 Boutros et al. Aug 2019 A1
20190238449 Michael et al. Aug 2019 A1
20190238450 Michael et al. Aug 2019 A1
20190268421 Markuze et al. Aug 2019 A1
20190280962 Michael et al. Sep 2019 A1
20190280963 Michael et al. Sep 2019 A1
20190280964 Michael et al. Sep 2019 A1
20190313907 Khachaturian et al. Oct 2019 A1
20190319847 Nahar et al. Oct 2019 A1
20190364099 Thakkar et al. Nov 2019 A1
20190372888 Michael et al. Dec 2019 A1
20190372889 Michael et al. Dec 2019 A1
20190372890 Michael et al. Dec 2019 A1
20200014615 Michael et al. Jan 2020 A1
20200014616 Michael et al. Jan 2020 A1
20200014661 Mayya 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
20200059420 Abraham Feb 2020 A1
20200059459 Abraham et al. Feb 2020 A1
20200092207 Sipra et al. Mar 2020 A1
20200097327 Beyer 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
20200153736 Liebherr et al. May 2020 A1
20200177503 Hooda et al. Jun 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 Jul 2020 A1
20200244721 S et al. Jul 2020 A1
20200267184 Vera-Schockner Aug 2020 A1
20200280587 Janakiraman et al. Sep 2020 A1
20200296026 Michael et al. Sep 2020 A1
20200366530 Mukundan et al. Nov 2020 A1
20200366562 Mayya et al. Nov 2020 A1
20200382345 Zhao et al. Dec 2020 A1
20210006490 Michael et al. Jan 2021 A1
20210029088 Mayya et al. Jan 2021 A1
Foreign Referenced Citations (10)
Number Date Country
1912381 Apr 2008 EP
3041178 Jul 2016 EP
3509256 Jul 2019 EP
03073701 Sep 2003 WO
2012167184 Dec 2012 WO
2017083975 May 2017 WO
2019070611 Apr 2019 WO
2019094522 May 2019 WO
2020018704 Jan 2020 WO
2020101922 May 2020 WO
Non-Patent Literature Citations (29)
Entry
Non-Published Commonly Owned U.S. Appl. No. 16/945,700, filed Jul. 31, 2020, 37 pages, Nicira, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/945,867, filed Aug. 1, 2020, 30 pages, Nicira, Inc.
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. 16/656,555, filed Oct. 17, 2019, 40 pages, Nicira, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,363, filed Oct. 24, 2019, 129 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,379, filed Oct. 24, 2019, 123 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,402, filed Oct. 24, 2019, 128 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,427, filed Oct. 24, 2019, 165 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,489, filed Oct. 24, 2019, 165 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,510, filed Oct. 24, 2019, 165 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,531, filed Oct. 24, 2019, 135 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,570, filed Oct. 24, 2019, 141 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,587, filed Oct. 24, 2019, 145 pages, VMware, Inc.
Non-Published Commonly Owned U.S. Appl. No. 16/662,591, filed Oct. 24, 2019, 130 pages, VMware, Inc.
Non-published Commonly Owned U.S. Appl. No. 16/699,719, filed Dec. 1, 2019, 42 pages, Nicira, Inc.
Non-published Commonly Owned U.S. Appl. No. 16/721,964, filed Dec. 20, 2019, 39 pages, VMware, Inc.
Non-published Commonly Owned U.S. Appl. No. 16/724,154, filed Dec. 20, 2019, 27 pages, Nicira, Inc.
Non-published Commonly Owned U.S. Appl. No. 16/785,628, filed Feb. 9, 2020, 44 pages, Nicira, Inc.
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.
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.
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.
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.
Non-published Commonly Owned U.S. Appl. No. 15/803,964, filed Nov. 6, 2017, 15 pages, The Mode Group.
Non-published Commonly Owned U.S. Appl. No. 16/216,235, filed Dec. 11, 2018, 19 pages, The Mode Group.
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.
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.
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.
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.
Related Publications (1)
Number Date Country
20210126853 A1 Apr 2021 US