IP Library Granted Patent US 10,944,647
Granted Patent B2
US 10,944,647 · App. 16/256,659 · Granted Mar 9, 2021

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

Inventors: Jeremy Tidemann (Urbana, IL); Constantine Polychronopoulos (Palo Alto, CA); Marc Andre Bordeleau (Shawinigan, CA); Edward Choh (Richmond, CA); Ojas Gupta (Mountain View, CA); Robert Kidd (Champaign, IL); Raja Kommula (Cupertino, CA); Georgios Oikonomou (Patras, GR)
Assignee: VMWARE, INC.
H04L41/5054G06F9/45558H04L41/0806H04L41/0826H04L41/0893H04L41/5009H04L41/5025H04L43/0882H04L47/2425G06F2009/4557G06F2009/45595H04L67/101
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,944,647
App. No.
16/256,659
Granted
Mar 9, 2021
Kind
B2
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.

Claims (64)

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;

for the candidate slice paths, determining a load based on each cloud in the candidate slice path;

identifying a best composite slice path based on a composite score that includes a performance metric and the load, wherein the performance metric corresponds to a service level agreement (“SLA”) attribute; and

provisioning the VNFs at corresponding clouds specified by the best composite slice path.

2. The method of claim 1 , further comprising:

creating a matrix that maps the performance metric to each different cloud 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.

3. The method of claim 2 , wherein the SLA attribute is a maximum round-trip time.

4. 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 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.

5. 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.

6. 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.

7. The method of claim 1 , wherein the best composite slice path has the lowest composite score of multiple composite slice paths, wherein the composite score includes adding a weighted load to a weighted performance metric.

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 number of VNFs or a maximum number of intercloud links;

for the candidate slice paths, determining a load based on each cloud in the candidate slice path;

identifying a best composite slice path having a best composite score based on a performance metric and the load, wherein the performance metric corresponds to a service level agreement (“SLA”) attribute; and

provisioning the VNFs at corresponding clouds specified by the best composite slice path.

9. The non-transitory, computer-readable medium of claim 8 , the stages further comprising:

creating a matrix that maps the performance metric to each different cloud 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.

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

11. The non-transitory, computer-readable medium of claim 8 , 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.

12. 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.

13. 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.

14. The non-transitory, computer-readable medium of claim 8 , wherein the best composite slice path has the lowest composite score of multiple composite slice paths, wherein the composite score includes adding a weighted load to a weighted performance metric.

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 or a maximum number of intercloud links;

for the candidate slice paths, determining a load based on each cloud in the candidate slice path;

identifying a best composite slice path having a best composite score based on a performance metric and the load, wherein the performance metric corresponds to a service level agreement (“SLA”) attribute; and

provisioning the VNFs at corresponding clouds specified by the best composite slice path.

16. The system of claim 15 , the stages further comprising:

creating a matrix that maps the performance metric to each different cloud 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.

17. The system of claim 16 , wherein the SLA attribute is a maximum round-trip time.

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, 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.

20. The system of claim 15 , 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.

Assignments (2)
CHANGE OF NAME Recorded Apr 15, 2024
From: VMWARE, INC.
To: VMWARE LLC
Reel/Frame 067102/0314 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 13, 2019
From: TIDEMANN, JEREMY; POLYCHRONOPOLOUS, CONSTANTINE; BORDELEAU, MARC ANDRE; CHOH, EDWARD; GUPTA, OJAS; KIDD, ROBERT; KOMMULA, RAJA; OIKONOMOU, GEORGIOS
To: VMWARE, INC.
Reel/Frame 049164/0434 →
Continuity (1)
Related Publication 20200244551A1 · Jul 30, 2020
Cited By (2)
US 12,463,872 US 12,671,646