Apparatus, method, and manufacture for cloud network updating

1. A method for computer network design, comprising:

receiving network topology information that is based on a topology of a network, wherein the network includes a plurality of links, and wherein links of the plurality of links have capacities associated therewith;

receiving shared risk link group information based on shared risk link groups in the network;

receiving demand information based on network demand in the network;

receiving traffic solver parameters for the network;

generating a set of inequalities based on the network topology information, the shared risk link group information, the demand information, and the traffic solver parameters, wherein the set of inequalities is based upon a dynamic and global traffic engineering model of traffic routing;

generating a plurality of capacity plans including a capacity plan, such that the ft capacity plan based on the set of inequalities and at least one objective, and such that the capacity plans of the plurality of capacity plans correspond to different future dates, wherein the capacity plan includes corresponding target capacities for corresponding links of the plurality of links in the network; and

updating the network based on the capacity plan such that the links of the plurality of links in the network have updated capacities that correspond to the target capacities, and such that the capacity of at least one of the links of the plurality of links in the network is increased based on the capacity plan.

2. The method of claim 1 , further comprising validating the capacity plan by running a simulation based on the capacity plan.

3. The method of claim 1 , wherein the shared risk link group information includes information about groups of logical links in the network in which multiple logical links in the group of logical links corresponds to a same physical link.

4. The method of claim 1 , wherein the demand information includes future forecasts of bandwidth demand for the network.

5. The method of claim 1 , wherein the topology information includes a directed graph that includes a representation of a set of physical routers and links comprising the network.

6. The method of claim 1 , wherein the objective includes a cost reduction.

7. The method of claim 1 , further comprising updating the network upon a future date becoming the present date and generating a new plurality of capacity plans upon the network being updated.

8. A processor-readable storage medium, having stored thereon process-executable code, that, upon execution by at least one processor, enables actions, comprising:

generating a set of inequalities based on network topology information, shared risk link group information, demand information, and traffic solver parameters, wherein the network topology information is based on a topology of a network, the network includes a plurality of links, the shared risk link group information based on shared risk link groups in the network, the demand information is based on network demand in the network, links of the plurality of links have corresponding capacities, and wherein the set of inequalities is based upon a dynamic global traffic engineering model of traffic routing;

generating a plurality of capacity plans including a capacity plan, such that the capacity plan based on the set of inequalities and at least one objective, and such that the capacity plans of the plurality of capacity plans correspond to different future dates, wherein the capacity plan includes corresponding target capacities for corresponding links of the plurality of links in the network; and

generating an updated capacity plan based on updated network topology information, updated shared risk link group information, updated demand information, and updated traffic solver parameters, wherein the updated network is the network after the network is updated based on the capacity plan such that corresponding links of the plurality of links in the network have updated capacities that corresponds to the corresponding target capacities such that at least the capacity of at least one of the links of the plurality of links in the network is increased based on the capacity plan.

9. The processor-readable storage medium of claim 8 , the actions further comprising validating the capacity plan by running a simulation based on the capacity plan.

10. The processor-readable storage medium of claim 8 , wherein the shared risk link group information includes information about groups of logical links in the network in which multiple logical links in the group of logical links correspond to a same physical link.

11. The processor-readable storage medium of claim 8 , wherein the demand information includes future forecasts of bandwidth demand for the network.

12. The processor-readable storage medium of claim 8 , wherein the topology information includes a directed graph that includes a representation of a set of physical routers and links comprising the network.

13. A system for computer network design, comprising: an operating memory adapted to store run-time data for the computing device; and at least one storage memory and at least one processor that are respectively adapted to store and execute processor-executable code that, in response to execution, enables the computing device to perform actions, including:

generating a set of inequalities based on network topology information, shared risk link group information, demand information, and traffic solver parameters, wherein the network topology information is based on a topology of a network, the network includes a plurality of links, the shared risk link group information based on shared risk link groups in the network, the demand information is based on network demand in the network, links of the plurality of links have corresponding capacities, and wherein the set of inequalities is based upon a model of traffic routing that is based on selection of routes based on dynamic and global traffic engineering;

generating a plurality of capacity plans including a capacity plan, such that the capacity plan based on the set of inequalities and at least one objective, and such that the capacity plans of the plurality of capacity plans correspond to different future dates, wherein the capacity plan includes corresponding target capacities for corresponding links of the plurality of links in the network; and

generating an updated capacity plan based on the set of inequalities, wherein the updated capacity plan includes a target capacity for each link of the plurality of links in the updated network.

14. The system of claim 13 , the actions further including generating an updated set of inequalities based on updated network topology information, updated shared risk link group information, updated demand information, and updated traffic solver parameters, wherein the updated network is the network after the network is updated based on the capacity plan such that corresponding links of the plurality of links in the network have updated capacities that corresponds to the corresponding target capacities such that at least the capacity of at least one of the links of the plurality of links in the network is increased based on the capacity plan, and wherein the updated capacity plan is based on the updated set of inequalities.

15. The system of claim 13 , the actions further including validating the capacity plan by running a simulation based on the capacity plan.

16. The system of claim 13 , wherein the shared risk link group information includes information about groups of logical links in the network in which each logical link in the group of logical links corresponds to a same physical link.

17. The system of claim 13 , wherein the demand information includes future forecasts of bandwidth demand for the network.

18. The system of claim 13 , wherein the topology information includes a directed graph that includes a representation of a set of physical routers and links comprising the network.

19. The system of claim 13 , wherein the objective includes a cost reduction.

20. The system of claim 13 , the actions further including updating the network upon a future date becoming the present date and generating a new plurality of capacity plans upon the network being updated.