Combinatorial double auction-based mechanism with group price for cloud service reservation using swarm intelligence

Inspired by the idea of the group-buying, we present a combinatorial double auction-based mechanism with group price for cloud service reservation (CDA-GB), which can allow cloud service providers (CSPs)/cloud service consumers (CSCs) to offer/request different type of services or their bundle, and allow the services requested by a CSC to be offered by more than one CSPs. In CDA-GB, we improve binary particle swarm optimization (BPSO) to solve the winner determination problem and employ K-price scheme to decide the payment of the CSCs and receipts of CSPs in a transaction. Simulation results indicates that the CDA-GB mechanism can help maximize social welfare at the same time improve task completion number and service utilization.

[1]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[2]  Rajkumar Buyya,et al.  Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities , 2008, 2008 10th IEEE International Conference on High Performance Computing and Communications.

[3]  Daniel Grosu,et al.  A Combinatorial Auction-Based Mechanism for Dynamic VM Provisioning and Allocation in Clouds , 2013, IEEE Transactions on Cloud Computing.

[4]  Xiaotie Deng,et al.  When group-buying meets cloud computing , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[5]  Isao Ono,et al.  Applying Double-Sided Combinational Auctions to Resource Allocation in Cloud Computing , 2010, 2010 10th IEEE/IPSJ International Symposium on Applications and the Internet.

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

[7]  Long Chen,et al.  A combinatorial double auction mechanism for cloud resource group-buying , 2014, 2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC).

[8]  Andrew Lewis,et al.  S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization , 2013, Swarm Evol. Comput..

[9]  R. Kauffman.  1 BID TOGETHER , BUY TOGETHER : ON THE EFFICACY OF GROUP-BUYING BUSINESS MODELS IN INTERNET-BASED SELLING , 2001 .

[10]  Guangwen Yang,et al.  A Knowledge-based Continuous Double Auction Model for Cloud Market , 2010, 2010 Sixth International Conference on Semantics, Knowledge and Grids.

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

[12]  Tiranee Achalakul,et al.  Particle Swarm Optimization inspired by starling flock behavior , 2015, Appl. Soft Comput..

[13]  R. Kauffman,et al.  Bid Together, Buy Together: On the Efficacy of Group-Buying Models in Internet-Based Selling. , 2002 .

[14]  Daniel Grosu,et al.  Combinatorial Auction-Based Allocation of Virtual Machine Instances in Clouds , 2010, CloudCom.