Subscription or Pay-as-You-Go: Optimally Purchasing IaaS Instances in Public Clouds

In public clouds such as Amazon EC2, there are two main pricing models in purchasing Infrastructure-as-a-Service (IaaS) instances: the pay-as-you-go model and the subscription model. For these two options, users can dynamically combine them to provide services for demands to save their instance acquisition costs. Making optimal decisions toward the purchase of IaaS instances generally requires prior knowledge of future demands; however, it is difficult for users to predict all future workloads accurately. To deal with this problem, online reservation algorithms have been proposed to guide users in reserving instances. However, existing online algorithms do not conform to the pricing rules currently used in public cloud platforms. Therefore, we put forward a new online reserving algorithm for instance in accordance with the pricing policies used in most public IaaS offerings. Specifically, in this study, we use Amazon EC2 as an example to illustrate our algorithm. Through theoretical analysis, we prove that the cost of the proposed algorithm A_β in this paper is not greater than 2-1/β times of the optimal offline algorithm, where β>1 is a critical point in the online reservation algorithm proposed in this paper. Via extensive experimental simulations using both synthetic and actual workload datasets, we demonstrated that the online algorithm A_β is much more cost effective for cloud users than always paying-as-you-go in public IaaS markets.

[1]  Tao Qin,et al.  Randomized Mechanisms for Selling Reserved Instances in Cloud Computing , 2017, AAAI.

[2]  Murali S. Kodialam,et al.  The constrained Ski-Rental problem and its application to online cloud cost optimization , 2013, 2013 Proceedings IEEE INFOCOM.

[3]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[4]  Mithuna Thottethodi,et al.  Dynamic server provisioning to minimize cost in an IaaS cloud , 2011, SIGMETRICS.

[5]  Jerome A. Rolia,et al.  Capacity Management and Demand Prediction for Next Generation Data Centers , 2007, IEEE International Conference on Web Services (ICWS 2007).

[6]  Yossi Azar,et al.  Prompt Mechanism for Ad Placement over Time , 2011, SAGT.

[7]  Shijun Liu,et al.  To Sell or Not To Sell: Trading Your Reserved Instances in Amazon EC2 Marketplace , 2018, 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS).

[8]  Baochun Li,et al.  Dynamic Cloud Instance Acquisition via IaaS Cloud Brokerage , 2015, IEEE Transactions on Parallel and Distributed Systems.

[9]  Tao Qin,et al.  Selling Reserved Instances in Cloud Computing , 2015, IJCAI.

[10]  Rajkumar Buyya,et al.  SLA-based virtual machine management for heterogeneous workloads in a cloud datacenter , 2014, J. Netw. Comput. Appl..

[11]  Wei Wang,et al.  To Reserve or Not to Reserve: Optimal Online Multi-Instance Acquisition in IaaS Clouds , 2013, ICAC.

[12]  Edith Cohen,et al.  Competitive Analysis of the LRFU Paging Algorithm , 2001, WADS.

[13]  Shijun Liu,et al.  Selling Reserved Instances through Pay-as-You-Go Model in Cloud Computing , 2017, 2017 IEEE International Conference on Web Services (ICWS).

[14]  Tao Qin,et al.  New Mechanism for Reservation in Cloud Computing , 2015, AAMAS.

[15]  Minghua Chen,et al.  Online algorithms for uploading deferrable big data to the cloud , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[16]  Prashant J. Shenoy,et al.  Dynamic Provisioning of Multi-tier Internet Applications , 2005, Second International Conference on Autonomic Computing (ICAC'05).

[17]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.