<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">20473</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.020473</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Allocation and Migration of Virtual Machines Using Machine Learning</article-title>
<alt-title alt-title-type="left-running-head">Allocation and Migration of Virtual Machines Using Machine Learning</alt-title>
<alt-title alt-title-type="right-running-head">Allocation and Migration of Virtual Machines Using Machine Learning</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Talwani</surname><given-names>Suruchi</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Alhazmi</surname><given-names>Khaled</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref><email>khazmi@kacst.edu.sa</email>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Singla</surname><given-names>Jimmy</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Alyamani</surname><given-names>Hasan J.</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Bashir</surname><given-names>Ali Kashif</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>School of Computer Science &#x0026; Engg., Lovely Professional University</institution>, <addr-line>Punjab</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>National Center for Robotics and Internet of Things Technology, Communication and Information Technology Research Institute, King Abdulaziz City for Science and Technology (KACST)</institution>, <addr-line>Riyadh, 11442</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Information Systems, Faculty of Computing and Information Technology in Rabigh, King Abdulaziz University</institution>, <addr-line>Rabigh, 21911</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Computing and Mathematics, Manchester Metropolitan University</institution>, <addr-line>Manchester, M156BH</addr-line>, <country>UK</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Khaled Alhazmi. Email: <email>khazmi@kacst.edu.sa</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-09-13"><day>13</day><month>9</month><year>2021</year></pub-date>
<volume>70</volume>
<issue>2</issue>
<fpage>3349</fpage>
<lpage>3364</lpage>
<history>
<date date-type="received"><day>26</day><month>5</month><year>2021</year></date>
<date date-type="accepted"><day>27</day><month>6</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Talwani et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Talwani et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_20473.pdf"></self-uri>
<abstract>
<p>Cloud computing promises the advent of a new era of service boosted by means of virtualization technology. The process of virtualization means creation of virtual infrastructure, devices, servers and computing resources needed to deploy an application smoothly. This extensively practiced technology involves selecting an efficient Virtual Machine (VM) to complete the task by transferring applications from Physical Machines (PM) to VM or from VM to VM. The whole process is very challenging not only in terms of computation but also in terms of energy and memory. This research paper presents an energy aware VM allocation and migration approach to meet the challenges faced by the growing number of cloud data centres. Machine Learning (ML) based Artificial Bee Colony (ABC) is used to rank the VM with respect to the load while considering the energy efficiency as a crucial parameter. The most efficient virtual machines are further selected and thus depending on the dynamics of the load and energy, applications are migrated from one VM to another. The simulation analysis is performed in Matlab and it shows that this research work results in more reduction in energy consumption as compared to existing studies.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Cloud computing</kwd>
<kwd>VM allocation</kwd>
<kwd>VM migration</kwd>
<kwd>machine learning</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Cloud computing offer tremendous opportunities to IT sector for outsourcing computing resources and services. It is one of the most renowned service in the technological world in which Service Providers (SP) and Service Users (SU) are the key elements. It grants vast computing power to support numerous web-based services while providing large storage space. NIST (National Institute of Standards and Technology) had defined cloud computing as a model to deliver a convenient network to pool a number of computing services rapidly with minimal management effort required at the service provider end [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. In cloud computing everything is provided in the form of service. The services fitted in these models, namely Infrastructure-as-a-Service (IaaS) [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>] Platform-as-a-Service (PaaS) [<xref ref-type="bibr" rid="ref-5">5</xref>,<xref ref-type="bibr" rid="ref-6">6</xref>] and Software-as-a-Service (SaaS) [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>]. As the cloud is becoming a conventional practice, the cloud storage is also becoming affordable and cheaper [<xref ref-type="bibr" rid="ref-9">9</xref>]. The recent time has shown emergence of Google, Microsoft, Amazon and IBM as some of the key players offering range of cloud services to their customers. However, an efficient VM utilization is required to deliver a consistent, flexible, interoperable and cost effective service to SUs [<xref ref-type="bibr" rid="ref-10">10</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<p>Here, virtualization is the main technology that has been used to design energy efficient data centre. A generalized VM allocation and migration scheme is illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref> [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>]. The idea here is to migrate the running VMs from heavily loaded nodes to moderately loaded nodes in an energy efficient manner. In this process, the VMs can be created, deleted or migrated depending upon the workload, request batching, task scheduling, kind of service selected and location of the clouds (local or remote). The creation of virtual environment involves installation of multiple VMs on a single physical node. With the increase in user demand, cloud SPs scale up additional VMs to satisfy the quality of services to SUs. The concept of live migrations was evaluated to offer dynamic and transparent migrations of VMs between hosts to identify the best target. Further, active VM servers prevent the resource under-utilization by minimizing the resource idle time. In addition to this, VM migration helps in the identification of the hot-spots in the data centres and eventually leads to green cloud data centres. The virtualization process has significantly resulted in the reduction of overall power or energy consumption. These results are obtained when same set of tasks is completed with and without involvement of virtualization. This shows that virtualized ICT requires less energy as compared to non-visualized ICT.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>VM allocation and migration scheme [<xref ref-type="bibr" rid="ref-12">12</xref>]</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-1.png"/></fig>
<p>It is an important consideration that an over utilized PM may degrade the service quality while an underutilized PM causes wastage of resources. Therefore, an efficient utilization of the resources requires better resource management in terms of machine allocation and migration. VM auto scaling approach significantly helps in estimation of resource utilization to predict the future workload. However, achieving energy optimization through VM migration may resolve the issue to some extent but it requires manual selection of number of nodes in the input and output layer [<xref ref-type="bibr" rid="ref-14">14</xref>]. Another possible option is integration of bio-inspired algorithms to find a near optimal solution for helping the cloud data centre [<xref ref-type="bibr" rid="ref-15">15</xref>]. The meta-heuristics is the primary procedure to resolve the optimization issues of diverse fields including cloud computing [<xref ref-type="bibr" rid="ref-16">16</xref>]. In recent times, a large number of meta-heuristic approaches have been integrated to identify the optimal solution in terms of VM [<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>These approaches have been proved to be powerful tools to find an optimal solution in both local and global search space [<xref ref-type="bibr" rid="ref-19">19</xref>]. Therefore, authors are motivated to present a VM allocation and migration framework integrated with bio-inspired algorithms that could successfully identify optimal VM to perform the task with minimal energy consumption.</p>
<sec id="s1_1"><label>1.1</label><title>Contribution of the Work</title>
<p>The major contribution of the work is to perform an energy efficient live VM migrations between active nodes based on meta-heuristic technique. It also identifies the VM migration that requires minimal energy expenditure without compromising with quality of services. The work is also done to minimize the number of migrations required to complete the task.</p>
<p>The list of abbreviations used in the paper are summarized in <xref ref-type="table" rid="table-1">Tab. 1</xref>.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>List of abbreviations used</title></caption>
<table>
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Abbreviation</th>
<th align="left">Description</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">ACO</td>
<td align="left">Ant Colony Optimization</td>
</tr>
<tr>
<td align="left">IaaS</td>
<td align="left">Infrastructure-as-a-Service</td>
</tr>
<tr>
<td align="left">NIST</td>
<td align="left">National Institute of Standards and Technology</td>
</tr>
<tr>
<td align="left">PaaS</td>
<td align="left">Platform-as-a-Service</td>
</tr>
<tr>
<td align="left">PM</td>
<td align="left">Physical Machine</td>
</tr>
<tr>
<td align="left">SaaS</td>
<td align="left">Software-as-a-Service</td>
</tr>
<tr>
<td align="left">SP</td>
<td align="left">Service Provider</td>
</tr>
<tr>
<td align="left">SU</td>
<td align="left">Service User</td>
</tr>
<tr>
<td align="left">TESA</td>
<td align="left">Threshold Energy Saving Algorithm</td>
</tr>
<tr>
<td align="left">VM</td>
<td align="left">Virtual Machine</td>
</tr>
<tr>
<td align="left">SLA</td>
<td align="left">Service Level Agreement</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s1_2"><label>1.2</label><title>Organization of the Paper</title>
<p>The rest of the paper is structured in five sections. Section 2 discusses the state-of-art work available for improvement in energy efficiency of cloud data centres with the concept of VMs, virtual machine migration and Swarm Intelligence algorithm. Section 3 represents the proposed algorithm and Section 4 discusses the results. The research work is concluded in Section 5 followed by the references cited in the paper.</p>
</sec>
</sec>
<sec id="s2"><label>2</label><title>Literature Review</title>
<p>The most important aspect of energy efficient cloud computing is successful deployment of large number of applications with least power consumption [<xref ref-type="bibr" rid="ref-20">20</xref>]. To address this, a lot of research work is being conducted in the area of cloud computing to reduce the power consumption in the data centre [<xref ref-type="bibr" rid="ref-21">21</xref>&#x2013;<xref ref-type="bibr" rid="ref-24">24</xref>]. Recently, a technique was proposed to minimize the power wastage by minimizing the number of VM migrations between VMs and PMs. It significantly reduced the overall energy consumption [<xref ref-type="bibr" rid="ref-25">25</xref>]. In literatures a number of evolutionary approaches have been discussed to address VM allocation issues. Genetic algorithms are also implemented to resolve the challenges of cloud data center. Experimental analysis is performed using Family Gene approach and it results in significant reduction in the migration rate and the energy consumption [<xref ref-type="bibr" rid="ref-26">26</xref>]. Further to conserve energy and maintain the optimal performance, the bio-inspired techniques are used to migrate the extremely loaded VM to the least loaded active node. Simulation analysis using CloudSim demonstrated a reduction of 72.34&#x0025; in VM migrations with an energy conservation of 44.39&#x0025;. The selection of VMs is a wiser consideration that guarantees that the demand for computational resources and the performance are accomplished side-by-side. A dynamic redesigned VM allocation algorithm was evaluated against BitBrains, PlanetLab and Google Cluster work load data. The performance analysis took into consideration both allocated RAM and CPU utilization that is further evaluated for VM migrations, host shut downs and energy consumption against virtualization migration with abstract and static threshold. This eco-friendly best fit technique resulted in reduced number of migrations with lesser SLA violations. However, VM selection could be improved with the involvement of fuzzy algorithm with unique selection criteria [<xref ref-type="bibr" rid="ref-27">27</xref>].</p>
<p>The key challenge is the increased amount of energy consumption by the cloud computing data centres. To address this, a strategy &#x201C;PPRGear&#x201D; based on the sampling of energy utilization levels was put forward. They computed the energy utilization by measuring the number of server-side operations that were completed in a unit time to the power consumption. This was followed by VM allocation and migration based on optimal balanced created between energy consumption and host utilization. The strategy demonstrated a reduction in energy consumption by 69.31&#x0025; with fewer instances of shutdown time and performance degradation of cloud data centres [<xref ref-type="bibr" rid="ref-28">28</xref>]. The existing TESA results in too many migrations that ultimately degraded the overall performance. Therefore, limitations of TESA were improved with the involvement of ACO. The idea here was to apply VM placement to the host that results in reducing the number of migrations. This approach also demonstrated reduced number of SLA violations [<xref ref-type="bibr" rid="ref-29">29</xref>]. Live VM migrations powered by virtualization technology was addressed with the implementation of micro-genetic algorithm to avoid overutilization of hosts. An analysis against traditional GA and PABFD demonstrated significant reduction in terms of SLA violations, number of utilized hosts with power consumption between 150.02kWh and 163.05kWh under different scenarios [<xref ref-type="bibr" rid="ref-30">30</xref>]. A meta-heuristic approach AntPu resulted in dynamically placing the VMs inside PM in order to optimally utilize the resources with minimum SLA violations in cloud based data centres [<xref ref-type="bibr" rid="ref-31">31</xref>].</p>
<p>The investigation of the existing work inferred that most of the researchers had focused on the power management and energy conservation through virtualization technology. The rising diversity and complexity of the data centres in terms of heterogeneity of devices, diverse OS and the requirement of high performance necessitates the deployment of an architecture that could tackle all these challenges. Further, research community is also observed to have significantly attraction towards the biologically inspired computing approaches. These approaches are based on the challenges encountered by the biological species to resolve the living challenges in terms of evolution, self-repair, self-organization, navigation, dynamic movements despite the presence of incredible diversity. The lessons learned from the biological systems are implemented as ACO, ABC, CS, PSO, and FFA to address the issues of cloud computing environment.</p>
<p>The inspiration drawn from these works motivates authors to integrate ABC that is strengthened with the biological behaviour of bees for searching food and CS that is based on the egg laying behaviour of cuckoos for rearing their offspring in the present work. The selection criteria employed here is the coverage of large search space with the division of labour by the bees in minimal time steps and the high coverage speed and global optimization attained by cuckoos. Further, the concept entails the utilization of minimal power or energy resources by selection of best VM for migration. It minimizes the number of VM migrations required to achieve energy efficient scenario [<xref ref-type="bibr" rid="ref-32">32</xref>,<xref ref-type="bibr" rid="ref-33">33</xref>].</p>
<sec id="s2_1"><label>2.1</label><title>Virtual Machine Migration</title>
<p>In essence, virtualization generates an illusory image or version, e.g., server, operating system (OS), which saves media or network resources to be used simultaneously on different machines. The prime objective of virtualization is to handle the workload in a more scalable, efficient and economical way. One can enhance the use of user-accessible resources by using virtualization to have more benefits. The most important benefits are separation among users, sharing of resources and gathering of resources. Virtual machine migration architecture is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Virtual machine migration architecture</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-2.png"/></fig>
<p>Virtualization helps to split one physical machine into many virtual machines (VMs) that operate simultaneously and have the same physical resources. In an individual physical machine, there is a possibility of using a number of VMs. The load should be transferred to the other machine in the event of physical host overload. The process of transferring load from one machine to another is known as &#x2018;migration&#x2019;</p>
<p>There are certain issues which are related to VM allocation and migration. The allocation and migration policy depends majorly on two factors namely the selection of the PM from where the VMs are to be migrated and then selection of the PMs where the VMs are to migrated. The PMs which are found to be over-utilized in terms of CPU utilization, are referred to as hotspot PM and the PM where the VMs are to be migrated are called target PM. In order to select the VMs from the hotspot PM, and to select the target PM, the usage of Swarm Intelligence (SI) has been observed quite often. Firefly algorithm is also used for the selection of the target VM whereas the selection of the VM from the hotspot PM has been done using computational load and its performance against the load. The same set of authors have also tried their hand with Artificial Bee Colony algorithm for the selection of VMs for a set of jobs supplied by users [<xref ref-type="bibr" rid="ref-34">34</xref>]. The allocation and migration procedure are shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>The allocation and migration procedure</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-3.png"/></fig>
</sec>
<sec id="s2_2"><label>2.2</label><title>Artificial Bee Colony (ABC)</title>
<p>The ABC algorithm is considered as a swarm-based meta-heuristic algorithm and this algorithm consists of significant elements, such as, employed, unemployed foragers with the food sources. ABC comprises with sets of artificial bees such as employed, onlooker with the scout bees. The initial part has employed bees whereas remaining part of the colony is employed by onlooker bees. The employed bees are connected to precise food source. The onlooker bees analyse the employee bee&#x0027;s dance in the hive for choosing the food source. The scout bees find the new food source in random way. The employed bee is the food collector bee. It searches the food and passes on the food to the Onlooker Bee for the checking and variations. The scout bee is mainly the resting bee and also termed as an unemployed bee. It is a non-working element in the proposed case. The sensitive labels obtained in the last step are passed as input to the ABC algorithm. The intelligence characteristic of the honeybees inspires the ABC algorithm. This bio-inspired algorithm exhibits an admirable search ability to deal with more complicated problems [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Proposed Algorithm</title>
<p>Over utilization is one of the popular concepts from the early days of cloud computing [<xref ref-type="bibr" rid="ref-36">36</xref>]. The proposed algorithm uses this concept of over-utilization. The algorithm uses Modified Best Fit Decreasing (MBFD) method for the allocation of the VMs over the PMs at the first glance. When it comes for the hotspot selection, the underutilized PMs loses all their VMs and the over-utilized PMs lose some of VMs. The proposed algorithm views it as a problem of identifying maximum Rejection-probability (Rp) of the Bees (Bs) from hives &#x2018;h&#x2019; where h is always equal to total number of over-utilized PMs. The proposed algorithm is divided into three stages as illustrated below.</p>
<sec id="s3_1"><label>3.1</label><title>Stage 1</title>
<p>Stage 1 aims to identify all possible hive elements for &#x2018;h&#x2019; number of hives. Stage 1 simply utilizes the concept of Minimization of Migrations (MM) in order to find over-utilized VMs over an Identified-hotspot (Ih). If the VM is underutilized as compared to other VMs in the same list, it will be migrated first. In order to be precise on the order, the underutilized VMs will even be migrated as per the descending order of CPU utilization. After every possible migration, the &#x2018;overload&#x2019; parameter which is again the CPU utilization of Ih is evaluated. If the CPU utilization is normalized and falls under non-hotspot PMs, the Ih is removed from the list of being a possible hive where migration has to take place.</p>
</sec>
<sec id="s3_2"><label>3.2</label><title>Stage 2</title>
<p>Stage 2 evaluates the Remaining Ih (RIh) and selects the VMs as per the designed onlooker bee selection procedure. The working mechanism of (Energy aware ABC) EA-ABC is shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<p>Each RIh goes under the evaluation of EA-ABC where over-utilized VM is one Employed bee (Eb) and for each Eb, there exists a 4 possible food sources. Each food source would replicate the mirror image of the original food source with a deviation &#x2018;dt&#x2019;. This &#x2018;dt&#x2019; is a deviation between the original food source and its mirror image. Original food source of bee is a set of 5 metrics namely total assigned task in Million Instructions Per Second (MIPS), Completed MIPS(C-MIPS), Consumed power (Cp), Most Utilization Time (MUT) and Least Idol Time (LIT). Each candidate VM is termed as employed bee and hence bee food &#x2018;Bf&#x2019; can be termed as a set of [MIPS, C-MIPS, Cp, MUT, LIT]. The onlooker bee would have a different selection threshold for each employed bee and its 4 other possible random fly positions. Onlooker Threshold (T) includes some mathematical computations which are mentioned in the following steps.</p>
<p>Step 1: <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:mtext>Calculate</mml:mtext><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>M</mml:mi><mml:mi>I</mml:mi><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>M</mml:mi><mml:mi>I</mml:mi><mml:mi>P</mml:mi><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>I</mml:mi><mml:mi>P</mml:mi><mml:mi>S</mml:mi></mml:mrow></mml:mfrac><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>Step 2: <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mtext>Calculate</mml:mtext><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>C</mml:mi><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mtext>&#x2009;</mml:mtext><mml:mfrac><mml:mrow><mml:mi>C</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mstyle displaystyle='true'><mml:msubsup><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mi>C</mml:mi></mml:mstyle><mml:mi>p</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:mrow></mml:mfrac><mml:mtext>&#x2009;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>where Cpo is the consumed power by other VMs of other hives with nearly same MIPS.</p>
<p>Step 3: <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:mtext>Calculate</mml:mtext><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>M</mml:mi><mml:mi>U</mml:mi><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mtext>&#x2009;</mml:mtext><mml:mfrac><mml:mrow><mml:mi>M</mml:mi><mml:mi>U</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mstyle displaystyle='true'><mml:msubsup><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mi>M</mml:mi></mml:mstyle><mml:mi>U</mml:mi><mml:mi>T</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:mrow></mml:mfrac><mml:mtext>&#x2009;&#x2009;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>where MUTo is the most idol time spent by other VMs of other hives with nearly same MIPS.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>The work flow</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-4.png"/></fig>
<p>Step 4: <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:mtext>Calculate</mml:mtext><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>L</mml:mi><mml:mi>I</mml:mi><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mtext>&#x2009;</mml:mtext><mml:mfrac><mml:mrow><mml:mi>L</mml:mi><mml:mi>I</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mstyle displaystyle='true'><mml:msubsup><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mi>L</mml:mi></mml:mstyle><mml:mi>I</mml:mi><mml:mi>T</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:mrow></mml:mfrac><mml:mtext>&#x2009;&#x2009;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mn>4</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>Step 5: <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mrow><mml:mtext>&#x2009;Calculate</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mtext>f-onlooker</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>M</mml:mi><mml:mi>I</mml:mi><mml:mi>P</mml:mi><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>C</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy='false'>[</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>M</mml:mi><mml:mi>U</mml:mi><mml:mi>T</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>L</mml:mi><mml:mi>I</mml:mi><mml:mi>T</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>]</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>5</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>The bee food value(bfv) value will also be decided here.</p>
<p>Step 6: Initiate first fly variation(fv) by calculating average of every metric in Bf and by varying it with the difference of maximum value of each attribute and minimum value of each attribute and further multiplied it with random value which varies from 0&#x2013;1.</p>
<p><inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mrow><mml:mtext>Fv</mml:mtext><mml:mo>=</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mstyle displaystyle='true'><mml:mrow><mml:munderover><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>k</mml:mi></mml:munderover><mml:mrow><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mi>m</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mfrac><mml:mrow><mml:mi>B</mml:mi><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>b</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mi>m</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x2212;</mml:mo><mml:mo stretchy='false'>[</mml:mo><mml:mi>max</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>B</mml:mi><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>b</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mtext>min</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mi>B</mml:mi><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>b</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy='false'>]</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mn>6</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle></mml:mrow></mml:mrow>  </mml:mstyle></mml:mrow></mml:math></inline-formula></p>
<p>where vmcount is the total number of vm in the current hive under Ih, rnd is the random value between 0&#x2013;1, k is total amount of hives.</p>
<p>Step 7. For each step, repeat step 5.</p>
<p>Step 8. There are 4 flies, and hence a Pre-Judgement Metric(P-JM) would be created containing 4 &#x002A; vmcount [Fv] number of values and so as f-onlooker value for each bee and every fly position.</p>
<p>Step 8. Calculate average threshold(at) of each fly position.</p>
<p>Step 9. Create a judgement metric(jm) containing 4 &#x02217; vmcount[Fv] number of zeros.</p>
<p>Step 10. For every position in the fly table, if bfv of current fly is greater than that of at, mark 1 in jm for current fly.</p>
<p>Step 11. After the completion of all the flies, calculate 1&#x2005;s and 0&#x2005;s for every VM in the hive. If 1&#x2005;s are greater than 0&#x2005;s, the VM has been under major load and still performed well. It means, the VM needs some change to avoid over-utilization and should be migrated if required.</p>
</sec>
<sec id="s3_3"><label>3.3</label><title>Stage 3</title>
<p>The third stage evaluates the over migration performance of the VM from the hotspot PM to the target PM for at-least 100 number of migrations during the simulation. The migration count along with the Bf is passed to Support Vector Machine (SVM) to understand the pattern of overload and underload. The trained sample is used to support EA-ABC to perform better in Stage 2.</p>
<p>SVM is a classification algorithm which extends the capabilities of Machine Learning (ML) based on the selection method which is also known as kernel functions [<xref ref-type="bibr" rid="ref-37">37</xref>,<xref ref-type="bibr" rid="ref-38">38</xref>]. It creates a repository which incorporates two types of categories namely Above Post Performance (APP) and Below Post Performance (BPP). The neutralization parameter would be Bf and the neutralization method would be similar to that of methods explained in Stage 2. When the system learns from the real time experience for the first 1000 simulations, a 25&#x0025; decision support is taken by SVM. For every 1000 simulations, the contribution of SVM increases by 1&#x0025; in the decision making of EA-ABC algorithm. The working of SVM can be illustrated with the help of following Pseudo Code</p>
<p>Pseudo Code 1: Train and Support through SVM
<list list-type="simple">
<list-item><label>a)</label><p>Input Set: Bf, Ids.Bf, Pre-trained-structure (Pts), Label-set(Ls) &#x20AC; {APP, BPP}</p></list-item>
<list-item><label>The</label><p>Pts contains the previous learnings of SVM if there is available in the set.
Bf is the feature metric created in EA-ABC algorithm Ids is the array containing the identity number of VMs</p></list-item>
<list-item><label>b)</label><p>Initialize SVM with Bf, Ls</p></list-item>
<list-item><label>c)</label><p>Kernel set &#x003D; {&#x201C;Linear&#x201D;,&#x201D;Polynomial&#x201D;,&#x201D;RBF&#x201D;}</p></list-item>
<list-item><label>d)</label><p>Trained-SVM (T-SVM) &#x003D; Train(Bf, Ls, Kernel set)</p></list-item>
<list-item><label>e)</label><p>Test SVM with validation ratio of {.15,.30,.50}</p></list-item>
<list-item><label>f)</label><p>Embed T-SVM to Pts</p></list-item>
</list></p>
<p>The kernels play an important role in the selection of the support vector. It is observed that, RBF kernel performs well when it comes to open selection. SVM Validations are shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>SVM validations</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-5.png"/></fig>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Results and Discussion</title>
<p>The experimental analysis of the proposed technique to address the energy challenges of the cloud centre is performed using Matlab. The simulation study is performed to illustrate actual behaviour of the algorithm. The parametric description including the specification details is given in <xref ref-type="table" rid="table-2">Tab. 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label><caption><title>Simulation parameters</title></caption>
<table>
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Parameter</th>
<th align="left">Description</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Number of VMs</td>
<td align="left">10&#x2013;200</td>
</tr>
<tr>
<td align="left">Number of Hosts</td>
<td align="left">10&#x2013;100</td>
</tr>
<tr>
<td align="left">Bandwidth used</td>
<td align="left">2.5Gbps</td>
</tr>
<tr>
<td align="left">Types of Hosts used</td>
<td align="left">2 Types</td>
</tr>
<tr>
<td align="left">Types of VM used</td>
<td align="left">4</td>
</tr>
<tr>
<td align="left">Primary Memory Allocated to each Host</td>
<td align="left">4 GB</td>
</tr>
<tr>
<td align="left">Secondary Storage Allocated to each Host</td>
<td align="left">1 TB</td>
</tr>
<tr>
<td align="left">Primary Memory Allocated to each VM</td>
<td align="left">1 GB to 4 GB</td>
</tr>
<tr>
<td align="left">Secondary Memory Allocated to each VM</td>
<td align="left">2.5 GB</td>
</tr>
<tr>
<td align="left">Simulator Used</td>
<td align="left">Matlab 2016a</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The energy consumed with reduction in the number of VM migrations is the major parameter that is analysed in this research work. The comparative analysis in terms of variation in the number of hosts utilized and the number of migrations against a rise in the number of VMs is listed in <xref ref-type="table" rid="table-3">Tab. 3</xref>. The comparative study involves comparison of this research work that is based on the two techniques namely, ABC and CS against two existing works of Kansal et al. [<xref ref-type="bibr" rid="ref-39">39</xref>] and Naik et al. [<xref ref-type="bibr" rid="ref-40">40</xref>].</p>
<table-wrap id="table-3">
<label>Table 3</label><caption><title>Analysis of number of host and migrations</title></caption>
<table>
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Number of VMs</th>
<th align="left" colspan="3">Number of hosts</th>
<th align="left" colspan="3">Number of migrations</th>
</tr>
<tr>
<th align="left">EA-ABC &#x002B;SVM</th>
<th align="left">Kansal et al. [<xref ref-type="bibr" rid="ref-39">39</xref>]</th>
<th align="left">Naik et al. [<xref ref-type="bibr" rid="ref-40">40</xref>]</th>
<th align="left">EA-ABC &#x002B;SVM</th>
<th align="left">Kansal et al. [<xref ref-type="bibr" rid="ref-39">39</xref>]</th>
<th align="left">Naik et al. [<xref ref-type="bibr" rid="ref-40">40</xref>]</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">10</td>
<td align="left">7</td>
<td align="left">8</td>
<td align="left">8</td>
<td align="left">0</td>
<td align="left">1</td>
<td align="left">0</td>
</tr>
<tr>
<td align="left">20</td>
<td align="left">9</td>
<td align="left">10</td>
<td align="left">9</td>
<td align="left">0</td>
<td align="left">2</td>
<td align="left">0</td>
</tr>
<tr>
<td align="left">40</td>
<td align="left">12</td>
<td align="left">18</td>
<td align="left">15</td>
<td align="left">1</td>
<td align="left">3</td>
<td align="left">0</td>
</tr>
<tr>
<td align="left">60</td>
<td align="left">19</td>
<td align="left">25</td>
<td align="left">23</td>
<td align="left">1</td>
<td align="left">5</td>
<td align="left">1</td>
</tr>
<tr>
<td align="left">80</td>
<td align="left">23</td>
<td align="left">36</td>
<td align="left">28</td>
<td align="left">2</td>
<td align="left">7</td>
<td align="left">2</td>
</tr>
<tr>
<td align="left">100</td>
<td align="left">29</td>
<td align="left">40</td>
<td align="left">37</td>
<td align="left">2</td>
<td align="left">8</td>
<td align="left">3</td>
</tr>
<tr>
<td align="left">120</td>
<td align="left">32</td>
<td align="left">50</td>
<td align="left">45</td>
<td align="left">3</td>
<td align="left">9</td>
<td align="left">4</td>
</tr>
<tr>
<td align="left">140</td>
<td align="left">40</td>
<td align="left">63</td>
<td align="left">58</td>
<td align="left">4</td>
<td align="left">10</td>
<td align="left">5</td>
</tr>
<tr>
<td align="left">160</td>
<td align="left">50</td>
<td align="left">80</td>
<td align="left">71</td>
<td align="left">5</td>
<td align="left">13</td>
<td align="left">6</td>
</tr>
<tr>
<td align="left">180</td>
<td align="left">70</td>
<td align="left">90</td>
<td align="left">80</td>
<td align="left">7</td>
<td align="left">14</td>
<td align="left">8</td>
</tr>
<tr>
<td align="left">200</td>
<td align="left">86</td>
<td align="left">120</td>
<td align="left">98</td>
<td align="left">9</td>
<td align="left">18</td>
<td align="left">10</td>
</tr>
<tr>
<td align="left">220</td>
<td align="left">95</td>
<td align="left">135</td>
<td align="left">110</td>
<td align="left">10</td>
<td align="left">19</td>
<td align="left">11</td>
</tr>
<tr>
<td align="left">240</td>
<td align="left">104</td>
<td align="left">148</td>
<td align="left">130</td>
<td align="left">12</td>
<td align="left">20</td>
<td align="left">12</td>
</tr>
<tr>
<td align="left">260</td>
<td align="left">124</td>
<td align="left">160</td>
<td align="left">142</td>
<td align="left">13</td>
<td align="left">22</td>
<td align="left">14</td>
</tr>
<tr>
<td align="left">280</td>
<td align="left">135</td>
<td align="left">168</td>
<td align="left">155</td>
<td align="left">14</td>
<td align="left">24</td>
<td align="left">15</td>
</tr>
<tr>
<td align="left">300</td>
<td align="left">146</td>
<td align="left">174</td>
<td align="left">160</td>
<td align="left">15</td>
<td align="left">27</td>
<td align="left">16</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The tracking of the number of active hosts is very important in order to prevent situations in which the hosts sit idle and consume unnecessary energy. Therefore, this research work is first compared for the number of active hosts against two existing works. The implementation of the optimization architecture results in significant decrease in the number of active hosts. It is observed that with an increase in the number of VMs, the number of hosts and number of migrations also increases. The improvement analysis illustrated in <xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows that there is 10&#x0025; to 30&#x0025; improvement for number of hosts observed over 10 to 300 VMs. This is because ABC and CS chose more accurate hosts for VM allocation with reduced discovery time owing to their fast coverage speed to identify global optimization.</p>
<fig id="fig-6">
<label>Figure 6</label><caption><title>Percentage improvement in terms of number of hosts</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-6.png"/></fig>
<p>This improvement in the resource utility further results in reduction in the number of VM migrations that in turn avoids any wastefulness of energy resources. The change in the number of migrations with respect to number of VMs is also summarized in <xref ref-type="table" rid="table-3">Tab. 3</xref>. It is observed that increase in the number of VMs results in increase in the number of migrations. However, the number of migrations required with the implementation of this work are much less as compared to existing studies. The improvement observed for this research work in terms of VM migration is illustrated in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The simulation analysis shows that the EA-ABC &#x002B;SVM requires less VM migrations in contrast to implementation of other existing studies. This further reflects the improved ability to identify and allocate the best VM in order to minimize the number of migrations.</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>Percentage improvement in terms of number of migrations</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-7.png"/></fig>
<p>The ability of the proposed EA-ABC and SVM to actively allocate the best VM is further evaluated for energy consumption and the number of SLA violations. <xref ref-type="table" rid="table-4">Tab. 4</xref> summarizes the variation in the energy consumption and the SLA violations observed against rise in the number of VMs. It is observed that the overall energy consumption is highly affected with a rise in the number of VMs and their migrations.</p>
<table-wrap id="table-4"><label>Table 4</label><caption><title>Analysis of energy consumption and SLA violations</title></caption>
<table>
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Number of VMs</th>
<th align="left" colspan="3">Energy consumption (KWh)</th>
<th align="left" colspan="3">SLA violation</th>
</tr>
<tr>
<th align="left">EA-ABC &#x002B;SVM</th>
<th align="left">Kansal et al. [<xref ref-type="bibr" rid="ref-39">39</xref>]</th>
<th align="left">Naik et al. [<xref ref-type="bibr" rid="ref-40">40</xref>]</th>
<th align="left">EA-ABC &#x002B;SVM</th>
<th align="left">Kansal et al. [<xref ref-type="bibr" rid="ref-39">39</xref>]</th>
<th align="left">Naik et al. [<xref ref-type="bibr" rid="ref-40">40</xref>]</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">10</td>
<td align="left">15</td>
<td align="left">18</td>
<td align="left">17</td>
<td align="left">3</td>
<td align="left">5</td>
<td align="left">7</td>
</tr>
<tr>
<td align="left">20</td>
<td align="left">17</td>
<td align="left">20</td>
<td align="left">30</td>
<td align="left">4</td>
<td align="left">8</td>
<td align="left">9</td>
</tr>
<tr>
<td align="left">40</td>
<td align="left">25</td>
<td align="left">40</td>
<td align="left">55</td>
<td align="left">5</td>
<td align="left">10</td>
<td align="left">12</td>
</tr>
<tr>
<td align="left">60</td>
<td align="left">35</td>
<td align="left">70</td>
<td align="left">70</td>
<td align="left">7</td>
<td align="left">11</td>
<td align="left">14</td>
</tr>
<tr>
<td align="left">80</td>
<td align="left">48</td>
<td align="left">75</td>
<td align="left">74</td>
<td align="left">8</td>
<td align="left">13</td>
<td align="left">16</td>
</tr>
<tr>
<td align="left">100</td>
<td align="left">64</td>
<td align="left">81</td>
<td align="left">80</td>
<td align="left">10</td>
<td align="left">14</td>
<td align="left">18</td>
</tr>
<tr>
<td align="left">120</td>
<td align="left">78</td>
<td align="left">102</td>
<td align="left">97</td>
<td align="left">12</td>
<td align="left">16</td>
<td align="left">21</td>
</tr>
<tr>
<td align="left">140</td>
<td align="left">89</td>
<td align="left">132</td>
<td align="left">112</td>
<td align="left">14</td>
<td align="left">19</td>
<td align="left">23</td>
</tr>
<tr>
<td align="left">160</td>
<td align="left">98</td>
<td align="left">154</td>
<td align="left">148</td>
<td align="left">15</td>
<td align="left">21</td>
<td align="left">26</td>
</tr>
<tr>
<td align="left">180</td>
<td align="left">110</td>
<td align="left">176</td>
<td align="left">167</td>
<td align="left">18</td>
<td align="left">24</td>
<td align="left">29</td>
</tr>
<tr>
<td align="left">200</td>
<td align="left">137</td>
<td align="left">194</td>
<td align="left">185</td>
<td align="left">20</td>
<td align="left">28</td>
<td align="left">32</td>
</tr>
<tr>
<td align="left">220</td>
<td align="left">175</td>
<td align="left">210</td>
<td align="left">204</td>
<td align="left">23</td>
<td align="left">30</td>
<td align="left">36</td>
</tr>
<tr>
<td align="left">240</td>
<td align="left">193</td>
<td align="left">250</td>
<td align="left">240</td>
<td align="left">28</td>
<td align="left">37</td>
<td align="left">42</td>
</tr>
<tr>
<td align="left">260</td>
<td align="left">212</td>
<td align="left">287</td>
<td align="left">276</td>
<td align="left">34</td>
<td align="left">45</td>
<td align="left">51</td>
</tr>
<tr>
<td align="left">280</td>
<td align="left">234</td>
<td align="left">310</td>
<td align="left">291</td>
<td align="left">41</td>
<td align="left">49</td>
<td align="left">57</td>
</tr>
<tr>
<td align="left">300</td>
<td align="left">254</td>
<td align="left">342</td>
<td align="left">310</td>
<td align="left">45</td>
<td align="left">55</td>
<td align="left">64</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Improvement analysis shown in <xref ref-type="fig" rid="fig-8">Figs. 8</xref> and <xref ref-type="fig" rid="fig-9">9</xref> illustrates this research work as a highly optimized VM allocation and migration architecture without compromising the energy resources and exhibits least SLA violations.</p>
<fig id="fig-8"><label>Figure 8</label><caption><title>Percentage improvement in terms of energy consumption</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-8.png"/></fig>
<fig id="fig-9"><label>Figure 9</label><caption><title>Percentage improvement in terms of SLA violations</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_20473-fig-9.png"/></fig>
</sec>
<sec id="s5"><label>5</label><title>Conclusion</title>
<p>This paper presents a novel algorithm in order to minimize the total number of migrations by selecting the VMs to be migrated more accurately using Machine Learning (ML) supported Swarm Intelligence. It further leads to eventually save energy consumption due to over-utilization of PMs. A new algorithmic architecture for the enhancement of Artificial Bee Colony (ABC) is introduced in the paper and is named as Energy Aware-ABC. To further investigate the performance of the VMs, a record of set of parameters is kept in a record set which is further supplied to train SVM for good and bad migrations. This algorithm is investigated with other set of similar structure algorithms and found to be better in comparison to other state of art techniques. The limitation of the work is a resource constraint in the cloud data centre which is to be accessed by the cloud broker.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> This research received no specific grant from any funding agency in the public or commercial sector.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Von Laszewski</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Younge</surname></string-name>, <string-name><given-names>X.</given-names> <surname>He</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Kunze</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Cloud computing: A perspective study</article-title>,&#x201D; <source>New Generation Computing</source><italic>,</italic> vol. <volume>28</volume>, no. <issue>2</issue>, pp. <fpage>137</fpage>&#x2013;<lpage>146</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Tong</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Mao</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Bohn</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Messina</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>NIST cloud computing reference architecture</article-title>,&#x201D; <source>NIST Special Publication</source><italic>,</italic> vol. <volume>500</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>28</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Serrano</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Gallardo</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Hernantes</surname></string-name></person-group>, &#x201C;<article-title>Infrastructure as a service and cloud technologies</article-title>,&#x201D; <source>IEEE Software</source><italic>,</italic> vol. <volume>32</volume>, no. <issue>2</issue>, pp. <fpage>30</fpage>&#x2013;<lpage>36</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. N.</given-names> <surname>Nazarov</surname></string-name>, <string-name><given-names>A. N. A.</given-names> <surname>Koupaei</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Dhoot</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Azlan</surname></string-name> and <string-name><given-names>S. M. R.</given-names> <surname>Siadat</surname></string-name></person-group>, &#x201C;<article-title>Mathematical modelling of infrastructure as a service</article-title>,&#x201D; in <source>2020 Systems of Signals Generating and Processing in the Field of on Board Communications</source><italic>,</italic> vol. <volume>20</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Gai</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Steenkamp</surname></string-name></person-group>, A., &#x201C;<article-title>A feasibility study of platform-as-a-service using cloud computing for a global service organization</article-title>,&#x201D; <source>Journal of Information Systems Applied Research</source><italic>,</italic> vol. <volume>7</volume>, no. <issue>3</issue>, pp. <fpage>28</fpage>&#x2013;<lpage>42</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kolb</surname></string-name></person-group>, <source>&#x201C;On the Portability of Applications in Platform as a Service&#x201D;,</source> University of Bamberg Press. vol. <volume>34</volume>, <conf-loc>Bamberg, Germany</conf-loc>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Tsai</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Bai</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>Software-as-a-service (SaaS): Perspectives and challenges</article-title>,&#x201D; <source>Science China Information Sciences</source><italic>,</italic> vol. <volume>57</volume>, no. <issue>5</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Raghavan</surname></string-name> <string-name><given-names>R.</given-names>, <surname>Jayasimha</surname></string-name> and <string-name><given-names>R. V.</given-names> <surname>Nargundkar</surname></string-name></person-group>, &#x201C;<article-title>Impact of software as a service (SaaS) on software acquisition process</article-title>,&#x201D; <source>Journal of Business &#x0026; Industrial Marketing</source><italic>,</italic> vol. <volume>35</volume>, no. <issue>4</issue>, pp. <fpage>757</fpage>&#x2013;<lpage>770</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Basheer</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Raja</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Jayaraman</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Muhammad</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Qureshi</surname></string-name></person-group>, &#x201C;<article-title>An optimal multitier resource allocation of cloud RAN in 5G using machine learning</article-title>,&#x201D; <source>Transactions on Emerging Telecommunications Technologies</source><italic>,</italic> vol. <volume>30</volume>, no. <issue>8</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>2</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N. E. H.</given-names> <surname>Bouzerzour</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ghazouani</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Slimani</surname></string-name></person-group>, Y., &#x201C;<article-title>A survey on the service interoperability in cloud computing: Client-centric and provider-centric perspectives</article-title>,&#x201D; <source>Software: Practice and Experience</source><italic>,</italic> vol. <volume>50</volume>, no. <issue>7</issue>, pp. <fpage>1025</fpage>&#x2013;<lpage>1060</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Keller</surname></string-name>, <string-name><given-names>L.</given-names> <surname>H&#x00E4;fner</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Sachs</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Fridgen</surname></string-name></person-group>, &#x201C;<article-title>Scheduling flexible demand in cloud computing spot markets</article-title>,&#x201D; <source>Business &#x0026; Information Systems Engineering</source><italic>,</italic> vol. <volume>62</volume>, no. <issue>1</issue>, pp. <fpage>25</fpage>&#x2013;<lpage>39</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Mastroianni</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Meo</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Papuzzo</surname></string-name></person-group>, &#x201C;<article-title>Self-economy in cloud data centers: Statistical assignment and migration of virtual machines</article-title>,&#x201D; in <conf-name>European Conf. on Parallel Processing</conf-name>, <conf-loc>Berlin, Heidelberg</conf-loc>, <publisher-name>Springer</publisher-name>, vol. <volume>1</volume>, pp. <fpage>407</fpage>&#x2013;<lpage>418</lpage>, <comment>August 29</comment>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. K.</given-names> <surname>Bashir</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Ohsita</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Murata</surname></string-name></person-group>, &#x201C;<article-title>Abstraction layer based distributed architecture for virtualized data centers</article-title>,&#x201D;, in <conf-name>6th Int. Conf. on Cloud Computing, GRIDs, and Virtualization</conf-name>, <publisher-name>International Academy, Research, and Industry Association (IARIA)</publisher-name>, pp. <fpage>46</fpage>&#x2013;<lpage>51</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Saxena</surname></string-name> and <string-name><given-names>A. K.</given-names> <surname>Singh</surname></string-name></person-group>, &#x201C;<article-title>A proactive autoscaling and energy-efficient VM allocation framework using online multi-resource neural network for cloud data center</article-title>,&#x201D; <source>Neurocomputing</source><italic>,</italic> vol. <volume>426</volume>, pp. <fpage>3</fpage>&#x2013;<lpage>5</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. S.</given-names> <surname>Rawat</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Dimri</surname></string-name> and <string-name><given-names>G. P.</given-names> <surname>Saroha</surname></string-name></person-group>, &#x201C;<article-title>Power efficient resource provisioning for cloud infrastructure using bio-inspired artificial neural network model</article-title>,&#x201D; <source>Sustainable Computing: Informatics and Systems</source><italic>,</italic> vol. <volume>28</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Haghighi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Maeen</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Haghparast</surname></string-name></person-group>, &#x201C;<article-title>An energy-efficient dynamic resource management approach based on clustering and meta-heuristic algorithms in cloud computing iaaS platforms</article-title>,&#x201D; <source>Wireless Personal Communications</source><italic>,</italic> vol. <volume>104</volume>, no. <issue>4</issue>, pp. <fpage>1367</fpage>&#x2013;<lpage>1391</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N. D.</given-names> <surname>Vahed</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ghobaei-Arani</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Souri</surname></string-name></person-group>, &#x201C;<article-title>Multiobjective virtual machine placement mechanisms using nature-inspired metaheuristic algorithms in cloud environments: A comprehensive review</article-title>,&#x201D; <source>International Journal of Communication Systems</source><italic>,</italic> no.<issue>14</issue>, pp. <fpage>e4068</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Parvizi</surname></string-name> and <string-name><given-names>M. H.</given-names> <surname>Rezvani</surname></string-name></person-group>, &#x201C;<article-title>Utilization-aware energy-efficient virtual machine placement in cloud networks using NSGA-iII meta-heuristic approach</article-title>,&#x201D; <source>Cluster Computing</source><italic>,</italic> vol. <volume>23</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>23</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>U. K.</given-names> <surname>Jena</surname></string-name>, <string-name><given-names>P. K.</given-names> <surname>Das</surname></string-name> and <string-name><given-names>M. R.</given-names> <surname>Kabat</surname></string-name></person-group>, &#x201C;<article-title>Hybridization of meta-heuristic algorithm for load balancing in cloud computing environment</article-title>,&#x201D; <source>Journal of King Saud University-Computer and Information Sciences</source><italic>,</italic> vol. <volume>12</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>11</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I. F.</given-names> <surname>Siddiqui</surname></string-name>, <string-name><given-names>S. U. J.</given-names> <surname>Lee</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Abbas</surname></string-name> and <string-name><given-names>A. K.</given-names> <surname>Bashir</surname></string-name></person-group>, &#x201C;<article-title>Optimizing lifespan and energy consumption by smart meters in green-cloud-based smart grids</article-title>,&#x201D; <source>IEEE Access</source><italic>,</italic> vol. <volume>5</volume>, pp. <fpage>20394</fpage>&#x2013;<lpage>20945</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Arroba</surname></string-name>, <string-name><given-names>J. M.</given-names> <surname>Moya</surname></string-name>, <string-name><given-names>J. L.</given-names> <surname>Ayala</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Buyya</surname></string-name></person-group>, &#x201C;<article-title>Dynamic voltage and frequency scaling-aware dynamic consolidation of virtual machines for energy efficient cloud data centers</article-title>,&#x201D; <source>Concurrency and Computation: Practice and Experience</source><italic>,</italic> vol. <volume>29</volume>, no. <issue>10</issue>, pp. <fpage>e4067</fpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Arshad</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Zahoor</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Wahid</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Yu</surname></string-name></person-group>, &#x201C;<article-title>Green IoT: An investigation on energy saving practices for 2020 and beyond</article-title>,&#x201D; <source>IEEE Access</source><italic>,</italic> vol. <volume>5</volume>, pp. <fpage>15667</fpage>&#x2013;<lpage>15681</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>N. M. F.</given-names> <surname>Qureshi</surname></string-name>, <string-name><given-names>I. F.</given-names> <surname>Siddiqui</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Unar</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Uqaili</surname></string-name>,<string-name> <given-names>C. S.</given-names> <surname>Nam</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>An aggregate map reduce data block placement strategy for wireless IoT edge nodes in smart grid</article-title>,&#x201D; in <source>Wireless Personal Communication</source><italic>,</italic> <publisher-loc>UK</publisher-loc>: <publisher-name>Springer</publisher-name>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Azizi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Zandsalimi</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>An energy-efficient algorithm for virtual machine placement optimization in cloud data centers</article-title>,&#x201D; <source>Cluster Computing</source><italic>,</italic> vol. <volume>10</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Guo</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Chang</surname></string-name></person-group>, &#x201C;<article-title>Energy-efficient and quality-aware VM consolidation method</article-title>,&#x201D; <source>Future Generation Computer Systems</source><italic>,</italic> vol. <volume>102</volume>, pp. <fpage>789</fpage>&#x2013;<lpage>809</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. T.</given-names> <surname>Joseph</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Chandrasekaran</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Cyriac</surname></string-name></person-group>, &#x201C;<article-title>A novel family genetic approach for virtual machine allocation</article-title>,&#x201D; <source>Procedia Computer Science</source><italic>,</italic> vol. <volume>46</volume>, pp. <fpage>558</fpage>&#x2013;<lpage>565</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Shrivastava</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Patel</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Rajak</surname></string-name></person-group>, &#x201C;<article-title>An energy efficient VM allocation using best fit decreasing minimum migration in cloud environment</article-title>,&#x201D; <source>International Journal of Engineering Science</source><italic>,</italic> vol. <volume>4076</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>7</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Ruan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Tian</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Yin</surname></string-name></person-group>, &#x201C;<article-title>Virtual machine allocation and migration based on performance-to-power ratio in energy-efficient clouds</article-title>,&#x201D; <source>Future Generation Computer Systems</source><italic>,</italic> vol. <volume>100</volume>, pp. <fpage>380</fpage>&#x2013;<lpage>394</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. K.</given-names> <surname>Karda</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Kalra</surname></string-name></person-group>, &#x201C;<article-title>Bio-inspired threshold based vm migration for green cloud</article-title>,&#x201D; in <source>Advances in Data and Information Science</source><italic>,</italic> <publisher-loc>Singapore</publisher-loc>, <publisher-name>Springer</publisher-name>, pp. <fpage>15</fpage>&#x2013;<lpage>30</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Tarahomi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Izadi</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Ghobaei-Arani</surname></string-name></person-group>, &#x201C;<article-title>An efficient power-aware VM allocation mechanism in cloud data centers: A micro genetic-based approach</article-title>,&#x201D; <source>Cluster Computing</source><italic>,</italic> vol. <volume>24</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>16</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Barthwal</surname></string-name> and <string-name><given-names>M. M. S.</given-names> <surname>Rauthan</surname></string-name></person-group>, &#x201C;<article-title>Antpu: A meta-heuristic approach for energy-efficient and SLA aware management of virtual machines in cloud computing</article-title>,&#x201D; <source>Memetic Computing</source><italic>,</italic> vol. <volume>13</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>20</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Dabbagh</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Hamdaoui</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Guizani</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Rayes</surname></string-name></person-group>, &#x201C;<article-title>An energy-efficient VM prediction and migration framework for overcommitted clouds</article-title>,&#x201D; <source>IEEE Transactions on Cloud Computing</source><italic>,</italic> vol. <volume>6</volume>, no. <issue>4</issue>, pp. <fpage>955</fpage>&#x2013;<lpage>966</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kamran</surname> and <given-names>B.</given-names></string-name> <string-name><surname>Nazir</surname></string-name></person-group>, &#x201C;<article-title>Qos-aware VM placement and migration for hybrid cloud infrastructure</article-title>,&#x201D; <source>The Journal of Supercomputing</source><italic>,</italic> vol. <volume>74</volume>, no. <issue>9</issue>, pp. <fpage>4623</fpage>&#x2013;<lpage>4646</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N. J.</given-names> <surname>Kansal</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Chana</surname></string-name></person-group>, &#x201C;<article-title>Artificial bee colony based energy-aware resource utilization technique for cloud computing</article-title>,&#x201D; <source>Concurrency and Computation: Practice and Experience</source><italic>,</italic> vol. <volume>27</volume>, no. <issue>5</issue>, pp. <fpage>1207</fpage>&#x2013;<lpage>1225</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Karaboga</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Basturk</surname></string-name></person-group>, &#x201C;<article-title>On the performance of artificial bee colony (ABC) algorithm</article-title>,&#x201D; <source>Applied Soft Computing</source><italic>,</italic> vol. <volume>8</volume>, no. <issue>1</issue>, pp. <fpage>687</fpage>&#x2013;<lpage>697</lpage>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Beloglazov</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Abawajy</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Buyya</surname></string-name></person-group>, &#x201C;<article-title>Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing</article-title>,&#x201D; <source>Future Generation Computer Systems</source><italic>,</italic> vol. <volume>28</volume>, no. <issue>5</issue>, pp. <fpage>755</fpage>&#x2013;<lpage>768</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. K.</given-names> <surname>Bashir</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>P. B. N.</given-names> <surname>Deepa</surname></string-name>, <string-name><surname>Waleed</surname>, <given-names>T.</given-names></string-name> <string-name><surname>Reddy</surname> <given-names>G.</given-names></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Comparative analysis of machine learning algorithms for prediction of smart grid stability</article-title>,&#x201D; <source>International Transactions of Electrical Energy System</source><italic>,</italic> vol. <volume>12706</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Jinyan</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Xili</surname></string-name></person-group>, &#x201C;<article-title>Stock price index prediction based on improved SVM</article-title>&#x201D;, In <source>Advanced Materials Research</source><italic>,</italic> vol. <volume>267</volume>, pp. <fpage>468</fpage>&#x2013;<lpage>471</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N. J.</given-names> <surname>Kansal</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Chana</surname></string-name></person-group>, &#x201C;<article-title>Energy-aware virtual machine migration for cloud computing-a firefly optimization approach</article-title>,&#x201D; <source>Journal of Grid Computing</source><italic>,</italic> vol. <volume>14</volume>, no. <issue>2</issue>, pp. <fpage>327</fpage>&#x2013;<lpage>345</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Balaji Naik</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Singh</surname></string-name> and <string-name><given-names>A. B.</given-names> <surname>Samaddar</surname></string-name></person-group>, &#x201C;<article-title>FHCS: Hybridised optimisation for virtual machine migration and task scheduling in cloud data center</article-title>,&#x201D; <source>IET Communications</source><italic>,</italic> vol. <volume>14</volume>, no. <issue>12</issue>, pp. <fpage>1942</fpage>&#x2013;<lpage>1948</lpage>, <year>2020</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>