Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Norwegian Open Resea...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
versions View all 1 versions
addClaim

Time dependent virtual machine consolidation with SLA(Service Level Agreement) consideration

Authors: Alla, Yadassa Hordoffa;

Time dependent virtual machine consolidation with SLA(Service Level Agreement) consideration

Abstract

Cloud data center is becoming the most essential infrastructure for computing services. In effect, the operational cost of a data center is also increasing drastically. To decrease this cost, consolidation of VMs with less degradation of performance is so important. To guarantee the expected Quality of Service (QOS) the important factors to be controlled are performance of the service including timely leverage and overall resource utilization of the data center. In this paper, we tried to investigate how to efficiently utilize resources with reduced SLA violation in a data center. In order to optimize efficiency, VMs ought to be consolidated as tight as possible. To achieve this, an algorithm based on first fit decreasing (FFD) bin packing is designed and implemented. Hence, the algorithm is implemented on the following three approaches to pursue the goal: a)Deterministic Approach, which is mainly based on mean of the individual VMs;b)Stochastic Approach I, which is basically done by treating individual VMs based on their mean and variances and ;c) Stochastic Approach II, which depends on mean and covariance of individual VMs. The results obtained show that consolidating VMs based on mean and variance(stochastic approach I) performed better than the other two approaches for minimizing total percentage of SLA violation and stochastic approach II performed better than the two approaches for minimizing the number of PMs in consolidation.

Country
Norway
Related Organizations
Keywords

Virtual, data, Virtualization, center, Computing, packing, Bin, SLA, Cloud, machine, Consolidation, 004

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green