Occupation-Oblivious Pricing of Cloud Jobs via Online Learning

Ahstract-State-of-the-art cloud platforms adopt pay-as-you-go pricing, where users pay for the resources on demand according to occupation time. Simple and intuitive as it is, such a pricing scheme is a mismatch for new workloads today such as large-scale machine learning, whose completion time is hard to estimate beforehand. To supplement existing cloud pricing schemes, we propose an occupation-oblivious online pricing mechanism for cloud jobs without pre-specified time duration and for users who prefer a pre-determined cost for job execution. Our strategy posts unit resource prices upon user arrival and decides a fixed charge for completing the user's job, without the need to know how long the job is to occupy the requested resources. At the core of our design is a novel multi-armed bandit based online learning algorithm for estimating unknown input by exploration and exploitation of past resource sales, and deciding resource prices to maximize profit of the cloud provider in an online setting. Our online learning algorithm achieves a low regret sublinear with the time horizon, in terms of overall provider profit, compared with an omniscient benchmark. We also conduct trace-driven simulations to verify efficacy of the algorithm in real-world settings.

[1]  Marc'Aurelio Ranzato,et al.  Single Server Multi-GPU Training of ConvNets , 2013 .

[2]  Taghi M. Khoshgoftaar,et al.  Deep learning applications and challenges in big data analytics , 2015, Journal of Big Data.

[3]  Eli Upfal,et al.  Multi-Armed Bandits in Metric Spaces ∗ , 2008 .

[4]  Zongpeng Li,et al.  Optimal Posted Prices for Online Cloud Resource Allocation , 2017, Proc. ACM Meas. Anal. Comput. Syst..

[5]  Olga Papaemmanouil,et al.  WiSeDB: A Learning-based Workload Management Advisor for Cloud Databases , 2016, Proc. VLDB Endow..

[6]  Zongpeng Li,et al.  Online Stochastic Buy-Sell Mechanism for VNF Chains in the NFV Market , 2017, IEEE Journal on Selected Areas in Communications.

[7]  Hang Li Learning to Rank , 2017, Encyclopedia of Machine Learning and Data Mining.

[8]  Mingyan Liu,et al.  An Online Approach to Dynamic Channel Access and Transmission Scheduling , 2015, MobiHoc.

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

[10]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[11]  Amit Kumar,et al.  Resource augmentation for weighted flow-time explained by dual fitting , 2012, SODA.

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

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

[14]  Andrew Trotman,et al.  Learning to Rank , 2005, Information Retrieval.

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

[16]  Gafar Matanmi Oyeyemi,et al.  Comparison of Outlier Detection Procedures in Multiple Linear Regressions , 2015 .

[17]  Yuan Yu,et al.  TensorFlow: A system for large-scale machine learning , 2016, OSDI.