On the Viability of a Cloud Virtual Service Provider

Cloud service providers (CSPs) often face highly dynamic user demands for their resources, which can make it difficult for them to maintain consistent quality-of-service. Some CSPs try to stabilize user demands by offering sustained-use discounts to jobs that consume more instance-hours per month. These discounts present an opportunity for users to pool their usage together into a single ``job.'' In this paper, we examine the viability of a middleman, the cloud virtual service provider (CVSP), that rents cloud resources from a CSP and then resells them to users. We show that the CVSP's business model is only viable if the average job runtimes and thresholds for sustained-use discounts are sufficiently small; otherwise, the CVSP cannot simultaneously maintain low job waiting times while qualifying for a sustained-use discount. We quantify these viability conditions by modeling the CVSP's job scheduling and then use this model to derive users' utility-maximizing demands and the CVSP's profit-maximizing price, as well as the optimal number of instances that the CVSP should rent from the CSP. We verify our results on a one-month trace from Google's production compute cluster, through which we first validate our assumptions on the job arrival and runtime distributions, and then show that the CVSP is viable under these workload traces. Indeed, the CVSP can earn a positive profit without significantly impacting the CSP's revenue, indicating that the CSP and CVSP can coexist in the cloud market.

[1]  Adam Wierman,et al.  Hopper: Decentralized Speculation-aware Cluster Scheduling at Scale , 2015, SIGCOMM.

[2]  Shaolei Ren,et al.  Provably-Efficient Job Scheduling for Energy and Fairness in Geographically Distributed Data Centers , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[3]  Harish Viswanathan,et al.  A practical traffic management system for integrated LTE-WiFi networks , 2014, MobiCom.

[4]  Randy H. Katz,et al.  Heterogeneity and dynamicity of clouds at scale: Google trace analysis , 2012, SoCC '12.

[5]  Yuan Yao,et al.  Data centers power reduction: A two time scale approach for delay tolerant workloads , 2012, 2012 Proceedings IEEE INFOCOM.

[6]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[7]  Nikhil R. Devanur,et al.  A Market for Scheduling, with Applications to Cloud Computing , 2015, ArXiv.

[8]  Amin Vahdat,et al.  Hedera: Dynamic Flow Scheduling for Data Center Networks , 2010, NSDI.

[9]  Kai Song,et al.  Exploring the profit-reliability trade-off in Amazon's spot instance market: A better pricing mechanism , 2013, 2013 IEEE/ACM 21st International Symposium on Quality of Service (IWQoS).

[10]  Sangtae Ha,et al.  A survey of smart data pricing , 2012, ACM Comput. Surv..

[11]  Barbara Panicucci,et al.  A game theoretic formulation of the service provisioning problem in cloud systems , 2011, WWW.

[12]  Colin M. Ramsay,et al.  Exact waiting time and queue size distributions for equilibrium M/G/1 queues with Pareto service , 2007, Queueing Syst. Theory Appl..

[13]  Xi-Ren Cao,et al.  Internet pricing with a game theoretical approach: concepts and examples , 2002, TNET.

[14]  Chita R. Das,et al.  Towards characterizing cloud backend workloads: insights from Google compute clusters , 2010, PERV.

[15]  Chita R. Das,et al.  Modeling and synthesizing task placement constraints in Google compute clusters , 2011, SoCC.

[16]  Rajkumar Buyya,et al.  Fault-tolerant Workflow Scheduling using Spot Instances on Clouds , 2014, ICCS.

[17]  Liang Zheng,et al.  How to Bid the Cloud , 2015, Comput. Commun. Rev..

[18]  Antony I. T. Rowstron,et al.  Better never than late: meeting deadlines in datacenter networks , 2011, SIGCOMM.

[19]  Lisa Zhang,et al.  Scheduling algorithms for optimizing the tradeoffs between delay, queue size and energy , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[20]  Scott Shenker,et al.  Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling , 2010, EuroSys '10.

[21]  Mohamed Faten Zhani,et al.  Dynamic Heterogeneity-Aware Resource Provisioning in the Cloud , 2013, IEEE Transactions on Cloud Computing.

[22]  S. David Wu,et al.  On combinatorial auction and Lagrangean relaxation for distributed resource scheduling , 1999 .

[23]  Albert G. Greenberg,et al.  The nature of data center traffic: measurements & analysis , 2009, IMC '09.

[24]  Albert Y. Zomaya,et al.  Tradeoffs Between Profit and Customer Satisfaction for Service Provisioning in the Cloud , 2011, HPDC '11.

[25]  David Wentzlaff,et al.  The sharing architecture: sub-core configurability for IaaS clouds , 2014, ASPLOS.

[26]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[27]  Margo I. Seltzer,et al.  Virtual worlds: fast and strategyproof auctions for dynamic resource allocation , 2003, EC '03.

[28]  Georgia Sakellari,et al.  A survey of mathematical models, simulation approaches and testbeds used for research in cloud computing , 2013, Simul. Model. Pract. Theory.

[29]  Spyridon Antonakopoulos,et al.  Energy-aware scheduling algorithms for network stability , 2011, 2011 Proceedings IEEE INFOCOM.

[30]  Adam Wierman,et al.  Pricing data center demand response , 2014, SIGMETRICS '14.

[31]  Dan Suciu,et al.  How to Price Shared Optimizations in the Cloud , 2012, Proc. VLDB Endow..

[32]  Muli Ben-Yehuda,et al.  The rise of RaaS: the resource-as-a-service cloud , 2014, CACM.