Online Cost-Aware Service Requests Scheduling in Hybrid Clouds for Cloud Bursting

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.

[1]  Liang Zheng,et al.  How to Bid the Cloud , 2015, Comput. Commun. Rev..

[2]  Zongpeng Li,et al.  A truthful (1-ε)-optimal mechanism for on-demand cloud resource provisioning , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[3]  Emanuele Danovaro,et al.  Scheduling strategies for enabling meteorological simulation on hybrid clouds , 2015, J. Comput. Appl. Math..

[4]  Kin K. Leung,et al.  Dynamic service migration and workload scheduling in edge-clouds , 2015, Perform. Evaluation.

[5]  Alan Sill Socioeconomics of Cloud Standards , 2015, IEEE Cloud Computing.

[6]  Fang Hao,et al.  Online allocation of virtual machines in a distributed cloud , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[7]  Mung Chiang,et al.  Need for speed: CORA scheduler for optimizing completion-times in the cloud , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[8]  Adam Wierman,et al.  Hopper: Decentralized Speculation-aware Cluster Scheduling at Scale , 2015, SIGCOMM.

[9]  Luke M. Leslie,et al.  Handling Uncertainty: Pareto-Efficient BoT Scheduling on Hybrid Clouds , 2013, 2013 42nd International Conference on Parallel Processing.

[10]  Hai Jin,et al.  When smart grid meets geo-distributed cloud: An auction approach to datacenter demand response , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[11]  George Mavrotas,et al.  A branch and bound algorithm for mixed zero-one multiple objective linear programming , 1998, Eur. J. Oper. Res..

[12]  Bin Luo,et al.  When hybrid cloud meets flash crowd: Towards cost-effective service provisioning , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[13]  Mohsen Guizani,et al.  Efficient datacenter resource utilization through cloud resource overcommitment , 2015, 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[14]  Wang Dong-sheng A New Algorithm for Zero-one Integer Linear Programming , 2012 .

[15]  R. Srikant,et al.  Scheduling Jobs With Unknown Duration in Clouds , 2013, IEEE/ACM Transactions on Networking.