Risk Mitigation in Data Center Networks Using Virtual Machine Sharing

1. A method, comprising: identifying a smallest M number of data centers (DCs) in an overlay network for K-connect survivability associated with an aggregation request for an aggregation DC and a smallest V number of virtual machines (VMs) among the M DCs, including: when K-connect survivability is satisfied for the M number of DCs: determining a number of VMs at each of the M DCs, including determining a number of working VMs and a number of protecting VMs, respectively; generating a VM-share table according to the aggregation request, wherein a minimum number of shared protecting VMs is calculated for a set of risks associated with each of the M DCs; and updating the number of working VMs and the number of protecting VMs based on the minimum number of shared protecting VMs for each of the M DCs, wherein K represents a minimum number of DCs that remain accessible to the aggregation DC, and wherein the overlay network represents a physical network.

2. The method of claim 1 , further comprising: for each of a plurality of aggregation requests for the overlay network, identifying the smallest M number of DCs for K-connect survivability and the smallest V number of VMs among the M DCs.

3. The method of claim 1 , wherein the number of VMs at each of the M DCs is given by V/K.

4. The method of claim 1 , wherein determining that K-connect survivability is satisfied includes: determining the number of VMs at each of the M DCs for the aggregation request; calculating a current value of an integrated factor I for each of m DCs that are unselected; sorting the m DCs according to I; and adding a DC from the m DCs having a lowest value for I to the M DCs.

6. The method of claim 1 , wherein the VM-share table is generated for each aggregation request r in a set of aggregation requests R, wherein the VM-share table includes value pairs (s i , v ijr ), wherein V ijr is a number of protecting VMs required at DC j when a risk s i in the set of risks S occurs for aggregation request r, and wherein the minimum number of shared protecting VMs is calculated as Max ∀ s i ∈ S ⁡ ( ∑ ∀ r ∈ R ⁢ v ijr ) .

7. An article of manufacture, comprising: a non-transitory, computer-readable medium; and computer executable instructions stored on the computer-readable medium, the instructions readable by a processor and, when executed, for causing the processor to: identify a smallest M number of data centers (DCs) in an overlay network for K-connect survivability associated with an aggregation request for an aggregation DC and a smallest V number of virtual machines (VMs) among the M DCs, including: when K-connect survivability is satisfied for the M number of DCs: determine a number of VMs at each of the M DCs, including determining a number of working VMs and a number of protecting VMs, respectively; generate a VM-share table according to the aggregation request, wherein a minimum number of shared protecting VMs is calculated for a set of risks associated with each of the MDCs; and update the number of working VMs and the number of protecting VMs based on the minimum number of shared protecting VMs for each of the MDCs, wherein K represents a minimum number of DCs that remain accessible to the aggregation DC, and wherein the overlay network represents a physical network.

8. The article of manufacture of claim 7 , further comprising instructions to: for each of a plurality of aggregation requests for the overlay network, identify the smallest M number of DCs for K-connect survivability and the smallest V number of VMs among the M DCs.

9. The article of manufacture of claim 7 , wherein the number of VMs at each of the M DCs is given by V/K.

10. The article of manufacture of claim 7 , wherein the instructions to determine that K-connect survivability is satisfied include instructions to: determine the number of VMs at each of the MDCs for the aggregation request; calculate a current value of an integrated factor I for each of m DCs that are unselected; sort the m DCs according to I; and add a DC from the m DCs having a lowest value for I to the M DCs.

12. The article of manufacture of claim 7 , wherein the VM-share table is generated for each aggregation request r in a set of aggregation requests R, wherein the VM-share table includes value pairs (s i , v ijr ), wherein V ijr is a number of protecting VMs required at DC j when a risk s i in the set of risks S occurs for aggregation request r, and wherein the minimum number of shared protecting VMs is calculated as Max ∀ s i ∈ S ⁡ ( ∑ ∀ r ∈ R ⁢ v ijr ) .

13. A management system, comprising: a memory; a processor coupled to the memory; and processor-executable instructions stored on the memory, the instructions readable by the processor and, when executed, for causing the processor to: identify a smallest M number of data centers (DCs) in an overlay network for K-connect survivability associated with an aggregation request for an aggregation DC and a smallest V number of virtual machines (VMs) among the M DCs, including: when K-connect survivability is satisfied for the M number of DCs: determine a number of VMs at each of the M DCs, including determining a number of working VMs and a number of protecting VMs, respectively; generate a VM-share table according to the aggregation request, wherein a minimum number of shared protecting VMs is calculated for a set of risks associated with each of the MDCs; and update the number of working VMs and the number of protecting VMs based on the minimum number of shared protecting VMs for each of the MDCs, wherein K represents a minimum number of DCs that remain accessible to the aggregation DC, and wherein the overlay network represents a physical network.

14. The management system of claim 13 , further comprising instructions to: for each of a plurality of aggregation requests for the overlay network, identify the smallest M number of DCs for K-connect survivability and the smallest V number of VMs among the M DCs.

15. The management system of claim 13 , wherein the number of VMs at each of the M DCs is given by V/K.

16. The management system of claim 13 , wherein the instructions to determine that K-connect survivability is satisfied include instructions to: determine the number of VMs at each of the MDCs for the aggregation request; calculate a current value of an integrated factor I for each of m DCs that are unselected; sort the m DCs according to I; and add a DC from the m DCs having a lowest value for I to the M DCs.

18. The management system of claim 13 , wherein the VM-share table is generated for each aggregation request r in a set of aggregation requests R, wherein the VM-share table includes value pairs (s i , v ijr ), wherein V ijr is a number of protecting VMs required at DC j when a risk s i in the set of risks S occurs for aggregation request r, and wherein the minimum number of shared protecting VMs is calculated as Max ∀ s i ∈ S ⁡ ( ∑ ∀ r ∈ R ⁢ v ijr ) .