IDEAS home Printed from https://ideas.repec.org/a/igg/jwsr00/v14y2017i4p75-89.html
   My bibliography  Save this article

An Energy-Aware and Under-SLA-Constraints VM Consolidation Strategy Based on the Optimal Matching Method

Author

Listed:
  • WeiLing Li

    (School of Software Theory and Technology Chongqing Key Lab, Chongqing University, Chongqing, China)

  • Yongbo Wang

    (School of Software Theory and Technology Chongqing Key Lab, Chongqing University, Chongqing, China)

  • Yuandou Wang

    (School of Software Theory and Technology Chongqing Key Lab, Chongqing University, Chongqing, China)

  • YunNi Xia

    (School of Software Theory and Technology Chongqing Key Lab, Chongqing University, Chongqing, China)

  • Xin Luo

    (Chinese Academy of Sciences, Chongqing Institute of Green and Intelligent Technology, Chongqing, China)

  • Quanwang Wu

    (School of Software Theory and Technology Chongqing Key Lab, Chongqing University, Chongqing, China)

Abstract

Growing demand of computational power brings increasing scale and complexity of cloud datacenters. However, such increase also generates growing energy consumption and related cost incurred for cooling and maintenance. With concerns of cost and energy saving by both industry and academy, the reduction of energy consumption of cloud datacenters becomes a hotspot issue. Recently, virtual-machine-consolidation-based strategies are proposed as promising methods for reduction of cloud energy consumption. Virtual machine (VM) consolidation effectively increases the resource utilization rate. However, it remains a great challenge how to reduce energy consumption while maintaining the quality of service (QoS) at a satisfactory level. In this work, a comprehensive framework is presented for the above-mentioned problem, which aims at maximizing the number of physical machines (PMs) to be turned off within a consolidation period following the constraints of QoS, in terms of Service-Level-Agreement (SLA) violation rate. In comparison with most existing related works which consider invariant utilization rate of PMs in computing energy reduction of candidate migration plans, propose framework considers time-varying utilization rate and employs the number of PMs to be turned off within a consolidation period (NPTCP for simple) as the optimization objective. The proposed framework consists of a resource selection algorithm taking the predicted migration overhead (derived by the Pareto distribution) as inputs and another algorithm generating optimal matching plans based on preference scores of candidate VMs. For the model validation purpose, a case study is conducted on the CloudSim simulation platform and it shows that the proposed method achieves better energy reduction and less SLA violation.

Suggested Citation

  • WeiLing Li & Yongbo Wang & Yuandou Wang & YunNi Xia & Xin Luo & Quanwang Wu, 2017. "An Energy-Aware and Under-SLA-Constraints VM Consolidation Strategy Based on the Optimal Matching Method," International Journal of Web Services Research (IJWSR), IGI Global, vol. 14(4), pages 75-89, October.
  • Handle: RePEc:igg:jwsr00:v:14:y:2017:i:4:p:75-89
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWSR.2017100104
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Gang Tian & Jian Wang & Keqing He & Chengai Sun & Yuan Tian, 2017. "Integrating implicit feedbacks for time-aware web service recommendations," Information Systems Frontiers, Springer, vol. 19(1), pages 75-89, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jing Geng & Shuliang Wang & Wenxia Gan & Hanning Yuan & Zeqiang Chen & Ziqiang Yuan & Tianru Dai, 2019. "Promoting Geospatial Service from Information to Knowledge with Spatiotemporal Semantics," Complexity, Hindawi, vol. 2019, pages 1-14, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jwsr00:v:14:y:2017:i:4:p:75-89. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.