Context driven network slicing based migration of applications and their dependencies
Embodiments described herein relate to methods, systems, and non-transitory computer readable mediums storing instructions for creating and executing migration workflows to replicate or migrate data (collectively referred to herein as ‘migration’) from one device or set of devices to another device or set of devices (e.g., from one computing environment to another). The method of migration involves using a slicing customizer to assign the applications, or parts of the applications, to network slice queues based on predetermined rules. The slices in the queues are then migrated by a network slicing controller.
1. A method for performing a migration, the method comprising:
receiving a request to migrate a plurality of applications from a source device to a target device at a migrator, the migrator connected to the source device and the target device;
identifying relationships between the plurality of applications, wherein identifying relationships comprises:
retrieving an application identification (ID) for each application of the plurality of applications in the request;
retrieving port numbers used for each application of the plurality of applications;
identifying all applications by application ID using each port based on the port numbers;
determining groups of related applications of the plurality of applications based on applications using each port, wherein an application is related to another application by analyzing metadata associated with each port, and wherein determining groups of related applications comprises:
for each port:
determining, by an application relationship module, related applications in the groups of related applications having a dependency relationship or having a correlated relationship, wherein applications have a correlated relationship when a common data path or registration ID of the metadata associated with the respective port exists between the applications, and have a dependency relationship when one application is a parent or child based on traffic between the applications associated with the respective port;
producing a matrix specifying each relationship between the applications using the relationships, wherein the matrix includes a subset of the correlated relationships and a subset of the dependency relationships, wherein producing the matrix places a higher priority on correlated relationships compared dependency relationships;
subsequent to producing the matrix, assigning a priority to each of the applications, wherein assigning a priority to each application comprises:
identifying properties of the applications; and
for each application, based on the properties, assigning the priority to the application, by a slicing customizer, by using predetermined rules to calculate the priority to the application based on tolerance for downtime, size of the application, and type of data in the application;
placing, by the slicing customizer, the applications in appropriate network slice queues based on the assigned priorities of each of the applications and the matrix, wherein each of the network slice queues has a slice priority; and
performing, by a network slicing controller, the migration of the applications from the source device to the target device using the network slice queues, wherein each of the network slice queues are migrated in order of the slice priority.
2. The method of claim 1 , wherein the network slice queues include at least a high priority network slice and a normal priority network slice.
3. The method of claim 1 , wherein the predetermined rules are implemented by an administrator of the slicing customizer.
4. The method of claim 1 , wherein assigning the priority of an application comprises determining a priority class of the application.
5. The method of claim 4 , wherein the priority class is one of at least three classes that are based on at least a tolerance of the application to downtime.
6. The method of claim 4 , wherein the priority class is one of at least three classes that are based on at least a size of data needed for the application.
7. The method of claim 4 , wherein the priority class is one of at least two classes that are based on the application's relationship to other applications.
8. The method of claim 1 , wherein the application and its data are divided into portions which are each assigned to a slice queue.
9. The method of claim 1 , wherein an entire application and its data are assigned to a single slice queue.
10. A non-transitory computer readable medium comprising computer readable program code, which when executed by a computer processor enables the computer processor to perform a method for performing a migration, the method comprising:
receiving a request to migrate a plurality of applications from a source device to a target device at a migrator, the migrator connected to the source device and the target device;
identifying relationships between the plurality of applications, wherein identifying relationships comprises:
retrieving an application identification (ID) for each application of the plurality of applications in the request;
retrieving port numbers used for each application of the plurality of applications;
identifying all applications by application ID using each port based on the port numbers;
determining groups of related applications of the plurality of applications based on applications using each port, wherein an application is related to another application by analyzing metadata associated with each port, and wherein determining groups of related applications comprises:
for each port:
determining, by an application relationship module, related applications in the groups of related applications having a dependency relationship or having a correlated relationship, wherein applications have a correlated relationship when a common data path or registration ID of the metadata associated with the respective port exists between the applications, and have a dependency relationship when one application is a parent or child based on traffic between the applications associated with the respective port;
producing a matrix specifying each relationship between the applications using the relationships, wherein the matrix includes a subset of the correlated relationships and a subset of the dependency relationships, wherein producing the matrix places a higher priority on correlated relationships compared dependency relationships;
subsequent to producing the matrix, assigning a priority to each of the applications, wherein assigning a priority to each application comprises:
identifying properties of the applications; and
for each application, based on the properties, assigning the priority to the application, by a slicing customizer, by using predetermined rules to calculate the priority to the application based on tolerance for downtime, size of the application, and type of data in the application;
placing, by the slicing customizer, the applications in appropriate network slice queues based on the assigned priorities of each of the applications and the matrix, wherein each of the network slice queues has a slice priority; and
performing, by a network slicing controller, the migration of the applications from the source device to the target device using the network slice queues, wherein each of the network slice queues are migrated in order of the slice priority.
11. The non-transitory computer readable medium of claim 10 , wherein the network slice queues include at least a high priority network slice and a normal priority network slice.
12. The non-transitory computer readable medium of claim 10 , wherein the predetermined rules are implemented by an administrator of the slicing customizer.
13. The non-transitory computer readable medium of claim 10 , wherein assigning the priority of an application comprises determining a priority class of the application.
14. The non-transitory computer readable medium of claim 13 , wherein the priority class is one of at least three classes that are based on at least a tolerance of the application to downtime.
15. The non-transitory computer readable medium of claim 13 , wherein the priority class is one of at least three classes that are based on at least a size of data needed for the application.
16. The non-transitory computer readable medium of claim 13 , wherein the priority class is one of at least two classes that are based on the application's relationship to other applications.
17. A system comprising:
at least two devices; and
a migrator which comprises:
at least one processor;
a storage device; and
at least one memory that includes instructions, which when executed by the processor, perform a method for performing a migration of a plurality of applications between a first device and at least a second device of the at least two devices, the method comprising:
receiving a request to migrate a plurality of applications from a source device to a target device at a migrator, the migrator connected to the source device and the target device;
identifying relationships between the plurality of applications, wherein identifying relationships comprises:
retrieving an application identification (ID) for each application of the plurality of applications in the request;
retrieving port numbers used for each application of the plurality of applications;
identifying all applications by application ID using each port based on the port numbers;
determining groups of related applications of the plurality of applications based on applications using each port, wherein an application is related to another application by analyzing metadata associated with each port, and wherein determining groups of related applications comprises:
for each port:
determining, by an application relationship module, related applications in the groups of related applications having a dependency relationship or having a correlated relationship, wherein applications have a correlated relationship when a common data path or registration ID of the metadata associated with the respective port exists between the applications, and have a dependency relationship when one application is a parent or child based on traffic between the applications associated with the respective port;
producing a matrix specifying each relationship between the applications using the relationships, wherein the matrix includes a subset of the correlated relationships and a subset of the dependency relationships, wherein producing the matrix places a higher priority on correlated relationships compared dependency relationships; subsequent to producing the matrix, assigning a priority to each of the applications, wherein assigning a priority to each application comprises:
identifying properties of the applications; and
for each application, based on the properties, assigning the priority to the application, by a slicing customizer, by using predetermined rules to calculate the priority to the application based on tolerance for downtime, size of the application, and type of data in the application;
placing, by the slicing customizer, the applications in appropriate network slice queues based on the assigned priorities of each of the applications and the matrix, wherein each of the network slice queues has a slice priority; and
performing, by a network slicing controller, the migration of the applications from the source device to the target device using the network slice queues, wherein each of the network slice queues are migrated in order of the slice priority.
18. The system of claim 17 , wherein the network slice queues include at least a high priority network slice and a normal priority network slice.
19. The system of claim 17 , wherein the predetermined rules are implemented by an administrator of the slicing customizer.
20. The system of claim 17 , wherein assigning the priority of an application comprises determining a priority class of the application.