To Reserve or Not to Reserve: Optimal Online Multi-Instance Acquisition in IaaS Clouds
Wei Wang, Baochun Li, Ben Liang

TL;DR
This paper introduces two online algorithms for dynamically combining on-demand and reserved instances in IaaS clouds, achieving near-optimal cost savings without requiring future demand knowledge.
Contribution
It proposes the first practical online algorithms with proven optimal competitive ratios for multi-instance reservation in IaaS clouds, without needing demand distribution assumptions.
Findings
Algorithms achieve the best possible competitive ratios.
Significant cost savings demonstrated through simulations.
Algorithms extend to cases with reliable short-term predictions.
Abstract
Infrastructure-as-a-Service (IaaS) clouds offer diverse instance purchasing options. A user can either run instances on demand and pay only for what it uses, or it can prepay to reserve instances for a long period, during which a usage discount is entitled. An important problem facing a user is how these two instance options can be dynamically combined to serve time-varying demands at minimum cost. Existing strategies in the literature, however, require either exact knowledge or the distribution of demands in the long-term future, which significantly limits their use in practice. Unlike existing works, we propose two practical online algorithms, one deterministic and another randomized, that dynamically combine the two instance options online without any knowledge of the future. We show that the proposed deterministic (resp., randomized) algorithm incurs no more than 2-alpha (resp.,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Auction Theory and Applications · Mobile Crowdsensing and Crowdsourcing
