Online cost-aware service requests scheduling in hybrid clouds for cloud bursting

5Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The hybrid cloud computing model has been attracting considerable attention in the past years. Due to security and controllability of private cloud, some special requests ask to be scheduled on private cloud, when requests are “bursting”, the requests may be rejected because of the limited resources of private cloud. In this paper, we propose the online cost-aware service requests scheduling strategy in hybrid clouds (OCS) which could make suitable requests placement decisions real-time and minimize the cost of renting public cloud resources with a low rate of rejected requests. All service requests are divided into two categories, the special requests ask to be accepted on private cloud, and the normal requests are insensitive on private or public cloud. In addition, all requests arrive in random, without any prior knowledge of future arrivals. We transform the online model into a one-shot optimization problem by taking advantage of Lyapunov optimization techniques, then employ the optimal decay algorithm to solve the one-shot problem. The simulation results demonstrate that OCS is trade-off between cost and rejection rate, meanwhile it can let the resource utilization arbitrarily close to the optimum.

Cite

CITATION STYLE

APA

Cao, Y., Lu, L., Yu, J., Qian, S., Zhu, Y., Li, M., … Xue, G. (2017). Online cost-aware service requests scheduling in hybrid clouds for cloud bursting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10569 LNCS, pp. 259–274). Springer Verlag. https://doi.org/10.1007/978-3-319-68783-4_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free