Network topology for efficient and performant virtual WANs
The present application relates to a system, apparatus, and method of selecting a topology for a virtual wide area network (vWAN). A wide area network (WAN) includes a plurality of geographically distributed entry points and a plurality of edge datacenters. Each edge datacenter is associated with an entry point and includes computing resources for hosting a vWAN hub. A vWAN manager is configured to: obtain latency measurements from different metropolitan regions to the entry points; receive a set of the metropolitan regions and a number of expected connections for each metropolitan region; and select a plurality of vWAN hub locations at selected edge datacenters, each selected edge datacenter being associated with a non-empty subset of the metropolitan regions. A weighted latency for the plurality of vWAN hub locations based on the latency measurements and the expected connections is minimized for a number of the selected edge datacenters.
1 . A wireless wide area network (WAN), comprising:
a plurality of geographically distributed entry points including routers connected to other networks;
a plurality of edge datacenters, each edge datacenter associated with one of the plurality of geographically distributed entry points, each edge datacenter including computing resources capable of hosting a virtual WAN hub; and
a management datacenter including a memory storing computer-executable instructions, and at least one processor configured to execute the computer-executable instructions to:
obtain latency measurements from a plurality of clients, each client associated with one of a plurality of different metropolitan regions, to the plurality of geographically distributed entry points of the WAN;
receive, from an enterprise client, a set of the metropolitan regions and a number of expected connections for each metropolitan region; and
instantiate a plurality of virtual WAN hubs at selected edge datacenters of the plurality of edge datacenters, each selected edge datacenter being associated with a non-empty subset of the metropolitan regions, wherein a weighted latency for the selected edge datacenters based on the latency measurements and the expected connections is minimized for a number of the selected edge datacenters.
2 . The WAN of claim 1 , wherein to obtain the latency measurements, the at least one processor is configured to execute the computer-executable instructions to:
measure, for each of a plurality of clients, a latency from a respective client to an entry point of the WAN for a service within the WAN;
determine a metropolitan region of the respective client and the entry point for each latency measurement; and
aggregate the latency measurements for clients within metropolitan regions for each entry point having a threshold number of latency measurements to determine the latency measurement between a metropolitan region and an entry point.
3 . The WAN of claim 1 , wherein the at least one processor is configured to execute the computer-executable instructions to receive, from the enterprise client, a service level objective defining an expected latency for one or more of the metropolitan regions, wherein to instantiate the plurality of virtual WAN hubs, the at least one processor is configured to execute the computer-executable instructions to select only edge datacenters associated with entry points that satisfy the expected latency for a metropolitan region.
4 . The WAN of claim 1 , wherein to instantiate the plurality of virtual WAN hubs, the at least one processor is configured to execute the computer-executable instructions to solve a mixed integer linear program (MILP) to minimize a sum of latencies for selected entry points across the set of metropolitan regions for the number of expected connections for each metropolitan region.
5 . The WAN of claim 4 , wherein the MILP is subject to:
a first constraint that connections from one client metropolitan region go to only one virtual WAN hub associated with an entry point; and
a second constraint that only one edge datacenter associated with an entry point is selected for one metropolitan region.
6 . The WAN of claim 5 , wherein the MILP is further subject to a third constraint that the number of selected edge datacenters is less than a threshold.
7 . The WAN of claim 6 , wherein the at least one processor is configured to execute the computer-executable instructions to solve the MILP for different values of the threshold to determine points on a Pareto optimal frontier for the latency and the number of selected edge datacenters.
8 . The WAN of claim 7 , wherein the at least one processor is configured to execute the computer-executable instructions to select the number of edge datacenters based on a mean of a minimum feasible number of edge datacenters and a lowest latency number of edge datacenters.
9 . The WAN of claim 4 , wherein the at least one processor is configured to execute the computer-executable instructions to select a number of virtual WAN hubs to instantiate at each of the selected datacenters based on the number of expected connections for each metropolitan region associated with a respective edge datacenter and a maximum number of connections per virtual WAN hub.
10 . The WAN of claim 1 , wherein the at least one processor is configured to execute the computer-executable instructions to:
evaluate an average latency for the virtual WAN over a plurality of time windows using an exponentially weighted moving average;
reselect the selected datacenters based on the average latency; and
migrate one or more virtual WAN hubs to a newly selected edge datacenter from a datacenter associated with an edge datacenter that is no longer selected.
11 . A method comprising:
obtaining latency measurements from a plurality of clients, each client associated with one of a plurality of different metropolitan regions, to different entry points of a wide area network (WAN);
receiving, from an enterprise client, a set of the metropolitan regions and a number of expected connections for each metropolitan region; and
instantiating a plurality of virtual WAN hubs at selected datacenters within the WAN, each selected datacenter being associated with an entry point of the WAN and a non-empty subset of the metropolitan regions, wherein a weighted latency for the selected datacenters based on the latency measurements and the expected connections is on a Pareto optimal frontier of the weighted latency for a number of the selected datacenters.
12 . The method of claim 11 , wherein obtaining the latency measurements comprises:
measuring, for each of a plurality of clients, a latency from a respective client to an entry point of the WAN for a service within the WAN;
determining a metropolitan region of the respective client and the entry point for each latency measurement; and
aggregating the latency measurements for clients within metropolitan regions for each entry point having a threshold number of latency measurements to determine the latency measurement between a metropolitan region and an entry point.
13 . The method of claim 11 , further comprising receiving, from the enterprise client, a service level objective defining an expected latency for one or more of the metropolitan regions, wherein instantiating the plurality of virtual WAN hubs comprises selecting only datacenters associated with entry points that satisfy the expected latency for a metropolitan region.
14 . The method of claim 11 , wherein instantiating the plurality of virtual WAN hubs comprises solving a mixed integer linear program (MILP) to minimize a sum of latencies for selected entry points across the set of metropolitan regions for the number of expected connections for each metropolitan region.
15 . The method of claim 14 , wherein the MILP is subject to:
a first constraint that connections from one client metropolitan region go to only one virtual WAN hub associated with an entry point; and
a second constraint that only one datacenter associated with an entry point is selected for one client metropolitan.
16 . The method of claim 15 ; wherein the MILP is further subject to a third constraint that the number of entry points associated with a hub is less than a threshold.
17 . The method of claim 16 , wherein instantiating the plurality of virtual WAN hubs comprises solving the MILP for different values of the threshold to determine points on a Pareto optimal frontier.
18 . The method of claim 17 , wherein instantiating the plurality of virtual WAN hubs comprises selecting a number of entry points based on a mean of a minimum feasible number of entry points and a lowest latency number of entry points.
19 . The method of claim 14 , further comprising selecting a number of virtual WAN hubs to instantiate at each of the selected datacenters based on the number of expected connections for each metropolitan region associated with an entry point and a maximum number of connections per virtual WAN hub.
20 . The method of claim 11 , further comprising:
evaluating an average latency over a plurality of time windows using an exponentially weighted moving average;
reselecting the selected datacenters based on the average latency; and
migrating one or more virtual WAN hubs to a datacenter associated with a newly selected entry point from a datacenter associated with an entry point that is no longer selected.