Relying on the knowledge of the pricing benefit of long-term reserved resource and multiplexing gains, cloud broker strives to minimize its cost by utilizing infrastructure resources from public cloud service provider. Different reserved instance terms accompanied by different prices are provisioned by the provider. How to choose the appropriate ones from various terms to meet the dynamic user demands at the least cost is a great challenge. This paper addresses the challenge by two algorithms. Extensive real world traces driven evaluations show that the heuristic algorithm runs about twice as fast as the approximation one, while both algorithms can save almost the same resource cost up to 27%.
CITATION STYLE
Zhang, J., Chen, S., Huang, H., Wang, X., & Du, D. (2015). Dynamic resource provision for cloud broker with multiple reserved instance terms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9528, pp. 339–356). Springer Verlag. https://doi.org/10.1007/978-3-319-27119-4_24
Mendeley helps you to discover research relevant for your work.