Optimal Posted Prices for Online Cloud Resource Allocation

We study online resource allocation in a cloud computing platform through posted pricing: The cloud provider publishes a unit price for each resource type, which may vary over time; upon arrival at the cloud system, a cloud user either takes the current prices, renting resources to execute its job, or refuses the prices without running its job there. We design pricing functions based on current resource utilization ratios, in a wide array of demand-supply relationships and resource occupation durations, and prove worst-case competitive ratios in social welfare. In the basic case of a single-type, non-recycled resource (allocated resources are not later released for reuse), we prove that our pricing function design is optimal, in that it achieves the smallest competitive ratio among all possible pricing functions. Insights obtained from the basic case are then used to generalize the pricing functions to more realistic cloud systems with multiple types of resources, where a job occupies allocated resources for a number of time slots till completion, upon which time the resources are returned to the cloud resource pool.

[1]  Sunilkumar S. Manvi,et al.  Resource management for Infrastructure as a Service (IaaS) in cloud computing: A survey , 2014, J. Netw. Comput. Appl..

[2]  Vishal Misra,et al.  On Resource Management for Cloud Users: A Generalized Kelly Mechanism Approach , 2010 .

[3]  Zongpeng Li,et al.  An Efficient Cloud Market Mechanism for Computing Jobs With Soft Deadlines , 2017, IEEE/ACM Transactions on Networking.

[4]  Zongpeng Li,et al.  Online Auctions in IaaS Clouds: Welfare and Profit Maximization With Server Costs , 2015, IEEE/ACM Transactions on Networking.

[5]  Quanyan Zhu,et al.  Dynamic Service Placement in Geographically Distributed Clouds , 2012, IEEE Journal on Selected Areas in Communications.

[6]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

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

[8]  Rajkumar Buyya,et al.  A framework for ranking of cloud computing services , 2013, Future Gener. Comput. Syst..

[9]  Daniel Grosu,et al.  Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds , 2015, IEEE Transactions on Parallel and Distributed Systems.

[10]  Joseph Naor,et al.  Improved bounds for online routing and packing via a primal-dual approach , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[11]  Zongpeng Li,et al.  An online mechanism for dynamic virtual cluster provisioning in geo-distributed clouds , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[12]  Zongpeng Li,et al.  An online auction framework for dynamic resource provisioning in cloud computing , 2014, SIGMETRICS '14.

[13]  Rajkumar Buyya,et al.  Article in Press Future Generation Computer Systems ( ) – Future Generation Computer Systems Cloud Computing and Emerging It Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility , 2022 .

[14]  Muli Ben-Yehuda,et al.  Deconstructing Amazon EC2 Spot Instance Pricing , 2011, 2011 IEEE Third International Conference on Cloud Computing Technology and Science.

[15]  Yong Meng Teo,et al.  Dynamic Resource Pricing on Federated Clouds , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

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

[17]  Zongpeng Li,et al.  An efficient auction mechanism for service chains in the NFV market , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[18]  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.

[19]  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.

[20]  Bo An,et al.  Automated negotiation with decommitment for dynamic resource allocation in cloud computing , 2010, AAMAS.

[21]  Rajkumar Buyya,et al.  Interconnected Cloud Computing Environments , 2014, ACM Comput. Surv..

[22]  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).

[23]  Zongpeng Li,et al.  RSMOA: A revenue and social welfare maximizing online auction for dynamic cloud resource provisioning , 2014, 2014 IEEE 22nd International Symposium of Quality of Service (IWQoS).

[24]  Baochun Li,et al.  Dynamic Cloud Pricing for Revenue Maximization , 2013, IEEE Transactions on Cloud Computing.

[25]  Jianhui Liu,et al.  A Pricing Algorithm for Cloud Computing Resources , 2011, 2011 International Conference on Network Computing and Information Security.

[26]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Covering and Packing Problems , 2005, ESA.

[27]  Yang Cai,et al.  Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations , 2013, SODA.

[28]  Deeparnab Chakrabarty,et al.  Budget constrained bidding in keyword auctions and online knapsack problems , 2008, WINE.