Modified Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds

In Cloud Computing models, Virtual Machines (VM) can be dynamically provisioned according to demand and released when not needed. Efficient Virtual Machine (VM) provisioning and allocation allows the cloud providers to effectively utilize their available resources and obtain higher profits. The existing static VM provisioning may not guarantee economically efficient allocation and thus cannot guarantee maximum revenue for cloud providers. A better solution would be to take into account the users' demand and dynamically provision VM instances. In the recent times, the cloud providers have introduced auction-based models for VM provisioning and allocation which allow users to submit bids for their requested VMs. MM Nejad, L. Mashayekhy and D Grosu have formulated a dynamic VM provisioning and allocation problem for the auction-based model as an integer program considering multiple types of resources. They have designed truthful greedy and optimal mechanisms for the problem such that the cloud provider provisions VMs based on the requests of the winning users and determines their payments. Since Virtual Machines are created by Hypervisors in the underlying physical machines and this would result in overhead and ultimately would impact the overall performance of the cloud. We propose that this overhead could be factored inthe design of Truthful Greedy mechanisms. It is hoped that our proposed idea can achieve better results in terms of revenue for the cloud provider.