{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:14:59Z","timestamp":1771467299416,"version":"3.50.1"},"reference-count":59,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,1,12]],"date-time":"2021-01-12T00:00:00Z","timestamp":1610409600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Computational Intelligence and Soft Computing"],"published-print":{"date-parts":[[2021,1,12]]},"abstract":"<jats:p>Recently, the problem of Virtual Machine Placement (VMP) has received enormous attention from the research community due to its direct effect on the energy efficiency, resource utilization, and performance of the cloud data center. VMP is considered as a multidimensional bin packing problem, which is a type of NP-hard problem. The challenge in VMP is how to optimally place multiple independent virtual machines into a few physical servers to maximize a cloud provider\u2019s revenue while meeting the Service Level Agreements (SLAs). In this paper, an effective multiobjective algorithm based on Particle Swarm Optimization (PSO) technique for the VMP problem, referred to as VMPMOPSO, is proposed. The proposed VMPMOPSO utilizes the crowding entropy method to optimize the VMP and to improve the diversity among the obtained solutions as well as accelerate the convergence speed toward the optimal solution. VMPMOPSO was compared with a simple single-objective algorithm, called First-Fit-Decreasing (FFD), and two multiobjective ant colony and genetic algorithms. Two simulation experiments were conducted to verify the effectiveness and efficiency of the proposed VMPMOPSO. The first experiment shows that the proposed algorithm has better performance than the algorithms we compared it to in terms of power consumption, SLA violation, and resource wastage. The second indicates that the Pareto optimal solutions obtained by applying VMPMOPSO have a good distribution and a better convergence than the comparative algorithms.<\/jats:p>","DOI":"10.1155\/2021\/8892734","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:55:05Z","timestamp":1610589305000},"page":"1-14","source":"Crossref","is-referenced-by-count":10,"title":["Toward Enhancing the Energy Efficiency and Minimizing the SLA Violations in Cloud Data Centers"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0781-2231","authenticated-orcid":true,"given":"E. I.","family":"Elsedimy","sequence":"first","affiliation":[{"name":"Department of System and Information Technology, Faculty of Management Technology and Information System, Port Said University, Port Fuad 42526, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3895-2309","authenticated-orcid":true,"given":"Fahad","family":"Algarni","sequence":"additional","affiliation":[{"name":"Faculty of Computing and Information Technology, University of Bisha, Bisha 61922, Saudi Arabia"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2008.12.001"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2011.10.015"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-014-9307-7"},{"issue":"1","key":"4","article-title":"In the data center, power and cooling costs more than the it equipment it supports","volume":"13","author":"L. Christian","year":"2007","journal-title":"Electronics-Cooling"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/mc.2007.443"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.06.006"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945462"},{"key":"8","first-page":"327","article-title":"Shares and utilities based power consolidation in virtualized server environments","author":"M. Cardosa"},{"key":"9","first-page":"747","article-title":"A survey on power aware virtual machine placement strategies in a cloud data center","author":"R. Ranjana"},{"key":"10","first-page":"27","article-title":"Cloud computing: issues and challenges","author":"T. Dillon"},{"key":"11","first-page":"179","article-title":"A Multi-objective virtual machine placement in virtualized data center environments","author":"J. Xu"},{"key":"12","first-page":"103","article-title":"Optimal virtual machine placement across multiple cloud providers","author":"S. Chaisiri"},{"key":"13","first-page":"91","article-title":"Comparing VM placement algorithms for on-demand clouds","author":"K. Mills"},{"key":"14","first-page":"119","article-title":"Dynamic placement of virtual machines for managing SLA violations","author":"N. Bobroff"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2011.04.013"},{"key":"16","first-page":"329","article-title":"Performance and power management for cloud infrastructures","author":"H. N. Van"},{"key":"17","first-page":"1","article-title":"Grouping genetic algorithm for solving the server consolidation problem with conflicts","author":"S. Agrawal"},{"key":"18","first-page":"26","article-title":"Energy-aware ant colony based workload placement in clouds","author":"E. Feller"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.suscom.2018.05.012"},{"key":"20","first-page":"225","article-title":"A multi-objective approach to virtual machine management in datacenters","author":"J. Xu"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.02.004"},{"key":"22","first-page":"399","article-title":"Improving packing algorithms for server consolidation","author":"Y. Ajiro"},{"key":"23","article-title":"A Dynamic virtual machine placement and migration scheme for data centers","volume":"1","author":"T. H. Duong-Ba","year":"2018","journal-title":"IEEE Transactions on Services Computing"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2010.25"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.3390\/electronics7120389"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2016.2623803"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2905-z"},{"key":"28","article-title":"Virtual machine placement for improved quality in IaaS cloud","author":"K. Babu"},{"key":"29","first-page":"243","article-title":"pMapper: power and migration cost aware application placement in virtualized systems","author":"A. Verma"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2012.240"},{"key":"31","article-title":"A new evolutionary multi-objective algorithm to virtual machine placement","author":"C. Liu"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.02.010"},{"key":"33","doi-asserted-by":"crossref","article-title":"A PSO based VM Resource scheduling model for Cloud computing","author":"D. Kumar","DOI":"10.1109\/CICT.2015.35"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1080\/0952813x.2015.1020519"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxx096"},{"key":"36","article-title":"Google app-engine"},{"key":"37","article-title":"Amazon elastic compute cloud (EC2)"},{"key":"38","doi-asserted-by":"crossref","article-title":"Adaptive threshold-based approach for energy-efficient consolidation of virtual machines in cloud data centers","author":"A. Beloglazov","DOI":"10.1145\/1890799.1890803"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1867"},{"key":"40","first-page":"13","article-title":"Power provisioning for a warehouse-sized computer","author":"X. Fan"},{"key":"41","first-page":"39","article-title":"A new optimizer using particle swarm theory","author":"R. Eberhart"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1016\/s0141-9331(02)00053-4"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.5019\/j.ijcir.2008.123"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.5019\/j.ijcir.2006.68"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2004.826067"},{"key":"48","first-page":"1051","article-title":"MOPSO: a proposal for multiple objective particle swarm optimization","author":"C. A. Coello Coello"},{"key":"49","first-page":"603","article-title":"Particle swarm optimization method in multi-objective problems","author":"K. E. Parsopoulos"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01020-0_39"},{"key":"51","first-page":"66","article-title":"SMPSO: a new PSO-based metaheuristic for multi-objective optimization","author":"A. J. Nebro"},{"issue":"1","key":"52","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1162\/EVCO_a_00104","article-title":"D2MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces","volume":"22","author":"N. AI. Moubayed","year":"2014","journal-title":"Evolutionary Computation"},{"key":"53","first-page":"37","article-title":"A non-dominated sorting particle swarm optimizer for multi-objective optimization","volume-title":"Lecture Notes in Computer Science","author":"X. D. Li","year":"2003"},{"key":"54","first-page":"17","article-title":"Better spread and convergence: particle swarm multi-objective optimization using the maximin fitness function","volume-title":"Lecture Notes in Computer Science","author":"X. D. Li","year":"2004"},{"key":"55","article-title":"SPEA2: improving the strength pareto evolutionary algorithm","volume-title":"Computer Engineering and Networks Laboratory TIK","author":"E. Zitzler","year":"2001"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-008-0394-9"},{"key":"57","doi-asserted-by":"publisher","DOI":"10.1002\/spe.995"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2003.810758"},{"key":"59","unstructured":"SchottJ.Fault tolerant design using single and multicriteria genetic algorithm optimization1995Cambridge, MA, USAMassachusetts Institute of TechnologyMaster\u2019s thesis"}],"container-title":["Applied Computational Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/8892734.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/8892734.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/8892734.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:55:15Z","timestamp":1610589315000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/acisc\/2021\/8892734\/"}},"subtitle":[],"editor":[{"given":"Miin-Shen","family":"Yang","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1,12]]},"references-count":59,"alternative-id":["8892734","8892734"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8892734","relation":{},"ISSN":["1687-9732","1687-9724"],"issn-type":[{"value":"1687-9732","type":"electronic"},{"value":"1687-9724","type":"print"}],"subject":[],"published":{"date-parts":[[2021,1,12]]}}}