simulated annealing based vm placement strategy to maximize the profit for cloud service providers
Clicks: 272
ID: 240775
2017
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
272 views
50 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #230 of 430 articles by views in International journal of molecular sciences
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 430 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Virtual machine (VM) placement strategies reported in the literature focuses mainly on minimization of power consumption and maximization of placed VMs. The revenue earned by a cloud service provider (CSP) depends on the number of VMs placed. Increasing the number of VMs placed by a CSP not only increases the power consumption but also decreases the profit margin of the CSP. In this paper, we propose a technique called maximum VM placement with minimum power consumption (MVMP) to maximize the profit earned by a CSP. The proposed technique attempts to maximize the revenue and minimize the power budget. It is formulated as a bi-objective optimization problem, and is solved using simulated annealing (SA) technique. To reach a sub-optimal solution more randomness is applied to SA. Our MVMP algorithm is compared to five state of the art algorithms in the realm of strategic VM placement, namely Marotta and Avallone (MA) approach, Hybrid genetic algorithm (HGA), Modified Best-Fit decreasing (MBFD), First-Fit decreasing (FFD) and Random deployment. We observe that MVMP performs better than Marotta and Avallone (MA) approach, HGA, MBFD, FFD and Random placement in terms of number of servers used, energy consumption, profit and execution time. Scalability of MVMP is verified using two different scenarios: (i) fixed number of VMs and, (ii) fixed number of servers. It is observed that MVMP is scalable too.
| Reference Key |
addya2017engineeringsimulated
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Sourav Kanti Addya;Ashok Kumar Turuk;Bibhudatta Sahoo;Mahasweta Sarkar;Sanjay Kumar Biswash |
| Journal | International journal of molecular sciences |
| Year | 2017 |
| DOI |
10.1016/j.jestch.2017.09.003
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.