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.
This is a preview of subscription content, log in via an institution to check access.
References
Hoseinyfarahabady, M.R., Samani, H.R., Leslie, L.M., Lee, Y.C., Zomaya, A.Y.: Handling uncertainty: pareto-efficient BoT scheduling on hybrid clouds. In: 2013 42nd International Conference on Parallel Processing, pp. 419–428. IEEE (2013)
Sill, A.: Socioeconomics of cloud standards. IEEE Cloud Comput. 2(3), 8–11 (2015)
Quarati, A., Danovaro, E., Galizia, A., Clematis, A., D’Agostino, D., Parodi, A.: Scheduling strategies for enabling meteorological simulation on hybrid clouds. J. Comput. Appl. Math. 273, 438–451 (2015)
Hao, F., Kodialam, M., Lakshman, T., Mukherjee, S.: Online allocation of virtual machines in a distributed cloud. In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, pp. 10–18. IEEE (2014)
Maguluri, S.T., Srikant, R.: Scheduling jobs with unknown duration in clouds. In: INFOCOM, 2013 Proceedings IEEE, pp. 1887–1895 (2014)
Niu, Y., Luo, B., Liu, F., Liu, J., Li, B.: When hybrid cloud meets flash crowd: towards cost-effective service provisioning. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 1044–1052. IEEE (2015)
Neely, M.J.: Stochastic network optimization with application to communication and queueing systems. Synth. Lect. Commun. Netw. 3(1), 1–211 (2010)
Mavrotas, G., Diakoulaki, D.: A branch and bound algorithm for mixed zero-one multiple objective linear programming. Eur. J. Oper. Res. 107(3), 530–541 (1998)
Zhao, N., Wei-Jian, M.I., Wang, D.S.: A new algorithm for zero-one integer linear programming. Oper. Res. Manag. Sci. 21(5), 111–118 (2012)
Zheng, L., Joe-Wong, C., Tan, C.W., Chiang, M., Wang, X.: How to bid the cloud. ACM SIGCOMM Comput. Commun. Rev. 45(4), 71–84 (2015)
Dabbagh, M., Hamdaoui, B., Guizani, M., Rayes, A.: Efficient datacenter resource utilization through cloud resource overcommitment. In: 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 330–335. IEEE (2015)
Huang, Z., Balasubramanian, B., Wang, M., Lan, T., Chiang, M., Tsang, D.H.: Need for speed: cora scheduler for optimizing completion-times in the cloud. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 891–899. IEEE (2015)
Ren, X., Ananthanarayanan, G., Wierman, A., Yu, M.: Hopper: decentralized speculation-aware cluster scheduling at scale. In: ACM Conference on Special Interest Group on Data Communication, pp. 379–392 (2015)
Urgaonkar, R., Wang, S., He, T., Zafer, M., Chan, K., Leung, K.K.: Dynamic service migration and workload scheduling in edge-clouds. Perform. Eval. 91, 205–228 (2015)
Zhou, Z., Liu, F., Li, Z., Jin, H.: When smart grid meets geo-distributed cloud: an auction approach to datacenter demand response. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 2650–2658. IEEE (2015)
Zhang, X., Wu, C., Li, Z., Lau, F.C.M.: A truthful (1-\(\varepsilon \))-optimal mechanism for on-demand cloud resource provisioning. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 1053–1061. IEEE (2015)
Acknowledgments
This work has been funded by High-Tech Research and Development Program of China under grant No. 2015AA01A202 and partly supported by NSFC (Nos. 61170238, 61420106010).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Cao, Y. et al. (2017). Online Cost-Aware Service Requests Scheduling in Hybrid Clouds for Cloud Bursting. In: Bouguettaya, A., et al. Web Information Systems Engineering – WISE 2017. WISE 2017. Lecture Notes in Computer Science(), vol 10569. Springer, Cham. https://doi.org/10.1007/978-3-319-68783-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-68783-4_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68782-7
Online ISBN: 978-3-319-68783-4
eBook Packages: Computer ScienceComputer Science (R0)