Lakkireddy Arundhathi, Saripalli Krishnaveni, S. Vasavi
{"title":"Multi-Objective Virtual Machine Placement using Order Exchange and Migration Ant Colony System algorithm","authors":"Lakkireddy Arundhathi, Saripalli Krishnaveni, S. Vasavi","doi":"10.1109/ICEARS53579.2022.9752048","DOIUrl":null,"url":null,"abstract":"Cloud computing is one among the most crucial commercial technologies nowadays. It offers a diverse range of services. One of the most exciting and important procedures in cloud computing is virtual machine installation (VMP). Virtual Machine Placement uses evolutionary computing to lower energy consumption while lowering the total number of physical servers that are currently in use. By examining the ant colony system’s (ACS) promising performance for combinatorial issues, Order Exchange and Ant Colony System OEMACS, an approach based on ACS finds solution by combining order exchange and migration local search strategies, was developed (Order exchange and Migration Ant Colony System). From a global optimization standpoint, The OEMACS algorithm is capable of significantly lowering the active servers in number and is used for virtual machine assignment. It also aids in the reduction of the number of active servers that are underutilized. In OEMACS, artificial ants are guided to the best feasible solution using the pheromone deposition method. It also arranges virtual machines in such a way that resource waste and power consumption are reduced. On servers with homogenous and heterogeneous VM sizes, this strategy is used. OEMACS surpasses some of the previously utilized algorithms, such as standard heuristics and other evolutionary-based techniques, according to the findings.","PeriodicalId":252961,"journal":{"name":"2022 International Conference on Electronics and Renewable Systems (ICEARS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Electronics and Renewable Systems (ICEARS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEARS53579.2022.9752048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Cloud computing is one among the most crucial commercial technologies nowadays. It offers a diverse range of services. One of the most exciting and important procedures in cloud computing is virtual machine installation (VMP). Virtual Machine Placement uses evolutionary computing to lower energy consumption while lowering the total number of physical servers that are currently in use. By examining the ant colony system’s (ACS) promising performance for combinatorial issues, Order Exchange and Ant Colony System OEMACS, an approach based on ACS finds solution by combining order exchange and migration local search strategies, was developed (Order exchange and Migration Ant Colony System). From a global optimization standpoint, The OEMACS algorithm is capable of significantly lowering the active servers in number and is used for virtual machine assignment. It also aids in the reduction of the number of active servers that are underutilized. In OEMACS, artificial ants are guided to the best feasible solution using the pheromone deposition method. It also arranges virtual machines in such a way that resource waste and power consumption are reduced. On servers with homogenous and heterogeneous VM sizes, this strategy is used. OEMACS surpasses some of the previously utilized algorithms, such as standard heuristics and other evolutionary-based techniques, according to the findings.
云计算是当今最重要的商业技术之一。它提供各种各样的服务。云计算中最令人兴奋和重要的过程之一是虚拟机安装(VMP)。虚拟机布局使用进化计算来降低能耗,同时降低当前正在使用的物理服务器的总数。通过考察蚁群系统(ACS)在组合问题上的良好表现,提出了一种基于ACS的结合顺序交换和迁移局部搜索策略的求解方法(Order Exchange and migration ant colony system)。从全局优化的角度来看,OEMACS算法能够显著减少活动服务器的数量,并用于虚拟机分配。它还有助于减少未充分利用的活动服务器的数量。在OEMACS中,利用信息素沉积法引导人工蚂蚁找到最佳可行方案。它还以减少资源浪费和功耗的方式安排虚拟机。在具有同构和异构VM大小的服务器上,使用此策略。根据研究结果,OEMACS超越了以前使用的一些算法,如标准启发式和其他基于进化的技术。