Combinatorial auction-based allocation of virtual machine instances in clouds
01 Apr 2013-Journal of Parallel and Distributed Computing (Academic Press Inc.)-Vol. 73, Iss: 4, pp 495-508
TL;DR: This work formulate the problem of virtual machine allocation in clouds as a combinatorial auction problem and proposes two mechanisms to solve it, and performs extensive simulation experiments to reveal that the combinatorially auction-based mechanisms can significantly improve the allocation efficiency while generating higher revenue for the cloud providers.
About: This article is published in Journal of Parallel and Distributed Computing.The article was published on 2013-04-01. It has received 254 citations till now. The article focuses on the topics: Combinatorial auction & Auction algorithm.
Citations
More filters
TL;DR: The results proved that the combinatorial double auction-based resource allocation model is an appropriate market-based model for cloud computing because it allows double-sided competition and bidding on an unrestricted number of items, which causes it to be economically efficient.
261 citations
08 Jul 2014
TL;DR: This work studies resource allocation in a cloud market through the auction of Virtual Machine (VM) instances by introducing combinatorial auctions of heterogeneous VMs, and models dynamic VM provisioning.
Abstract: This work studies resource allocation in a cloud market through the auction of Virtual Machine (VM) instances. It generalizes the existing literature by introducing combinatorial auctions of heterogeneous VMs, and models dynamic VM pro- visioning. Social welfare maximization under dynamic resource provisioning is proven NP-hard, and modeled with a linear inte- ger program. An efficient!-approximation algorithm is designed, with!!2.72in typical scenarios. We then employ this algorithm as a building block for designing a randomized combinatorial auction that is computationally efficient, truthful in expectation, and guarantees the same social welfare approximation factor! .A key technique in the design is to utilize a pair of tailored primal and dual LPs for exploiting the underlying packing structure of the social welfare maximization problem, to decompose its fractional solution into a convex combination of integral solutions. Empirical studies driven by Google Cluster traces verify the efficacy of the randomized auction.
204 citations
Cites background or methods from "Combinatorial auction-based allocat..."
...…it is usually assumed that either a single type of VMs exists in the cloud market, or VMs are substitutes in that a high-end VM is equivalent to a number of low-end VMs, e.g., a Type II (2 × Core, 2 GB RAM, 40 GB Disk) VM equals two Type I (1 × Core, 1 GB RAM, 20 GB Disk) VMs [5], [6]....
[...]
...Zaman et al. [6] propose an auction-based VM allocation mechanism, named CA-GREEDY, for the case of static resource provisioning, where the cloud provider has a predetermined number of VMs for sale in each VM type....
[...]
TL;DR: In this paper, a hierarchical combinatorial auction mechanism is proposed to solve the resource allocation problem in 5G cellular networks, which satisfies the requirements of efficient resource allocation, strict inter-slice isolation and the ability of intra-slice customization.
Abstract: Virtualization has been seen as one of the main evolution trends in the forthcoming fifth generation (5G) cellular networks which enables the decoupling of infrastructure from the services it provides. In this case, the roles of infrastructure providers (InPs) and mobile virtual network operators (MVNOs) can be logically separated and the resources (e.g., subchannels, power, and antennas) of a base station owned by an InP can be transparently shared by multiple MVNOs, while each MVNO virtually owns the entire BS. Naturally, the issue of resource allocation arises. In particular, the InP is required to abstract the physical resources into isolated slices for each MVNO who then allocates the resources within the slice to its subscribed users. In this paper, we aim to address this two-level hierarchical resource allocation problem while satisfying the requirements of efficient resource allocation, strict inter-slice isolation, and the ability of intra-slice customization. To this end, we design a hierarchical combinatorial auction mechanism, based on which a truthful and sub-efficient resource allocation framework is provided. Specifically, winner determination problems (WDPs) are formulated for the InP and MVNOs, and computationally tractable algorithms are proposed to solve these WDPs. Also, pricing schemes are designed to ensure incentive compatibility. The designed mechanism can achieve social efficiency in each level even if each party involved acts selfishly. Numerical results show the effectiveness of the proposed scheme.
172 citations
01 Jul 2013
TL;DR: This work designs an auction-based mechanism for dynamic VM provisioning and allocation that takes into account the user demand, when making provisioning decisions, and proves that the mechanism is truthful.
Abstract: Cloud computing providers provision their resources into different types of virtual machine (VM) instances that are then allocated to the users for specific periods of time. The allocation of VM instances to users is usually determined through fixed-price allocation mechanisms that cannot guarantee an economically efficient allocation and the maximization of cloud provider's revenue. A better alternative would be to use combinatorial auction-based resource allocation mechanisms. This argument is supported by the economic theory; when the auction costs are low, as is the case in the context of cloud computing, auctions are especially efficient over the fixed-price markets because products are matched to customers having the highest valuation. The existing combinatorial auction-based VM allocation mechanisms do not take into account the user's demand when making provisioning decisions, that is, they assume that the VM instances are statically provisioned. We design an auction-based mechanism for dynamic VM provisioning and allocation that takes into account the user demand, when making provisioning decisions. We prove that our mechanism is truthful (i.e., a user maximizes its utility only by bidding its true valuation for the requested bundle of VMs). We evaluate the proposed mechanism by performing extensive simulation experiments using real workload traces. The experiments show that the proposed mechanism yields higher revenue for the cloud provider and improves the utilization of cloud resources.
162 citations
Cites background from "Combinatorial auction-based allocat..."
...Index Terms—Cloud computing, VM allocation, VM provisioning, dynamic resource configuration, combinatorial auctions Ç...
[...]
...In Section 6, we conclude the paper and discuss possible future research directions....
[...]
...Let cR and cI be the costs associated with running, respectively, idling a VM1 instance for one unit of time....
[...]
...This archive contains a rich collection of workloads from various grid and supercomputing sites....
[...]
TL;DR: This work forms the dynamic VM provisioning and allocation problem for the auction-based model as an integer program considering multiple types of resources and designs 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.
Abstract: 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. We formulate the dynamic VM provisioning and allocation problem for the auction-based model as an integer program considering multiple types of resources. We then design 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. We show that the 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. We perform extensive experiments using real workload traces in order to investigate the performance of the proposed mechanisms. Our proposed mechanisms achieve promising results in terms of revenue for the cloud provider.
132 citations
Cites background from "Combinatorial auction-based allocat..."
...VM Type CPU RAM DISK Space Small 1 1 GB 50 GB ISSN: 2394-2231 http://www.ijctjournal.org Page 105...
[...]
References
More filters
Book•
01 Jan 2007TL;DR: A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior in a bid to solve the challenges of 21st Century finance.
Abstract: A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior.
1,994 citations
"Combinatorial auction-based allocat..." refers background in this paper
...A user pays the sum of the fixed-prices of each VM instance in her allocated bundle....
[...]
Book•
09 Dec 2005
TL;DR: It's important for you to start having that hobby that will lead you to join in better concept of life and reading will be a positive activity to do every time.
Abstract: combinatorial auctions What to say and what to do when mostly your friends love reading? Are you the one that don't have such hobby? So, it's important for you to start having that hobby. You know, reading is not the force. We're sure that reading will lead you to join in better concept of life. Reading will be a positive activity to do every time. And do you know our friends become fans of combinatorial auctions as the best book to read? Yeah, it's neither an obligation nor order. It is the referred book that will not make you feel disappointed.
1,139 citations
TL;DR: The state of knowledge about the design of combinatorial auctions is surveyed and some new insights are presented.
Abstract: Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes, network routing, and furniture. Because of complementarities or substitution effects between the different assets, bidders have preferences not just for particular items but for sets of items. For this reason, economic efficiency is enhanced if bidders are allowed to bid on bundles or combinations of different assets. This paper surveys the state of knowledge about the design of combinatorial auctions and presents some new insights. Periodic updates of portions of this survey will be posted to this journal's Online Supplements web page at http://joc.pubs.informs.org/OnlineSupplements.html.
1,096 citations
"Combinatorial auction-based allocat..." refers background in this paper
...There are n users u1, . . . , un, each requesting a set of VM instances and revealing how much she values that particular set....
[...]
TL;DR: In this paper, the problem of determining the revenue maximizing set of nonconflicting bids can be solved for combinational auctions where the value of assets to a bidder depends on which other assets he or she wins.
Abstract: There is interest in designing simultaneous auctions for situations such as the recent FCC radio spectrum auctions, in which the value of assets to a bidder depends on which other assets he or she wins. In such auctions, bidders may wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue maximizing set of nonconflicting bids can be difficult. We analyze this problem, identifying several different structures of permitted combinational bids for which computational tractability is constructively demonstrated and some structures for which computational tractability cannot be guaranteed.
1,089 citations
21 May 2010
TL;DR: The results demonstrate that federated Cloud computing model has immense potential as it offers significant performance gains as regards to response time and cost saving under dynamic workload scenarios.
Abstract: Cloud computing providers have setup several data centers at different geographical locations over the Internet in order to optimally serve needs of their customers around the world However, existing systems do not support mechanisms and policies for dynamically coordinating load distribution among different Cloud-based data centers in order to determine optimal location for hosting application services to achieve reasonable QoS levels Further, the Cloud computing providers are unable to predict geographic distribution of users consuming their services, hence the load coordination must happen automatically, and distribution of services must change in response to changes in the load To counter this problem, we advocate creation of federated Cloud computing environment (InterCloud) that facilitates just-in-time, opportunistic, and scalable provisioning of application services, consistently achieving QoS targets under variable workload, resource and network conditions The overall goal is to create a computing environment that supports dynamic expansion or contraction of capabilities (VMs, services, storage, and database) for handling sudden variations in service demands.
This paper presents vision, challenges, and architectural elements of InterCloud for utility-oriented federation of Cloud computing environments The proposed InterCloud environment supports scaling of applications across multiple vendor clouds We have validated our approach by conducting a set of rigorous performance evaluation study using the CloudSim toolkit The results demonstrate that federated Cloud computing model has immense potential as it offers significant performance gains as regards to response time and cost saving under dynamic workload scenarios.
1,045 citations
"Combinatorial auction-based allocat..." refers background in this paper
...Buyya et al. [11] proposed an infrastructure of federated clouds for auctionbased resource allocation across multiple clouds....
[...]