SIMPLE HEURISTIC ALGORITHM FOR DYNAMIC VM REALLOCATION IN IAAS CLOUDS
Abstract
The rapid development of cloud technologies and its high prevalence in both commercial and academic areas have stimulated active research in the domain of optimal cloud resource management. One of the most active research directions is dynamic virtual machine (VM) placement optimization in clouds build on Infrastructure-as-a-Service model. This kind of research may pursue different goals with energy-aware optimization being the most common goal as it aims at a urgent problem of green cloud computing - reducing energy consumption by data centers. In this paper we present a new heuristic algorithm of dynamic reallocation of VMs based on an approach presented in one of our previous works. In the algorithm we apply a 2-rank strategy to classify VMs and servers corresponding to the highly and lowly active VMs and solve four tasks: VM classification, host classification, forming a VM migration map and VMs migration. Dividing all of the VMs and servers into two classes we attempt to implement the possibility of risk reduction in case of hardware overloads under overcommitment conditions and to reduce the influence of the occurring overloads on the performance of the cloud VMs. Presented algorithm was developed based on the workload profile of the JINR cloud (a scientific private cloud) with the goal of maximizing its usage, but it can also be applied in both public and private commercial clouds to organize the simultaneous use of different SLA and QoS levels in the same cloud environment by giving each VM rank its own level of overcommitment.
References
[2] Meinhard H. Virtualization, clouds and IaaS at CERN. VTDC '12 Proceedings of the 6th international workshop on Virtualization Technologies in Distributed Computing, ACM New York, NY, USA. 2012. p. 27-28.
[3] Timm S. et al. Cloud Services for the Fermilab Scientific Stakeholders. Journal of Physics: Conference Series. 2015; 664(2). DOI: https://doi.org/10.1007/s41781-017-0001-9
[4] Timm S. et al. Virtual machine provisioning, code management, and data movement design for the Fermilab HEPCloud Facility. Journal of Physics: Conference Series. 2017. Vol. 898, Track 3: Distributed Computing, id. 052041. DOI: https://doi.org/10.1088/1742-6596/898/5/052041
[5] Baranov A.V., Balashov N.A., Kutovskiy N.A., Semenov R.N. JINR cloud infrastructure evolution. Physics of Particles and Nuclei Letters. 2016; 13(5):672–675. DOI: https://doi.org/10.1134/S154747711605006X
[6] Amoroso A. et al., A modular (almost) automatic set-up for elastic multi-tenants cloud (micro)infrastructures. Journal of Physics: Conference Series. 2017; 898(8). DOI: https://doi.org/10.1088/1742-6596/898/8/082031
[7] Mell P., Grance T. The NIST definition of cloud computing. Communications of the ACM. 2010; 53(6):50.
[8] Balashov N., Baranov A., Korenkov V. Optimization of over-provisioned clouds. Physics of Particles and Nuclei Letters. 2016; 13(5):609-612. DOI: https://doi.org/10.1134/S154747711605006X
[9] Balashov N.A. Baranov A.V. Kadochnikov I.S. et al. Smart cloud scheduler. CEUR Workshop Proceedings. 2016; 1787:114-118. Available at: http://ceur-ws.org/Vol-1787/114-118-paper-18.pdf (accessed 16.01.18).
[10] Cohen M.C., Keller P.W., Mirrokni V., Zadimoghaddam M. Overcommitment in Cloud Services – Bin packing with Chance Constraints// Computing Research Repository, 2017. Vol. abs/1705.09335. Available at: https://arxiv.org/abs/1705.09335 (accessed 16.01.18).
[11] Martello S., Toth P. Bin-packing problem // Knapsack Problems: Algorithms and Computer Implementations. Chichester, UK: John Wiley and Sons, 1990.
[12] Ashraf A., Porres I. Multi-objective dynamic virtual machine consolidation in the cloud using ant colony system. International Journal of Parallel, Emergent and Distributed Systems. 2017; 33(1):103-120. DOI: https://doi.org/10.1080/17445760.2017.1278601
[13] Beloglazov A., Buyya R. Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in cloud data centers. Concurrency and Computation: Practice and Experience (CCPE). 2012; 24(13):1397–1420. DOI: https://doi.org/10.1002/cpe.1867
[14] Corradi A., Fanelli M., Foschini L. VM consolidation: A real case based on OpenStack Cloud. Future Generation Computer Systems. 2014; 32:118-127. DOI: https://doi.org/10.1016/j.future.2012.05.012
[15] Zahedi Fard S.Y., Ahmadi M.R., Adabi S.J. A dynamic VM consolidation technique for QoS and energy consumption in cloud environment. The Journal of Supercomputing. 2017; 73(10):4347–4368. DOI: https://doi.org/10.1007/s11227-017-2016-8
[16] Dabbagh M., Hamdaoui B., Guizani M., Rayes A. An Energy-Efficient VM Prediction and Migration Framework for Overcommitted Clouds. IEEE Transactions on Cloud Computing. 2016; 99:1-1. DOI: https://doi.org/10.1109/TCC.2016.2564403
[17] Mosa A., Paton N.W. Optimizing virtual machine placement for energy and SLA in clouds using utility functions. Journal of Cloud Computing: Advances, Systems and Applications. 2016; 5:1-17. DOI: https://doi.org/10.1186/s13677-016-0067-7
[18] Hwang I., Pedram M. Hierarchical, Portfolio Theory-Based Virtual Machine Consolidation in a Compute Cloud. IEEE Transactions on Services Computing. 2018; 11(1):63-77. DOI: https://doi.org/10.1109/TSC.2016.2531672
[19] Mastroianni M. Meo, Papuzzo G. Probabilistic Consolidation of Virtual Machines in Self-Organizing Cloud Data Centers. IEEE Transactions on Cloud Computing. 2013; 1(2):215-228. DOI: https://doi.org/10.1109/TCC.2013.17
[20] Beloglazov A., Buyya R. OpenStack Neat: A Framework for Dynamic and Energy-Efficient Consolidation of Virtual Machines in OpenStack Clouds. Concurrency and Computation: Practice and Experience (CCPE). 2014; 27(5):1310-1333. DOI: https://doi.org/10.1002/cpe.3314
[21] Feller E., Rilling L., Morin C. Snooze: A scalable and autonomic virtual machine management framework for private Clouds. Proceedings of the 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), 2012. p. 482–489. DOI: https://doi.org/10.1109/CCGrid.2012.71
[22] Balashov N.A., Baranov A.V., Kadochnikov I.S., Korenkov V.V., Kutovskiy N.A., Nechaevskiy A.V., Pelevanyuk I.S. Software complex for intelligent scheduling and adaptive self-organization of virtual computing resources based in LIT JINR cloud center. Izvestiya SFedU. Engineering Sciences. 2016; 12(185):92-103. (In Russian) DOI: https://doi.org/10.18522/2311-3103-2016-12-92103
[23] Lee E.K., Viswanathan H., Pompili D. Proactive Thermal-Aware Resource Management in Virtualized HPC Cloud Datacenters. IEEE Transactions on Cloud Computing. 2017; 5(2):234-248. DOI: https://doi.org/10.1109/TCC.2015.2474368
[24] Cloudhary A., Govil M.C., Singh G., Awastkhi L.K., Pilli E.S., Kapil D. A critical survey of live virtual machine migration techniques. Journal of Cloud Computing. 2017; 6:23. DOI: https://doi.org/10.1186/s13677-017-0092-1
[25] Radu L.D. Green Cloud Computing: A Literature Survey. Symmetry. 2017; 9(12):295. DOI: https://doi.org/10.3390/sym9120295
[26] Baginyan A. et al. Multi-level monitoring system for multifunctional information and computing complex at JINR. CEUR Workshop proceedings. 2017; 2023:226-233.
[27] Kadochnikov I.S., Balashov N.A., Baranov A.V., Pelevanyuk I.S., Kutovskiy N.A., Korenkov V.V., Nechaevskiy A.V. Evaluation of monitoring systems for metric collection in intelligent cloud scheduling. CEUR Workshop proceedings. 2016; 1787:279-283.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Publication policy of the journal is based on traditional ethical principles of the Russian scientific periodicals and is built in terms of ethical norms of editors and publishers work stated in Code of Conduct and Best Practice Guidelines for Journal Editors and Code of Conduct for Journal Publishers, developed by the Committee on Publication Ethics (COPE). In the course of publishing editorial board of the journal is led by international rules for copyright protection, statutory regulations of the Russian Federation as well as international standards of publishing.
Authors publishing articles in this journal agree to the following: They retain copyright and grant the journal right of first publication of the work, which is automatically licensed under the Creative Commons Attribution License (CC BY license). Users can use, reuse and build upon the material published in this journal provided that such uses are fully attributed.
