Paper Info
Title
Truthful Virtual Machine Allocation in Clouds Based on LP-relaxation.
Abstract
An auction mechanism is said to be truthful if every bidder can maximize her profit by declaring the true valuation of requested items. In this paper, we propose a truthful auction-based scheme to allocate virtual machine (VM) instances of various types to the users in clouds so that the total amount of valuations attained by the allocation is maximized. The proposed scheme is an extension of the greedy allocation scheme proposed by Lehmann et al. so that it solves the corresponding winner determination problem by using LP (linear programming) relaxation. The performance of the proposed scheme is evaluated by simulation. The simulation results indicate that it outperforms conventional schemes including fixed-price scheme with respect to the resource utilization, revenue generation, and the allocation efficiency.
Year
DOI
Venue
2015
10.1109/CANDAR.2015.27
CANDAR
Keywords
Field
DocType
Cloud computing, virtual machine, resource allocation, combinatorial auction, truthfulness
Revenue,Mathematical optimization,Virtual machine,Combinatorial auction,Computer science,Resource allocation,Linear programming,Linear programming relaxation,Valuation (finance),Cloud computing
Conference
ISSN
Citations 
PageRank 
2379-1888
0
0.34
References 
Authors
23
2
Name
Order
Citations
PageRank
Kasthuri Srinivasan100.34
Satoshi Fujita24618.99