Adaptive management and multi-objective optimization of virtual machine in cloud computing based on particle swarm optimization

Abstract

In order to improve the adaptive management ability of virtual machine placement in cloud computing, an adaptive management and multi-objective optimization method for virtual machine placement in cloud computing is proposed based on particle swarm optimization (PSO). The objective optimization model of adaptive management of virtual machine placement in cloud computing is constructed by particle swarm evolution, and the global optimization control of adaptive management of virtual machine placement in cloud computing is carried out by introducing extremum perturbation operator. The global dynamic objective function of particle swarm optimization is constructed, and the global optimal solution of virtual machine in cloud computing is found by deconvolution algorithm, and the optimal position of particle swarm is searched in two-dimensional space. The multi-objective optimization problem of adaptive management of virtual machine placement is transformed into particle swarm optimization problem to realize adaptive management and multi-objective optimization of virtual machine placement in cloud computing. Simulation results show that the adaptive management of virtual machine placement in cloud computing using this method has better global optimization ability, better convergence of particle swarm optimization, and better performance of multi-objective optimization.

Introduction

Data centers usually use virtualization technology to provide all kinds of cloud storage or computing services for users. Virtualization technology can put multiple virtual machines on the same physical machine and can transparently migrate virtual machines from one physical machine to other physical machines, so the number of physical machines in the data center is greatly reduced and the hardware capital is improved. The source use rate reduces energy consumption. Efficient operation of the cloud data center requires flexible and convenient management of thousands of virtual machines. Virtual machine management includes two important steps, including virtual machine selection and placement, involving many indicators, such as resource use (CPU, memory, network IO, and magnetic disk IO), application performance, and power consumption [1, 2].

At present, most of the host selection methods only consider the use of resources. One of the three indexes of application performance and power consumption can only minimize the temperature or increase the utilization rate of resources or reduce power consumption. But it cannot be effective at the same time [3, 4]. However, an efficient cloud data center needs to reduce the power consumption at the same time as satisfying the user’s application performance, which needs to consider the relationship among resource utilization, application performance, and power consumption [5, 6]. But it is not easy to consider these state indicators together because they conflict and constrain each other. For example, the integration of virtual machines into a small number of physical machines and the shutdown of idle physical machines can effectively reduce energy consumption, but the integration of virtual machines will lead to competition of physical resources, which will affect application performance and may cause server hotspots. To study host selection algorithm, it is necessary to consider temperature, resource usage, application performance, and power consumption, and optimize virtual machine placement, so that the data center can obtain lower temperature while effectively guaranteeing the application performance, higher resource utilization, and less power consumption [7, 8].

Many scholars at home and abroad have studied the problem of virtual machine placement. In [9], the problems of hardware resource management and application performance assurance in data center are studied. By analyzing the relationship between resource utilization and application performance, the relationship model between them is constructed. A virtual machine dynamic placement algorithm based on online migration technology is proposed. In [10], Dr. Ma pointed out that the rapidly increasing computational intensive application load in the current data center makes the temperature of the processor higher and the thermal energy distribution out of balance, thus increasing the power consumption of the cooling system and shortening the service life of the server. In order to effectively balance the processor temperature of each node in the data center, the idea of closing the hot node is proposed. In [11], the low complexity linear thermal cycle model is used to define the load allocation problem based on peak temperature in order to reduce the processor peak temperature to minimize the cooling cost. In [12], the node integration of cloud computing data center virtualization is described as a random packing optimization problem, but only processor resources are considered, and memory is not considered. In [13], an adaptive management framework for virtual machine placement in cloud computing is proposed, and a multi-objective genetic algorithm for virtual machine placement with application service-level target constraints is proposed, which can be used to formulate virtual machine placement strategies in the framework. However, the problem of energy consumption is not considered, and the resource control and energy consumption control are not combined, while the application load is concentrated, its performance is not guaranteed. In order to maximize the quality of service (QoS), the idle physical machine is used as the migration virtual machine to reposition the destination host, but this will increase the site of resources and energy consumption of the physical machine [14, 15].

Some achievements have been made in the field of virtual machine management, but there are some shortcomings [16, 17]. Firstly, most of the research on placement strategy is based on single objective optimization under certain criteria. The optimal placement obtained by this method is only the optimal solution of certain conditions and cannot be compared with each other under various criteria. An effective placement strategy should consider multiple objectives and make trade-offs and compromises. Then, there are conflicts and constraints among the state factors, and no unified optimization model is established to deal with the optimization [18, 19].

In order to solve the above problems, this paper puts forward the adaptive management of virtual machine in cloud computing the particle swarm optimization algorithm in place and multi-objective optimization method based on multi-objective optimization model to construct adaptive management of virtual machine in cloud computing placed by particle swarm evolution method; the introduction of extreme disturbance operators are placed in a virtual machine in cloud computing global adaptive management optimization control, construction of global dynamic objective function of particle swarm optimization; using deconvolution method to find global optimal virtual machine in cloud computing is placed solution; the optimal position of particle swarm in 2-dimensional space search, adaptive management of virtual machine is placed in the multi-objective optimization problem and is transformed into particle swarm optimization. Finally, simulation experiments show this method in adaptive management to realize virtual machine placement in cloud computing and multi-objective optimization of superior performance.

Methods

Objective optimization function of adaptive management

Aiming at the multi-objective optimization of virtual machine placement technology, the particle swarm optimization (PSO) method is used to construct an adaptive management target optimization model of virtual machines in cloud computing [20, 21]. It is assumed that there are 8 migrating virtual machines and 5 physical machines. The particle population is adapted to obtain new individuals in the process of multi-objective optimization. The operator is:

$$ {p}_{\mathrm{id}}^{\mathrm{new}}=\left\{\begin{array}{cc}{p}_{\mathrm{id}}+m\left(\right)\left({X}_{\mathrm{max}}-{p}_{\mathrm{id}}\right)& \mathrm{if}\ m\left(\right)>0\ \\ {}{p}_{\mathrm{id}}+m\left(\right)\left({p}_{id}-{X}_{\mathrm{min}}\right)& \mathrm{if}\ m\left(\right)\le 0\end{array}\right. $$

(1)

In which, X_maxand X_min are the maximum and minimum position value of particles. m() is the wavelet function of each migration virtual machine, which is defined as:

$$ m\left(\right)=\frac{1}{\sqrt{a}}{e}^{-\frac{\varphi^2}{2{a}^2}}\cos \frac{5\varphi }{a} $$

(2)

In which, φ ∈ [−2.5a, 2.5a], a ∈ [1, 10000]. Given the migration virtual machine and the destination host selected for each iteration, the wavelet high frequency mutation can make the algorithm easier to search in the solution space.

Assumption 1:f(D(x, ξ)) ≤ f(x), and if the adaptive management crossover operator ξ ∈ U is placed in cloud computing, then f(D(x, ξ)) ≤ f(x), where D is a random optimization algorithm, ξ is the solution found by adaptive management of virtual machine placement in cloud computing, U is the feasible solution space, and f is the objective function.

Assumption 2: For the adaptive management Borel subset A of virtual machines placed in any cloud computing of U, if its management measure v(A) > 0, then $\prod \limits_{k=0}^{\infty}\left(1-{u}_k(A)\right)=0$, where u_k(A) is the adaptive optimization algorithm D for placement of virtual machines in cloud computing, D in the k iteration, the probabilistic measure of the solution found on U.

Theorem 1: Suppose that the adaptive management objective function${\left\{{x}_{g,k}\right\}}_{k=0}^{\infty }$of virtual machine placement in cloud computing is a measurable function, and the solution space$\underset{t\to \infty }{\lim }P\left[{x}_{g,k}\in {R}_{\varepsilon}\right]=1$is a measurable set, and the solution sequence generated by the algorithm is P[x_{g, k} ∈ R_ε], then x_{g, k} ∈ R_εholds, where VMbest and PMbest represent the migration virtual machine and the destination host selected by each iteration, k is the evolutionary algebra, and x_{g, k} ∈ R_εis the optimal solution found by the k generation.

Record the ordered pair and update the current virtual machine migration scheme. The algorithm starts iterating through the steps described above until the optimal virtual machine migration scheme is obtained, and the standard PSO algorithm for adaptive management of virtual machine placement in cloud computing is described as:

$$ D\left({p}_g(t),{p}_i(t)\right)=\left\{\begin{array}{cc}{p}_g(t)& f\left({p}_g(t)\right)\le f\left({x}_i(t)\right)\\ {}{x}_i(t)& f\left({p}_g(t)\right)>f\left({x}_i(t)\right)\end{array}\right. $$

(3)

It is easy to prove that it satisfies the assumption 1 in the convergence criterion.

Multi-objective optimization problem description

The objective optimization model of adaptive management of virtual machine placement in cloud computing is constructed by particle swarm evolution method [22, 23]. The global optimization control of adaptive management of virtual machine placement in cloud computing is carried out by introducing extremum perturbation operator. The particle size of the swarm is N, and the sample space of the swarm must contain U, that is $U\subseteq \underset{i=1}{\overset{N}{\cup }}{M}_{i,k}$, where M_{i, k} is the support set of the sample space of particle ∀A ⊂ U in the k generation. There are N × M combinations of ordered pairs between N virtual machines and v(A) > 0 physical computers. For BV, the measure placed by virtual machines in cloud computing, each one corresponds only to the running cost of virtual machine VMi on the PMj of physical machines Cost(VMi, PMj), and its speed is even higher. The new formula is convergent, and the improved ICLPSO algorithm converges to the global optimal solution provided it is proved that the interval algebra of particle cloning is finite.

All approximate solutions of intermediate particles can be regarded as a point in state space S2. Let s_i = (x₁, x₂, …, x_n) ∈ S¹ denote the first state in the state space S1 in which the virtual machine is placed adaptively, and f(s_i) = (f(x₁), f(x₂), …, f(x_n)) denote that the random variable A processes the state s^∗ = {x ∈ X| f(x) = max f(x)} at the k generation, so that the control objective of adaptive management of the virtual machine placement can be achieved. Function f(x) is the fitness function on X, and s^∗ = {x ∈ X| f(x) = max f(x)} is used to represent the optimal solution of the state space of adaptive management placed by the virtual machine.

Where I = {i| s_i ≥ s_j, ∀s_j ∈ S¹}, an ordered pair corresponding to the minimum value is selected among all the resulting function values [24, 25], where VMbest and PMbest represent the migration virtual machine and destination host selected by the algorithm for each iteration, such as VMbest and PMbest satisfies:

$$ f\left({x}_1\right)=f\left({x}_2\right)=\dots =f\left({x}_n\right)={f}^{\ast } $$

(4)

The amount of state migration placed by virtual machines in cloud computing is s_i ∈ s^∗. Let the transition probability of stochastic process {A_k} be:

${p}_{ij}(k)=p\left\{{A}_{k+1}^j/{A}_k^i\right\}\ge 0$, where

$$ {p}_{ij}(k)=p\left\{{A}_{k+1}^j/{A}_k^i\right\}=\sum \limits_{s_c\in {S}^2}p\left\{{C}_k^l/{A}_k^i\right\}p\left\{{C}_{k+1}^l/{A}_k^i{C}_k^l\right\} $$

(5)

In which, i ∈ I, j ∉ I, for any physical machine migration variable L, there are:

$$ p\left\{{A}_{k+1}^j/{A}_k^i{C}_k^l\right\}=\sum \limits_{s_c\in {S}^2}p\left\{{C}_k^l/{A}_k^i{B}_k^b\right\}p\left\{{A}_{k+1}^j/{A}_k^i{B}_k^b{C}_k^l\right\} $$

(6)

The update of virtual machine migration scheme will cause a state change. It is necessary to recalculate the affected element values in cost matrix CostMatrix for multi-objective optimization control [26, 27].

Multi-objective optimization for adaptive management of virtual machine placement

The deconvolution algorithm is used to find the global optimal solution of virtual machine placement in cloud computing, searching the optimal position of particle swarm in two-dimensional space, according to the definition of clonal selection can be obtained:

$$ p\left\{{A}_{k+1}^j/{A}_k^i{B}_k^b{C}_k^l\right\}=0 $$

(7)

According to the minimum negative value in the cost difference matrix, the corresponding ordered pair is found, the ordered pair is stored, and the current optimal migration scheme is updated [28, 29]. The effective transfer function of the migration scheme is p_ij(k) = 0. When i ∉ I, j ∈ I, the local search process is satisfied.

$$ {p}_{ij}(k)\ge p\left\{{C}_k^j/{A}_k^i\right\}p\left\{{A}_{k+1}^j/{A}_k^i{C}_k^j\right\} $$

(8)

Thus,

$$ p\left\{{C}_k^j/{A}_k^i\right\}=\sum \limits_{s_c\in {S}^2}p\left\{{B}_k^b/{A}_k^i\right\}p\left\{{C}_{k+1}^j/{A}_k^i{B}_k^b\right\}\ge p\left\{{B}_k^b/{A}_k^i\right\}p\left\{{C}_k^l/{A}_k^i{B}_k^j\right\}=0 $$

(9)

$$ p\left\{{A}_{k+1}^j/{A}_k^i{C}_k^l\right\}\ge \sum p\left\{{C}_k^j/{A}_k^i{B}_k^b\right\}p\left\{{A}_{k+1}^j/{A}_k^i{B}_k^b{C}_k^j\right\}\ge p\left\{{C}_k^j/{A}_{k+1}^j{A}_k^i{B}_k^j\right\}=0 $$

(10)

Denote ${p}_i(k)={p}_i\left({A}_k^i\right)$, ${p}_k=\sum \limits_{i\notin I}{p}_i(k)$, during each iteration, the conditional probability that the current node is always replaced by the best neighbor node is:

$$ {p}_{k+1}=\sum \limits_{s_c\in S}\sum \limits_{j\notin I}{p}_i(k){p}_{ij}(k)=\sum \limits_{i\in I}\sum \limits_{j\notin I}{p}_i(k){p}_{ij}(k)+\sum \limits_{i\notin I}\sum \limits_{j\notin I}{p}_i(k){p}_{ij}(k) $$

(11)

Because

$\sum \limits_{i\notin I}\sum \limits_{j\notin I}{p}_i(k){p}_{ij}(k)+\sum \limits_{i\notin I}\sum \limits_{j\in I}{p}_i(k){p}_{ij}(k)=\sum \limits_{i\notin I}{p}_i(k)={p}_k\kern0.5em \sum \limits_{i\notin I}\sum \limits_{j\notin I}{p}_i(k){p}_{ij}(k)={p}_k-\sum \limits_{i\notin I}\sum \limits_{j\in I}{p}_i(k){p}_{ij}(k)$.

Then,

$$ 0\le {p}_{k+1}\le {p}_k-\sum \limits_{i\notin I}\sum \limits_{j\in I}{p}_i(k){p}_{ij}(k)\le {p}_k\le 1 $$

(12)

Using deconvolution algorithm to find the global optimal solution of virtual machine placement in cloud computing, there are:

$$ \underset{k\to \infty }{\lim }{p}_k=0 $$

(13)

The best migration scheme of virtual machine is obtained so that the sum of running cost of all migration virtual machines in the data center can be satisfied:

$$ 1\ge \underset{k\to \infty }{\lim}\sum \limits_{s_i\cap {s}^{\ast}\ne \phi }{p}_i(k)\ge \underset{k\to \infty }{\lim}\sum \limits_{i\in I}{p}_i(k)=1-\underset{k\to \infty }{\lim }{p}_k=1 $$

(14)

In the formula, $\overline{\mathbf{C}}$ is the long-term covariance matrix of M × M dimension, and $\tilde{\mathbf{C}}$ represents the short-term covariance matrix of M × M dimension. Of which:

$$ {\overline{C}}_{i j}=\sum \limits_{\tau}\left({x}_{i\tau}-{\overline{x}}_{i\tau}\right)\left({x}_{j\tau}-{\overline{x}}_{j\tau}\right) $$

(15)

$$ {\tilde{C}}_{i j}=\sum \limits_{\tau}\left({x}_{i\tau}-{\tilde{x}}_{i\tau}\right)\left({x}_{j\tau}-{\tilde{x}}_{j\tau}\right) $$

(16)

The global dynamic objective function of particle swarm optimization is constructed, and the global optimal solution of virtual machine placement in cloud computing is found by deconvolution algorithm; then, the multi-objective optimization problem can be reduced to the following optimization problem:

$$ \min J\left(\boldsymbol{\upbeta} \right)=\log \frac{\boldsymbol{\upbeta} \overline{\mathbf{C}}{\boldsymbol{\upbeta}}^T}{\boldsymbol{\upbeta} \tilde{\mathbf{C}}{\boldsymbol{\upbeta}}^T} $$

(17)

In order to increase the utilization rate of hardware resources as much as possible, the target host selection algorithm needs to select the most fully used physical computer as the destination host. CPU, memory, network IO, and disk IO are important hardware resources for physical computers. Using particle swarm optimization, the optimal population will not degenerate [30, 31]. Based on the above analysis, adaptive management and multi-objective optimization of virtual machine placement in cloud computing based on particle swarm optimization are realized [31,32,33].

Experiment

In order to test the application performance of this method in multi-objective optimization of virtual machine placement, the simulation experiment is carried out. The design of Matlab 7 is sampled, and the threshold value is 0.9. The running cost of VMi on PMJ is 0.23. The number of particles is 40, the acceleration factor c1 = c2 = 1.49445, the mutation probability of virtual machine placement is 0.7, and the maximum iterative algebra is 2000. Each algorithm runs 30 times independently. According to the above simulation parameters, the virtual machine placement adaptive management and multi-objective optimization are carried out. The sample set of virtual machine placement target optimization test is shown in Fig. 1.

Fig. 1

Virtual machine placement target optimization test sample set

Taking Fig. 1 as the test sample set, adaptive management and multi-objective optimization control are carried out, and the optimized output sample set is shown in Fig. 2.

Fig. 2

Virtual machine placement target optimization training sample set

Figure 2 shows that the adaptive management of virtual machine placement in this paper has better multi-objective optimization performance, and the convergence of different multi-objective optimization is tested. The result is shown in Fig. 3.

Fig. 3

Particle swarm evolution curve of our algorithm

The analysis shows that based on the given optimization objective function and virtual machine cost operation model, the target host selection problem is modeled mathematically. Compared with the global search algorithm, the global search algorithm not only has a higher search efficiency than the global search algorithm, it can get a better migration scheme of virtual machine.

The experiment simulates 15 physical nodes and 39 virtual machines, and the dynamic resource requirement information of each application virtual machine is random. It is assumed that the resource requirements information of each application is known, including the forecast information of resource needs for each application in the future. In the initial distribution state of virtual machine, about 6% of physical nodes are overheated. At present, the resource requirements of virtual machines consider only two-dimensional resources (processors and memory). The size of each generation in each particle swarm optimization algorithm is set to 42, and the total population is set to 36. Under the same initial state of virtual machine distribution and the load change of the same application virtual machine, the new distribution state of each virtual machine is obtained by running this method and reference [6], reference [7], and reference [8]. The migration times, the stable time, and the number of physical nodes running of these new distributed states are shown in Table 1. The results of the new distributed state run are shown in Fig. 4.

Table 1 Performance comparison results

Fig. 4

Results of the new distributed state run

In Table 1, we can find that paper method makes a good balance between the stability of the virtual machine distribution and the virtual machine migration overhead required by the new and old states. It ensures that the new multi-virtual machine distribution state not only has a long stable time, but also changes from the current distribution state of the virtual machine to the virtual machine distribution state. The number of machine migration and the number of physical nodes are relatively small. Although reference [9] can only be transferred to the new virtual machine distribution state through the minimum number of virtual machine migration, but the distribution state of the new virtual machine can only be maintained for a relatively short time. Once the virtual machine distribution becomes unstable, it will stimulate new dynamic resource configuration requests and create a new virtual machine migration.

Results and discussion

In this paper, an adaptive management and multi-objective optimization method for virtual machine placement in cloud computing is proposed based on particle swarm optimization (PSO). The objective optimization model of adaptive management of virtual machine placement in cloud computing is constructed by particle swarm evolution, and the global optimization control of adaptive management of virtual machine placement in cloud computing is carried out by introducing extremum perturbation operator. The global dynamic objective function of particle swarm optimization is constructed, the global optimal solution of virtual machine in cloud computing is found by deconvolution algorithm, and the optimal position of particle swarm is searched in two-dimensional space. The multi-objective optimization problem of adaptive management of virtual machine placement is transformed into particle swarm optimization problem to realize adaptive management and multi-objective optimization of virtual machine placement in cloud computing. Simulation results show that the adaptive management of virtual machine placement in cloud computing using this method has better global optimization ability, better convergence of particle swarm optimization, and better performance of multi-objective optimization. This method has very good application value in the cloud computing virtual machine placement optimization management.

In this paper, the above work has been completed, and some research results have been obtained. However, due to the limitation of time and experimental environment, there are many solutions to be further optimized and perfected.

• (1) The scheduling model is further improved. Integrating the resources in the cloud environment, optimizing the structure of the virtual resources of the data center, promoting the standardized management of the cloud computing resources, realizing the accurate and efficient and timely adaptive management of the cloud computing virtual machine layout, and improving the quality of the cloud computing service.

• (2) We need to continue to improve the particle swarm optimization. On the basis of this algorithm, we optimize the rules of particle elimination, improve the accuracy of parameter adjustment, and improve the algorithm of premature processing.

• (3) Although the simulation algorithm can get better experimental results, but the actual situation will be more complex, so the future work can build a formal experimental environment to verify the feasibility of the algorithm.