Dynamic inter-cloud placement of virtual network functions for a slice

Patent metadata

Field	Value
Publication number	US-11329901-B2
Application number	US-202117195058-A
Country	US
Kind code	B2
Filing date	Mar 8, 2021
Priority date	Jan 24, 2019
Publication date	May 10, 2022
Grant date	May 10, 2022

Abstract

Examples can include an optimizer that dynamically determines where to place virtual network functions for a slice in a distributed Telco cloud network. The optimizer can determine a slice path that complies with a service level agreement and balances network load. The virtual network functions of the slice can be provisioned at clouds identified by the optimal slice path. In one example, performance metrics are normalized, and tenant-selected weights can be applied. This can allow the optimizer to prioritize particular SLA attributes in choosing an optimal slice path.

First claim

What is claimed is:

1. A method for dynamic inter-cloud placement of virtual network functions (“VNFs”) in a slice path, comprising:
determining candidate slice paths relative to an edge cloud, wherein the candidate slice paths are different permutations of VNF-to-cloud assignments, the permutations being limited by a number of VNFs or a maximum number of intercloud links;
scoring candidate slice paths based on performance metric values and load values for the candidate slice paths, wherein the performance metric corresponds to a service level agreement (“SLA”) attribute;
selecting a composite slice path based on the scores of the candidate slice paths; and
provisioning the VNFs at corresponding clouds specified by the selected composite slice path.

2. The method of claim 1 , wherein the respective load values of the candidate slice paths are determined by at least summing loads for clouds in the respective candidate slice path.

3. The method of claim 1 , further comprising:
creating a matrix that maps the performance metric to clouds in the candidate slice paths, wherein the performance metric of a candidate slice path is derived from values in the matrix; and
when at least one candidate slice path complies with the SLA attribute, eliminating candidate slice paths that are non-compliant with the SLA requirement.

4. The method of claim 3 , wherein the SLA attribute is a minimum bandwidth.

5. The method of claim 1 , further comprising:
detecting network congestion or a performance metric below an SLA requirement;
determining new candidate slice paths; and
provisioning at least one of the VNFs at a new cloud specified by a new composite slice path, the new composite slice path having a best composite score among new candidate slice paths based on a combination of a weighted performance metric and weighted load for the new candidate slice paths.

6. The method of claim 1 , further comprising:
for each candidate slice path, calculating a normalized cost of the performance metric; and
when no candidate slice path includes a normalized cost that meets an SLA threshold, ranking the candidate slice paths based on how close the normalized cost is to the SLA threshold.

7. The method of claim 1 , wherein determining the candidate cloud paths includes:
determining a first set of slice paths that includes all permutations of VNF-to-cloud assignments that are within the number of VNFs and maximum number of intercloud links;
determining a second set of slice paths that complies with the SLA attribute; and
taking an intersection of the first and second sets.

8. A non-transitory, computer-readable medium comprising instructions that, when executed by a processor, perform stages for dynamic inter-cloud virtual network function (“VNF”) placement in a slice, the stages comprising:
determining candidate slice paths relative to an edge cloud, wherein the candidate slice paths are different permutations of VNF-to-cloud assignments, the permutations being limited by a maximum number of intercloud links;
scoring candidate slice paths based on performance metric values and load values for the candidate slice paths, wherein the performance metric corresponds to an attribute requirement for one of round-trip time and bandwidth;
selecting a composite slice path based on the scores of the candidate slice paths; and
provisioning the VNFs at corresponding clouds specified by the selected composite slice path.

9. The non-transitory, computer-readable medium of claim 8 , wherein the respective load values of the candidate slice paths are determined by at least summing loads for clouds in the respective candidate slice path.

10. The non-transitory, computer-readable medium of claim 8 , further comprising:
creating a matrix that maps the performance metric to clouds in the candidate slice paths, wherein the performance metric of a candidate slice path is derived from values in the matrix; and
when at least one candidate slice path complies with the attribute requirement, eliminating candidate slice paths that are non-compliant with the attribute requirement.

11. The non-transitory, computer-readable medium of claim 10 , wherein the attribute requirement is a maximum round-trip time.

12. The non-transitory, computer-readable medium of claim 8 , the stages further comprising:
detecting network congestion or a performance metric that does not meet the attribute requirement;
determining new candidate slice paths; and
provisioning at least one of the VNFs at a new cloud specified by a new composite slice path, the new composite slice path having a best score among new candidate slice paths based on a combination of a weighted performance metric and weighted load for the new candidate slice paths.

13. The non-transitory, computer-readable medium of claim 8 , the stages further comprising:
for each candidate slice path, calculating a normalized cost of the performance metric; and
when no candidate slice path includes a normalized cost that meets an SLA threshold, ranking the candidate slice paths based on how close the normalized cost is to the SLA threshold.

14. The non-transitory, computer-readable medium of claim 8 , wherein determining the candidate cloud paths includes:
determining a first set of slice paths that includes all permutations of VNF-to-cloud assignments that are within the number of VNFs and maximum number of intercloud links;
determining a second set of slice paths that complies with the SLA attribute; and
taking an intersection of the first and second sets.

15. A system for dynamic inter-cloud virtual network function (“VNF”) placement in a slice, comprising:
a non-transitory, computer-readable medium containing instructions; and
a processor that executes the instructions to perform stages comprising:
determining candidate slice paths relative to an edge cloud, wherein the candidate slice paths are different permutations of VNF-to-cloud assignments, the permutations being limited by a number of VNFs;
scoring candidate slice paths based on performance metric values and load values for the candidate slice paths, wherein the performance metric corresponds to a bandwidth requirement;
selecting a composite slice path based on the scores of the candidate slice paths; and
provisioning the VNFs at corresponding clouds specified by the selected composite slice path.

16. The system of claim 15 , wherein the respective load values of the candidate slice paths are determined by at least summing loads for clouds in the respective candidate slice path.

17. The system of claim 15 , the stages further comprising:
creating a matrix that maps the performance metric to clouds in the candidate slice paths, wherein the performance metric of a candidate slice path is derived from values in the matrix; and
when at least one candidate slice path complies with the bandwidth requirement, eliminating candidate slice paths that are non-compliant with the bandwidth requirement.

18. The system of claim 15 , the stages further comprising:
detecting network congestion or a performance metric below an SLA requirement;
determining new candidate slice paths; and
provisioning at least one of the VNFs at a new cloud specified by a new best composite slice path, the new best composite slice path having a new best composite score based on a combination of a weighted performance metric and weighted load for the new candidate slice paths.

19. The system of claim 15 , the stages further comprising:
for each candidate slice path, calculatin

Assignees

• Vmware Inc

Inventors

• Tidemann Jeremy
• Polychronopoulos Constantine
• Bordeleau Marc Andre
• Choh Edward
• Gupta Ojas
• Kidd Robert
• Kommula Raja
• Oikonomou Georgios

Classifications

• H04L67/1097

  for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS] · CPC title

• H04L67/1008

  based on parameters of servers, e.g. available memory or workload (monitoring of computer activity G06F11/30) · CPC title

• H04L41/122

  of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV] · CPC title

• H04L41/0895

  Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements · CPC title

• H04L41/40

  using virtualisation of network functions or resources, e.g. SDN or NFV entities · CPC title