nueva página del texto (beta)
Inglés (pdf)
Artículo en XML
Referencias del artículo
Traducción automática
Enviar artículo por email
Citado por SciELO 
Similares en
SciELO 
Permalink
1 Introduction
In the modern high-tech world, cloud computing has emerged as a crucial component of technology. It has proved itself to be a utility as pay-per-use model to deliver the resources to the cloud users from the datacenters virtually through Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS) [1]. The significant cost of expense in the datacenters is the cost of consumption of energy [2]. Energy consumption in the cloud datacenters is increasing rapidly. Costs associated with consuming energy in the datacenters of Amazon Web Services measures nearly 42% of the total operational price [3].
According to the prediction of Natural Resources Defense Council (NRDC), the amount of electricity consumed by the cloud datacenters annually was assumed to be projected to 140 billion kilowatt-hours by 2020, analogous to the yearly production of electricity by nearly 50 numbers of power plants, costing around $13 billion in the form of electricity bills [4].
If the remedial measures have not taken and the technological trends remain unchanged for the coming decade, then between 2016 and 2030, the energy consumption by the datacenters may exceed with 12% approx. [5].
The strategy of virtual machine placement (VMP) directly influences the consumption of energy in a cloud datacenter [6].
Although a handful of researches conducted to minimize the consumption of energy in cloud datacenters, efficient methodologies are still scarce. Addressing this issue through VMP in the cloud datacenters is becoming the area of interest for researchers globally.
Hence, we are motivated to contribute a little to this vast field of emerging aspect of research in cloud milieu. This piece of work is devoted in exploring the strategy of VMP in minimizing the usage of energy in the cloud datacenters. The following points are the key contributions of this work.
– The proposed methodology introduces a hybrid nature inspired optimization technique for solving the problem of VMP in the cloud milieu. At first the Salp Swarm Algorithm (SSA) [7] is used to explore geographically and then exploit to find out the best datacenter possible for VMP.
An algorithm of recent times inspired by the Emperor Penguins Colony (EPC) [8], enriched with the potential of local search is implemented to trace the most suitable server in the datacenter for placing the virtual machine (VM).
Hence, our proposed hybrid algorithm Salp Swarm based Emperor Penguins Colony (SSEPC) is found to be better in terms of overcoming the limitations of each other to establish a robust methodology in comparison to other metaheuristic techniques.
– Unlike other existing VMP proposals, our model portrays both initial as well as the runtime VMP in the cloud milieu.
This paper is organized into different sections as follows. The literature of VMP along with consumption of energy in cloud milieu is reviewed in Section 2.
The proposed strategy along with the mathematical formulations of the proposed work are elucidated in Section 3.
Next, the Section 4 deliberates the simulation environment, as well as analyzes the experiments conducted in heterogeneous cloud environment and the obtained results.
Finally, the conclusive remarks along with the future directions in the research carried out in this domain are illuminated in the Section 5.
2 Related Work
We have gone through the existing works related to VMP in the cloud milieu. Some researchers [9-12] worked on intra datacenter VMP, i.e. VMP in the servers of a single datacenter, while others [6, 13-16] proposed methodologies for VMP in inter datacenter or multi datacenter environments. Jayasinghe et al. [17] stated that the process of VMP is further divided into two separate stages, i.e. (i) initial VMP and (ii) runtime VMP.
Unlike most of the other VMP proposals, we have considered both initial as well as runtime VMP in inter datacenter environment in our proposed work. Most of the authors [6, 9-16, 18-20] considered energy consumption in the datacenters as the basic QoS parameter due to the alarming situation of energy consumption and scarcity due to limited energy sources.
Authors in [6, 9-16, 20] prioritized the servers as the basic cause of energy consumption in the datacenters and proposed various techniques for its minimization. We have also prioritized the servers as the root cause of energy consumption.
The physical servers even in the idle state consume more than two-third of the energy, i.e. mostly 50-70% of the active state energy usage by the servers [21].
Hence, the insufficient utilization of the server with the waste of energy during idle state results in high energy consumption in the datacenters. Various strategies, such as dynamic voltage or frequency scaling, VM consolidation, and shutting down of servers or scheduling to sleep mode are implemented for the reduction of energy consumption in the cloud datacenters [22, 23].
We have forced the underutilized servers to switch into the sleep mode in this proposed work. An algorithm, which solves a problem set efficiently, may not be able to solve the problems of a different set. None of the existing algorithms is adequate enough for solving all optimization problems, which is proved by the No-Free-Lunch (NFL) [24].
This fact inspires in developing new metaheuristic techniques. New algrthms prove themselves to be better in solving problems as compared to the existing ones.
Hence, we have hybridized two recent metaheuristic techniques SSA (2017) [7] and EPC (2019) [8] to search the global space for VMP. Hybridizing multiple methodologies helps in overcoming the limitations of one another [25].
Table 1 analyzes the existing hybrid algorithms chosen for comparison with the proposed approach. Here, in our proposed methodology, SSA algorithm is implemented to explore the search space globally and exploit the positions further to find out the suitable datacenter for VMP in the Phase-I of SSEPC.
Table 1 Existing Hybrid Algorithms for the Virtual Machine Placement in Cloud Milieu
| Authors | Proposed Algorithm | Algorithms involved in Hybridization | Purpose of Hybridization |
| Liu et al. [9] | OEMACS | Order Exchange and Migration algorithm and the algorithm of Ant Colony System | OEM swaps VMs between servers locally, whereas ACS allocates VMs in minimum number of servers through global search |
| Zhao et al. [11] | GATA | Genetic Algorithm and Tabu-search Algorithm | The algorithm of Tabu-search works like a mutation operator of genetic algorithm for improving its local search ability |
| Gharehpasha et al. [14] | SCA-SSA | Sine Cosine Algorithm and Salp Swarm Algorithm | SCA explores and exploits the space of searching for finding the optimum solution, whereas SSA manages leader and followers in the population to reach at the optimal solution |
After this, the EPC metaheuristic technique enriched with the capability of local search is implemented in the second phase of SSEPC to find out the most appropriate server in the datacenter to host the VMs.
We have hybridized both the above-mentioned metaheuristic techniques to improve the robustness of the searching paradigm in the vast cloud-based search space with the objective to minimize energy consumption.
The proposed SSEPC algorithm is of multi-stage collaborative hybrid type, which hybridizes two stochastic collective algorithms based on swarm intelligence.
3 Proposed Methodology
The proposed algorithm along with the mathematical formulations of the proposed work are elucidated in this section.
The process of VMP can be briefly outlined into some steps, such as (1) Users submit the requests to allocate VMs for the execution of single or multiple tasks, (2) The VMP system invokes the SSEPC algorithm for selecting the most suitable datacenter and server for placement of the VMs, (3) The SSEPC based VMP method is executed for minimizing the energy consumption and (4) The data of resource utilization is updated after the execution of VMP.
3.1. Mathematical Formulations
Let the set of
Each datacenter has
Each server allocates
R is the set of
The consumption of energy by a server
Here,
The energy consumption of a datacenter
The energy consumed by all the datacenters
The capacity of a VM
where
Hence, the capacity of a server
On regular intervals, the proposed technique calculates the values of energy consumption and capacity of the servers of the datacenter for the VMP.
3.2. Proposed SSEPC Algorithm
In the first phase of SSEPC, exploration and exploitation are executed to find out the appropriate datacenter for VMP. In 2017, Mirjalili et al. proposed SSA as an optimization technique to solve the design problems in engineering [7]. It got inspired from the foraging nature of a creature called salp living in the deep ocean.
In our proposed model, we have implemented the principle of SSA for resolving the issue of VMP in the dynamic cloud milieu. The user requests to create VMs are considered as the salps in the population foraging the food sources, where the computing resources in the datacenters mimic the foods.
The salps compete among themselves to discover the best source of food. Similarly, the requests also compete for availing the most suitable datacenters with respect to the minimization of consumption of energy.
From a user, the first request to create a VM is treated as the leader salp. Then the other requests from the same user behave like follower salps on the basis of updated data received from the leader.
A list is maintained and updated on regular intervals to monitor the consumption of energy by the datacenters. The list contains the datacenters in increasing order of energy consumption.
The datacenter consuming minimum energy is chosen for VMP. The first phase of proposed SSEPC is presented in the Algorithm 1.
After the first phase of SSEPC, the second phase is executed on the basis of emperor penguins colony algorithm to search the most suitable server in a datacenter to host the virtual machines. Sasan Harifi et al. have proposed a new metaheuristic technique in 2019 on the basis of the behavior of emperor penguins [8].
We have mimicked the herd of the penguins as the server and the penguins as the VMs. A penguin intends to be warmed goes to a nearby huddle randomly. Likewise, a VM is allotted to a server in the datacenter arbitrarily. If the huddle has maximum number of penguins, then the new penguin arrived recently will remain at the periphery and can’t be warmed enough.
So, this penguin will again move to another huddle having less than maximum number of penguins to be warmed appropriately. But if a huddle contains very less number of penguins, then the penguins loss a lot of energy and enough heat can’t be generated in that huddle. So, those penguins prefer to move to an existing huddle with sufficient capacity to be accommodated, by dissolving their huddle.
Similarly, a new VM migrates to an appropriate server accommodating less than maximum VMs, as it can’t be allocated with resources by a server already reached to its maximum capacity. Likewise, if a server is allocated with very less number of VMs, it lets the VMs to migrate to another servers and goes to sleep mode for conserving energy.
This is the process of VM migration in running VMP. Servers accommodate the VMs till they have not reached the upper bound threshold value
Algorithm 2 represents the VM migration in running VMP among the servers of a datacenter in the second phase of proposed SSEPC metaheuristic technique.
4 Performance Evaluation
This section illustrates the setup for the experimental work for the evaluation of the efficiency of proposed technique in comparison to some other metaheuristic techniques for VMP. As it is difficult to evaluate on real cloud infrastructure, we have conducted our experiments using CloudSim [28].
Here, we have considered each datacenter comprising of four numbers of servers with dissimilar configurations further virtualized for creating an abstract and isolated environment. 300 VMs with disparate specifications are deliberated for mapping onto the servers.
This research considers a heterogeneous cloud milieu, where the number of servers concurrently vary with the number of VMs to endorse the efficacy of the proposed metaheuristic technique. The energy usage is considered for validating the proposed work.
For evaluating the efficacy of SSEPC VMP algorithm, we have chosen SCA-SSA, OEMACS, and GATA as three recent hybrid algorithms of VM placement proposed by Gharehpasha et al. [14], Liu et al. [9], and Zhao et al. [11] respectively for comparison with our proposed methodology.
As these three algorithms are evolved by the hybridization of two other existing algorithms just like the hybridization applied in our proposed work, we have chosen them as the appropriate contemporaries of our work in the same direction for comparison.
After simulating our experiments in CloudSim, we have obtained the results for validating our work. In SCA-SSA, for the exploration and the exploitation of the search space, SCA is utilized for finding the optimum solution.
Similarly, ACS allocates VMs through global search in OEMACS. Genetic algorithm executes the searching mechanism for finding the optimal solution, where tabu search enhances the local search ability of genetic algorithm as a mutant in GATA.
In contrast, our proposed methodology SSEPC applies the divide and conquer principle, where it divides the entire search space broadly into two parts and implements two algorithms in multi-stage collaborative approach for them separately.
Hence, we found our proposed methodology outperforming its counterparts in VM placement strategy in the cloud milieu. Fig. 1 shows, SSEPC consumes less energy as compared to SCA-SSA, GATA, and OEMACS.
Here, the maximum value of consumption of energy is taken as
The values of average energy consumption while implementing SSEPC, GATA, OEMACS, and SCA-SSA are found to be
It is already stated above that SSEPC is more efficient in searching than others, for which it avails most suitable resources with better utilization. SSEPC also implements the runtime VMP. So, it produces optimum result in energy consumption in comparison to other algorithms.
5 Conclusion and Future Work
This paper proposes a multi-stage collaborative hybrid algorithm to solve the problem of VMP in the cloud milieu. The proposed SSEPC methodology searches the suitable datacenter in the first phase by utilizing salp swarm optimization. In the second phase, it implements emperor penguins colony algorithm to search locally in a datacenter to find the most suitable server to place the VMs.
Along with initial VMP, runtime VMP is also applied in this strategy. The energy consumption is considered for the evaluation of efficacy of the proposed hybrid metaheuristic technique in comparison to some recent VMP algorithms, where it outperforms others.
As part of our future work, the cost of energy consumption and carbon footprint cost along with calculating their amounts to analyze the evaluation from both qualitative and quantitative perspective can be included. Renewable energy sources can also be utilized to move towards a greener cloud environment. Hybridization of some other techniques in this direction can be explored to optimize the metrics better.
