IP Library › Granted Patent US 12,498,990
Granted Patent B2
US 12,498,990 · App. 17/785,250 · Granted Dec 16, 2025

Migration of VNFs to VIMs

Inventor: Johan Hjelm (Matsunami, JP)
Assignee: Telefonaktiebolaget LM Ericsson (Publ)
G06F9/5077G06F9/45558G06F9/4856H04L41/0816H04L41/0823H04L41/0897G06F2009/4557
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 12,498,990
App. No.
17/785,250
Granted
Dec 16, 2025
Kind
B2
Abstract

Mechanisms for migration in a communication network of VNFs to VIMs. A method is performed by a migration controller. The method includes obtaining information of network complexity per VNF, information of VM usage per VNF, and information of processing capacity of compute nodes per VIM. The method further includes determining a mapping between the VNFs and the VIMs. The mapping defines at which of the VIMs each of the VNFs is instantiable. The method further includes ordering the VNFs in a list by matching the information of network complexity per VNF and the information of VM usage per VNF to the information of processing capacity of compute nodes per VIM and taking into account the mapping between the VNFs and the VIMs. The method further includes initiating migration of the VNFs to the VIMs in the order defined by the list.

Claims (38)

1 . A method performed by a migration controller for migration in a communication network of virtual network functions, VNFs, to virtual infrastructure managers, VIMs, each VIM being associated with a virtualized infrastructure provided by at least one computing node, the method comprising:

obtaining, at least by querying at least one database, information of network complexity per VNF, information of virtual machine, VM, usage per VNF, and information of processing capacity of compute nodes per VIM;

determining, by processing circuitry of the migration controller, a mapping between the VNFs and the VIMs, wherein the mapping defines at which of the VIMs each of the VNFs is instantiable;

ordering the VNFs in a list by matching the information of network complexity per VNF and the information of VM usage per VNF to the information of processing capacity of compute nodes per VIM and taking into account the mapping between the VNFs and the VIMs; and

causing the VNFs to be migrated to the VIMs in the order defined by the list.

2 . The method according to claim 1 , wherein according to the information of network complexity per VNF a respective network complexity weighting factor is assigned to each VNF according to the network complexity of that VNF.

3 . The method according to claim 1 , wherein according to the information of VM usage per VNF a respective usage weighting factor is assigned to each VNF according to the VM usage of that VNF.

4 . The method according to claim 1 , wherein according to the information of processing capacity of compute nodes per VIM a respective processing weighting factor is assigned to each VIM according to the processing capacity of the compute nodes of that VIM.

5 . The method according to claim 1 , wherein matching the information of network complexity per VNF and the information of VM usage per VNF to the information of processing capacity of compute nodes per VIM involves matching the network complexity weighting factors and the usage weighting factors to the processing weighting factors.

6 . The method according to claim 1 , wherein information about the network complexity pertains to at least one of: network policies, network traffic patterns, network topology.

7 . The method according to claim 1 , wherein the VM usage pertains to at least one of: number of hosted VMs, complexity required by hosted VMs, processing intensity required by hosted VMs.

8 . The method according to claim 1 , wherein processing capacity pertains to at least one of: number of processing units of the compute nodes, type of processing units of the compute nodes, computing speed of the compute nodes.

9 . The method according to claim 1 , further comprising:

deploying the VNFs at those VIMs the VNFs have been migrated to.

10 . The method according to claim 9 , further comprising:

obtaining performance feedback from those VIMs the VNFs have been migrated to; and

re-ordering the VNFs in the list according to the performance feedback before re-initiating migration of the VNFs to the VIMs in the order defined by the thus re-ordered list.

11 . The method according to claim 10 , wherein the performance feedback comprises prioritized VIM-VNF combinations.

12 . The method according to claim 1 , wherein the migration is initiated without deployment of the VNFs at the VIMs.

13 . The method according to claim 12 , further comprising:

simulating deployment of the VNFs at those VIMs the VNFs have been migrated to.

14 . The method according to claim 1 , wherein the list defines content of one of:

a batch file that, as part of initiating the migration, is provided to at least one batch control function; and

a rule file that, as part of initiating the migration, is provided to at least one Congress driver.

15 . The method according to claim 1 , wherein the information of network complexity per VNF is provided in a first list of VNFs according to which the VNFs are ordered according to the network complexity per VNF.

16 . The method according to claim 1 , wherein the information of VM usage per VNF is provided in a second list of VNFs according to which the VNFs are ordered according to the VM usage per VNF.

17 . The method according to claim 1 , wherein the information of processing capacity of compute nodes per VIM is provided in a third list of VIMs according to which the VIMs are ordered according to the processing capacity of the compute nodes per VIM.

18 . The method according to claim 1 , wherein the matching comprises matching the VNFs in order from highest to lowest network complexity and in order from highest to lowest VM usage to the VIMs in order from highest to lowest processing capacity of their compute nodes, and wherein each VNF only is matched to any of those VIMs where that VNF is instantiable.

19 . A migration controller for migration in a communication network of virtual network functions, VNFs, to virtual infrastructure managers, VIMs, each VIM being associated with a virtualized infrastructure provided by at least one computing node, the migration controller comprising processing circuitry, the processing circuitry being configured to cause the migration controller to:

obtain, at least by querying at least one database, information of network complexity per VNF, information of virtual machine, VM, usage per VNF, and information of processing capacity of compute nodes per VIM;

determine a mapping between the VNFs and the VIMs, wherein the mapping defines at which of the VIMs each of the VNFs is instantiable;

order the VNFs in a list by matching the information of network complexity per VNF and the information of VM usage per VNF to the information of processing capacity of compute nodes per VIM and taking into account the mapping between the VNFs and the VIMs; and

causing the VNFs to be migrated to the VIMs in the order defined by the list.

20 . A computer program for migration in a communication network of virtual network functions, VNFs, to virtual infrastructure managers, VIMs, each VIM being associated with a virtualized infrastructure provided by at least one computing node, the computer program comprising computer code which, when run on processing circuitry of a migration controller, causes the migration controller to:

obtain, at least by querying at least one database, information of network complexity per VNF, information of virtual machine, VM, usage per VNF, and information of processing capacity of compute nodes per VIM;

determine a mapping between the VNFs and the VIMs, wherein the mapping defines at which of the VIMs each of the VNFs is instantiable;

order the VNFs in a list by matching the information of network complexity per VNF and the information of VM usage per VNF to the information of processing capacity of compute nodes per VIM and taking into account the mapping between the VNFs and the VIMs; and

cause the VNFs to be migrated to the VIMs in the order defined by the list.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2022
From: HJELM, JOHAN
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 060276/0607 →
Continuity (1)
Related Publication 20230008683A1 · Jan 12, 2023
References Cited (20)
US 9760391B2 · Kiess et al. · 2017 [cited by applicant]
US 10291543B1 · Felstaine et al. · 2019 [cited by applicant]
US 20150277779A1 · Devarapalli et al. · 2015 [cited by examiner]
US 20170017512A1 · Csatari et al. · 2017 [cited by applicant]
US 20170063714A1 · Xiang · 2017 [cited by applicant]
US 20170220371A1 · Kosugi et al. · 2017 [cited by applicant]
US 20180081714A1 · Liu · 2018 [cited by applicant]
US 20180246757A1 · Li et al. · 2018 [cited by applicant]
US 20180337981A1 · Bogdan et al. · 2018 [cited by applicant]
US 20190065234A1 · Zembutsu et al. · 2019 [cited by applicant]
US 20190146827A1 · Yu et al. · 2019 [cited by examiner]
US 20200195558A1 · Schultz et al. · 2020 [cited by examiner]
US 20200401456A1 · Sivak et al. · 2020 [cited by examiner]
US 20240036905A1 · Rathinam et al. · 2024 [cited by examiner]
CN 106657173A · 2017 [cited by applicant]
WO 2018056873A1 · 2018 [cited by applicant]
European Search Report dated Nov. 21, 2022 for Application No. 19956639.9, consisting of 8 pages. [cited by applicant]
Jun Zhao; Research and optimization of OpenStack virtual machine resource scheduling technology; International Journal of Circuits, Systems and Signal Processing; vol. 13, 2019, consisting of 7 pages. [cited by applicant]
International Search Report and Written Opinion dated Oct. 9, 2020 for International Application No. PCT/SE2019/051328 filed Dec. 12, 2019, consisting of 10 pages. [cited by applicant]
Chinese Office Action and English Summary dated Jul. 26, 2025 for Application No. 201980103078.7, consisting of 9 pages. [cited by applicant]