Non-Payment Incentive Mechanism Design for Resource Allocation in a Private Cloud System

Truthful resource request from users is the premise to achieve the maximum social welfare in an enterprise private cloud. To stimulate the truthfulness of users, most previous works mainly rely on introducing the payment, which however, might not be applicable in enterprise private clouds, where there is a lack of money transfer. To address this issue, this paper proposes non-payment but efficient mechanisms in private clouds to stimulate the truthfulness of the users and meanwhile maximize the social welfare. Moreover, different from previous works that allow only one job request from one user, this paper studies a more general model, where multiple jobs can be submitted by each user. Specifically, we consider two task models: the migration-admissible model and non-migration model. In the former model, jobs can be executed at different servers, and may undergo migration if necessary. Alternatively, in the latter model, jobs can only be executed at one server without migration. For both models, we design incentive resource allocation mechanisms to maximize the social welfare. Theoretically analysis shows that the proposed mechanisms are truthful for general monotonic profit functions and the worst-case performance on the social welfare are well-bounded within a constant factor of the optimal solution for linear profit functions. Simulation results also demonstrate that the performances of the proposed mechanisms are very close to the optimal solution, in terms of maximizing the social welfare.

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

[2]  Shaddin Dughmi,et al.  Truthful assignment without money , 2010, EC '10.

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

[4]  Alex Delis,et al.  Flexible use of cloud resources through profit maximization and price discrimination , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[5]  Zongpeng Li,et al.  Core-Selecting Auctions for Dynamically Allocating Heterogeneous VMs in Cloud Computing , 2014, 2014 IEEE 7th International Conference on Cloud Computing.

[6]  Xiaoming Chen,et al.  Towards truthful auction mechanisms for task assignment in mobile device clouds , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[7]  Besmir Sejdiu,et al.  Pricing Schemes in Cloud Computing: An Overview , 2016 .

[8]  Ian A. Kash,et al.  Fixed and market pricing for cloud services , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

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

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

[11]  Joseph Naor,et al.  A Truthful Mechanism for Value-Based Scheduling in Cloud Computing , 2011, SAGT.

[12]  Qiang Zhang,et al.  Minimizing the total weighted completion time of fully parallel jobs with integer parallel units , 2013, Theor. Comput. Sci..

[13]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[14]  K SathyaMoorthy. A Distributed Truthful Auction Mechanism for Task Allocation in Mobile Cloud Computing , 2019 .

[15]  Shrisha Rao,et al.  A Combinatorial Auction mechanism for multiple resource procurement in cloud computing , 2012, 2012 12th International Conference on Intelligent Systems Design and Applications (ISDA).

[16]  Zongpeng Li,et al.  An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing , 2016, IEEE/ACM Transactions on Networking.

[17]  Minming Li,et al.  Incentive Mechanism Design to Meet Task Criteria in Crowdsourcing: How to Determine Your Budget , 2017, IEEE Journal on Selected Areas in Communications.

[18]  Joseph Naor,et al.  Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters , 2012, SPAA '12.

[19]  Evgenia Smirni,et al.  Virtualization in the Private Cloud: State of the Practice , 2016, IEEE Transactions on Network and Service Management.

[20]  Imtiaz Ahmad,et al.  Cloud Computing Pricing Models: A Survey , 2013 .

[21]  Hai Jin,et al.  A cooperative game based allocation for sharing data center networks , 2013, 2013 Proceedings IEEE INFOCOM.

[22]  Pan Hui,et al.  Economic models for cloud service markets , 2012, ICDCN 2012.

[23]  Éva Tardos,et al.  Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.