eBay in the Clouds: False-Name-Proof Auctions for Cloud Resource Allocation

The paradigm of cloud computing has spontaneously prompted a wide interest in auction-based mechanisms for cloud resource allocation. To eliminate market manipulation, a number of strategy-proof (a.k.a. Truthful) cloud auction mechanisms have been recently proposed by enforcing bidders to bid their true valuations of the cloud resources. However, as discovered in this paper, they would suffer from a new cheating pattern, named false-name bids, where a bidder can gain profit by submitting bids under multiple fictitious names (e.g, Multiple e-mail addresses). Such false-name cheating is easy to make but hard to detect in cloud auctions. To tackle this issue, we propose FAITH, a new False-name-proof Auction for virtual machine instance allocation, that is proven both strategy-proof and false-name proof by our theoretical analysis. When N users compete for M different types of computing instances with multiple units, FAITH achieves a lower time complexity of O(N log N+NM) compared to exiting cloud auction designs. We further extend FAITH to support range-based requests as desired in practice for flexible auction. Through extensive simulation experiments, we show that FAITH highly improves auction efficiency, outperforming the extended mechanisms of conventional false-name-proof auctions in terms of generated revenue and social welfare by up to 220% and 140%, respectively.

[1]  Daniel Grosu,et al.  Combinatorial Auction-Based Allocation of Virtual Machine Instances in Clouds , 2010, 2010 IEEE Second International Conference on Cloud Computing Technology and Science.

[2]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[3]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[4]  David H. Reiley,et al.  Demand Reduction in Multi-Unit Auctions with Varying Numbers of Bidders: Theory and Evidence from a Field Experiment , 2006 .

[5]  Baochun Li,et al.  Towards Optimal Capacity Segmentation with Hybrid Cloud Pricing , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[6]  Athanasios V. Vasilakos,et al.  A Framework for Truthful Online Auctions in Cloud Computing with Heterogeneous User Demands , 2016, IEEE Transactions on Computers.

[7]  Makoto Yokoo,et al.  Characterizing false-name-proof allocation rules in combinatorial auctions , 2009, AAMAS.

[8]  Zongpeng Li,et al.  Dynamic resource provisioning in cloud computing: A randomized auction approach , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[9]  Ilya Segal,et al.  Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .

[10]  Lakshmi Sobhana Kalli,et al.  Market-Oriented Cloud Computing : Vision , Hype , and Reality for Delivering IT Services as Computing , 2013 .

[11]  Hung-Yu Wei,et al.  Dynamic Auction Mechanism for Cloud Resource Allocation , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[12]  Makoto Yokoo,et al.  The effect of false-name bids in combinatorial auctions: new fraud in internet auctions , 2004, Games Econ. Behav..

[13]  Kui Ren,et al.  When cloud meets eBay: Towards effective pricing for cloud computing , 2012, 2012 Proceedings IEEE INFOCOM.

[14]  Noam Nisan,et al.  Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.

[15]  Makoto Yokoo,et al.  Robust double auction protocol against false-name bids , 2005, Decis. Support Syst..

[16]  Shie Mannor,et al.  Resource Allocation with Supply Adjustment in Distributed Computing Systems , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[17]  Raouf Boutaba,et al.  Dynamic Resource Allocation for Spot Markets in Clouds , 2011, Hot-ICE.

[18]  Makoto Yokoo,et al.  The effect of false-name declarations in mechanism design: towards collective decision making on the Internet , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[19]  Makoto Yokoo,et al.  Robust Multi-unit Auction Protocol against False-name Bids , 2001, IJCAI.

[20]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[21]  Baochun Li,et al.  Revenue maximization with dynamic auctions in IaaS cloud markets , 2013, 2013 IEEE/ACM 21st International Symposium on Quality of Service (IWQoS).

[22]  Asuman E. Ozdaglar,et al.  Socially optimal pricing of cloud computing resources , 2011, VALUETOOLS.

[23]  Makoto Yokoo,et al.  Robust double auction protocol against false-name bids , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[24]  John A. List,et al.  Demand Reduction in Multi-unit Auctions with Varying Numbers of Bidders: Theory and Field Experiments , 1999 .

[25]  Zongpeng Li,et al.  Dynamic pricing and profit maximization for the cloud with geo-distributed data centers , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[26]  Makoto Yokoo,et al.  Robust Combinatorial Auction Protocol against False-Name Bids , 2000, AAAI/IAAI.

[27]  Bingsheng He,et al.  Distributed Systems Meet Economics: Pricing in the Cloud , 2010, HotCloud.