DocumentCode :
650598
Title :
A Family of Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds
Author :
Nejad, Mahyar Movahed ; Mashayekhy, Lena ; Grosu, Daniel
Author_Institution :
Dept. Comput. Sci., Wayne State Univ., Detroit, MI, USA
fYear :
2013
fDate :
June 28 2013-July 3 2013
Firstpage :
188
Lastpage :
195
Abstract :
Designing efficient mechanisms for Virtual Machine (VM) provisioning and allocation is a major challenging problem that needs to be solved by cloud providers. We formulate the VM provisioning and allocation problem in clouds as an integer program and design truthful greedy mechanisms that solve it. We show that the proposed mechanisms are truthful, that is, the users do not have incentives to lie about their requested bundles of VM instances and their valuations. We perform extensive experiments in order to investigate the performance of the proposed mechanisms.
Keywords :
cloud computing; greedy algorithms; integer programming; resource allocation; virtual machines; VM instances; cloud computing; cloud providers; dynamic virtual machine provisioning; integer program; truthful greedy mechanism; virtual machine allocation; Algorithm design and analysis; Approximation algorithms; Approximation methods; Cost accounting; Resource management; Silicon; Vectors; cloud computing; greedy heuristic; resource allocation; truthful mechanism;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cloud Computing (CLOUD), 2013 IEEE Sixth International Conference on
Conference_Location :
Santa Clara, CA
Print_ISBN :
978-0-7695-5028-2
Type :
conf
DOI :
10.1109/CLOUD.2013.14
Filename :
6676694
Link To Document :
بازگشت