IEEE/ACM Transactions on Networking · 2016 · 88 citations · 28 references
ComputingCloud ComputingEconomicsAuction TheoryCloud EconomicsVirtualizationCloud Capacity PlanningCloud Resource ManagementCompute Resource ManagementResource ProvisioningResource SchedulingWorkload SchedulingCloud Resource AllocationCloud Resource ProvisioningCloud SchedulingOnline Auction DesignOnline AuctionsOnline OptimizationProfit Maximization In AuctionsVirtual Machine Provisioning
Auction design has recently been studied for dynamic resource bundling and virtual machine (VM) provisioning in IaaS clouds, but is mostly restricted to one-shot or offline setting. This paper targets a more realistic case of online VM auction design, where: 1) cloud users bid for resources into the future to assemble customized VMs with desired occupation durations, possibly located in different data centers; 2) the cloud provider dynamically packs multiple types of resources on heterogeneous physical machines (servers) into the requested VMs; 3) the operational costs of servers are considered in resource allocation; and 4) both social welfare and the cloud provider's net profit are to be maximized over the system running span. We design truthful, polynomial time auctions to achieve social welfare maximization and/or the provider's profit maximization with good competitive ratios. Our mechanisms consist of two main modules: 1) an online primal-dual optimization framework for VM allocation to maximize the social welfare with server costs, and for revealing the payments through the dual variables to guarantee truthfulness and 2) a randomized reduction algorithm to convert the social welfare maximizing auctions to ones that provide a maximal expected profit for the provider, with competitive ratios comparable to those for social welfare. We adopt a new application of Fenchel duality in our primal-dual framework, which provides richer structures for convex programs than the commonly used Lagrangian duality, and our optimization framework is general and expressive enough to handle various convex server cost functions. The efficacy of the online auctions is validated through careful theoretical analysis and trace-driven simulation studies.
28
Xen and the art of virtualization
Paul Barham, Boris Dragovic, Keir Fraser et al. · ACM SIGOPS Operating Systems Review · 2003 · 5.9K citations
Xen and the art of virtualization
Paul Barham, Boris Dragovic, Keir Fraser et al. · 2003 · 1.6K citations
Heterogeneity and dynamicity of clouds at scale
Charles Reiss, Alexey Tumanov, Gregory R. Ganger et al. · 2012 · 1K citations
Virtual machine power metering and provisioning
Aman Kansal, Feng Zhao, Jie Liu et al. · 2010 · 557 citations