IDEAS home Printed from https://ideas.repec.org/a/igg/jcac00/v11y2021i4p59-79.html
   My bibliography  Save this article

A Bio-Inspired and Heuristic-Based Hybrid Algorithm for Effective Performance With Load Balancing in Cloud Environment

Author

Listed:
  • Soumen Swarnakar

    (Netaji Subhash Engineering College, India)

  • Souvik Bhattacharya

    (Netaji Subhash Engineering College, India)

  • Chandan Banerjee

    (Netaji Subhash Engineering College, India)

Abstract

In a cloud computing environment, effective scheduling policies and load balancing have always been the aim. An efficient task scheduler must be proficient in a dynamically distributed environment and to the policy of efficient scheduling of jobs based upon the workload. In this research, a novel hybrid heuristic algorithm is developed for balancing the load among cloud nodes. This is achieved by hybridizing the existing ant colony optimization (ACO), artificial bee colony algorithm (ABC), and AHP (analytical hierarchy process) algorithm. The AHP algorithm and the artificial bee colony (ABC) algorithm is used for figuring out the best servers suitable for a particular job, and the ant colony algorithm is used to find the most efficient path to that particular server. The proposed algorithm is better in resource utilization. It also performs better load balancing, which keeps on improving with time. The result analysis shows better average response time and better average makespan time compared to other two existing algorithms.

Suggested Citation

  • Soumen Swarnakar & Souvik Bhattacharya & Chandan Banerjee, 2021. "A Bio-Inspired and Heuristic-Based Hybrid Algorithm for Effective Performance With Load Balancing in Cloud Environment," International Journal of Cloud Applications and Computing (IJCAC), IGI Global, vol. 11(4), pages 59-79, October.
    • Handle: RePEc:igg:jcac00:v:11:y:2021:i:4:p:59-79
    as

    Download full text from publisher

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

    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:jcac00:v:11:y:2021:i:4:p:59-79. 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: 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.