IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v14y2018i12p1550147718793799.html
   My bibliography  Save this article

An efficient load balancing algorithm for virtual machine allocation based on ant colony optimization

Author

Listed:
  • Peng Xu
  • Guimin He
  • Zhenhao Li
  • Zhongbao Zhang

Abstract

With the rapid development of information technologies and the popularization of Internet applications, more and more companies and developers pay great attention to the cloud computing. As one of the most significant problems in cloud computing, virtual machine allocation has attracted significant attention. However, early studies usually ignore the load balance issue of the resources. In this article, we aim at multidimensional resource load balancing of all the physical machines in the cloud computing platform to maximize the utilization of resources. To achieve this goal, we leverage the ant colony optimization to design an efficient virtual machine allocation algorithm based on the NP-hard feature of this problem. Specifically, we customize the ant colony optimization in the context of virtual machine allocation and introduce an improved physical machine selection strategy to the basic ant colony optimization in order to prevent the premature convergence or falling into the local optima. Through extensive simulations, we demonstrate that our proposed algorithm can effectively achieve load balancing in virtual machine allocation and improve resource utilization for the cloud computing platform.

Suggested Citation

  • Peng Xu & Guimin He & Zhenhao Li & Zhongbao Zhang, 2018. "An efficient load balancing algorithm for virtual machine allocation based on ant colony optimization," International Journal of Distributed Sensor Networks, , vol. 14(12), pages 15501477187, December.
  • Handle: RePEc:sae:intdis:v:14:y:2018:i:12:p:1550147718793799
    DOI: 10.1177/1550147718793799
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147718793799
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147718793799?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:sae:intdis:v:14:y:2018:i:12:p:1550147718793799. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: SAGE Publications (email available below). General contact details of provider: .

    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.