Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds
A major challenging problem for cloud providers is designing efficient mechanisms for virtual machine (VM) provisioning and allocation. Such mechanisms enable the cloud providers to effectively utilize their available resources and obtain higher profits. Recently, cloud providers have introduced auction-based models for VM provisioning and allocation which allow users to submit bids for their requested VMs. Dynamic VM provisioning and allocation problem is studied for the auction-based model as an integer program considering multiple types of resources. Truthful greedy mechanism is designed 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. Proposed mechanisms are truthful, that is, the users do not have incentives to manipulate the system by lying about their requested bundles of VM instances and their valuations.