Resource Provisioning in a Virtualized Network

• US 20180302316A1
• Filed: 04/27/2015
• Published: 10/18/2018
• Est. Priority Date: 04/27/2015
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Ubaldi, Fabio, Giurlanda, Francesco, Iovanna, Paola, Noto, Sandro, Priola, Alessandro
• Granted Patent: US 10,637,766 B2
• Time in Patent Office: Days
• CPC Class Codes: H04L 43/0882 Utilisation of link capacity
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 45/70 Routing based on monitoring results

Abstract

Resource provisioning in a virtualized network Within a network comprising a plurality of domains, an end-to-end route for a required service is computed by setting a respective parameter value for each of a plurality of paths in a domain. Each parameter value is based on resources that are available for the required service, and the parameter value is dependent on a priority given to said service. The end-to-end route for the required service is selected based on said parameter values.

Claims

1-16. -16. (canceled)

17. A method of selecting an end-to-end route within a network comprising a plurality of domains, the method comprising:

for a required service, and for each of a plurality of paths in a domain, setting a respective parameter value, wherein each parameter value is based on resources that are available for the required service, said parameter value being dependent on a priority given to said service; and

selecting the end-to-end route for the required service based on said parameter values.

18. The method of claim 17, wherein each parameter value is based on the resources on one of the paths associated with a respective virtual link, excepting resources already allocated to other services having a higher priority than said service.

19. The method of claim 17, wherein each parameter value is based on the resources on one of the paths associated with a respective virtual link, excepting resources already allocated to other services having a priority that is higher than or equal to the priority given to said service.

20. The method of claim 18, wherein each parameter value is further based on elastic resources available on the path.

21. The method of claim 17, wherein the resources comprise a bandwidth.

22. The method of claim 17, comprising:

setting the respective parameter value for each of the plurality of virtual links in the domain;

excluding any virtual links for which the bandwidth required by the service is not less than the virtual bandwidth of said link; and

if any virtual links are not excluded, selecting a path from a virtual link that has not been excluded.

23. The method of claim 22, further comprising, when excluding any virtual links for which the bandwidth required by the service is not less than the virtual bandwidth of said link, additionally excluding any virtual links for which the maximum bandwidth that may be required is (is less than a bandwidth corresponding to the parameter value set for the required service.

24. The method of claim 22, further comprising, if all virtual links are excluded:

reinstating the excluded links;

excluding any virtual links for which the bandwidth required by the service is not less than the sum of the virtual bandwidth of said link and a margin parameter; and

if any virtual links are not excluded, selecting a path from a virtual link that has not been excluded.

25. The method of claim 24, further comprising, if all virtual links are excluded, rejecting a request to set the route.

26. The method of claim 22, comprising selecting an end-to-end route, wherein the end-to-end route comprises a virtual link in at least one domain of the network.

27. The method of claim 26, comprising, in the or each domain containing a virtual link of the selected end-to-end route, selecting for said virtual link a path that has the minimum value of the sum of the resources on the path and the elastic resources available on the path, excepting resources already allocated to other services having a higher priority than said service, where said sum of said resources exceeds the resources required for said service.

28. A network node, the network node comprising:

a processor, and

a memory operatively coupled to the processor and comprising program instructions for execution by the processor, whereby the network node is configured to select an end-to-end route within a network comprising a plurality of domains by;

for a required service, and for each of a plurality of paths in a domain, setting a respective parameter value, wherein each parameter value is based on resources that are available for the required service, said parameter value being dependent on a priority given to said service; and

selecting the end-to-end route for the required service based on said parameter values;

29. A method for selecting a path for a requested service within a domain of a multi-domain network, the method comprising:

for a virtual link that can be represented by a plurality of physical paths,

evaluating for each path the sum of the resources on the path and the elastic resources available on the path, excepting resources already allocated to other services having a priority that is equal to or higher than a priority of said requested service,

from the paths for which said sum of said resources exceeds the resources required for said service, selecting the path which has the minimum value of the sum of said resources.

30. The method of claim 29, wherein the resources are bandwidth.

31. A network node, the network node comprising:

a processor, and

a memory operatively coupled to the processor and comprising program instructions for execution by the processor, whereby the network node is configured to select a path for a requested service within a domain of a multi-domain network by;

for a virtual link that can be represented by a plurality of physical paths,

evaluating for each path the sum of the resources on the path and the elastic resources available on the path, excepting resources already allocated to other services having a priority that is equal to or higher than a priority of said requested service,

from the paths for which said sum of said resources exceeds the resources required for said service, selecting the path which has the minimum value of the sum of said resources.