Authors: S. Kumaraswamy; Mydhili K. Nair
Addresses: Department of Computer Science and Engineering, Global Academy of Technology, Bengaluru 560098, Karnataka, India ' Department of Information Science and Engineering, Ramaiah Institute of Technology, Bengaluru 560054, Karnataka, India
Abstract: Virtual machine is a logical framework to provide services on the cloud. These virtual machines form a logical partition of the physical infrastructure present in the cloud centre. Virtual machines are not only prone to cost escalation but they also result in huge power consumption. Hence, the cloud centre needs to optimise cost and power consumption by placing these virtual machines from their current physical machines to other suitable physical machines. Currently, this problem has been addressed by considering the virtual machines present in a single location cloud centre. But, currently cloud centres have multiple locations and all of them are synchronised to provide cloud services. In this complex paradigm, it is important to differentiate the same and different location virtual machines and provide suitable placement algorithms. In this work, the problem of virtual machine placement is modelled through the three slot bin packing problem. It is shown as NP-complete and suitable approximation algorithms are proposed. Also, polynomial time approximation scheme is designed for this problem which provides a facility to control the quality of approximation. Empirical studies performed through simulation confirm the theoretical bounds that were obtained.
Keywords: cloud computing; virtual machine; virtual machine placement; distributed cloud; bin packing.
International Journal of Grid and Utility Computing, 2018 Vol.9 No.4, pp.396 - 403
Available online: 17 Sep 2018 *Full-text access for editors Access for subscribers Purchase this article Comment on this article