4.7 Article

Cost-driven scheduling of service processes in hybrid cloud with VM deployment and interval-based charging

Publisher

ELSEVIER
DOI: 10.1016/j.future.2020.01.035

Keywords

Service processes scheduling; Hybrid cloud; Interval-based charging; VM deployment; Fireworks Algorithm

Funding

  1. National Natural Science Foundation of China [61902269, 61473035, 51774209, 61672364]
  2. National Key R&D Program of China [2018YFA0701700]
  3. Priority Academic Program Development of Jiangsu Higher Education Institutions, China

Ask authors/readers for more resources

Cost-driven scheduling of service processes mainly focuses on task allocation to achieve the cost minimization from a users perspective. As an important challenge, cost-driven scheduling of service processes in hybrid cloud has been widely studied. However, existing researches seldom precisely formulate the virtual machine resources and their capacity constraints in hybrid cloud, which may reduce the elasticity or lead to unfeasible solutions. Besides, they do not comprehensively consider the interval-based charging, which cannot precisely calculate and reduce the cost. In this paper, we propose a more practical model for service processes scheduling in hybrid cloud, in which resource constraints are defined more precisely without reducing the elasticity by virtual machine deployment, and a comprehensive interval-based charging including billing cycle and sustained-use discount is considered. This problem is solved by an improved fireworks algorithm based approach, in which specific representation, decoding and fireworks updating strategies are proposed for the mechanisms of virtual machine deployment and interval-based charging. Experiments are conducted using service processes with different problem sizes, and results show that our approach can find scheduling solutions with lower costs than existing algorithms. (C) 2020 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available