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

Resource-Aware Least Busy (RALB) Strategy for Load Balancing in Containerized Cloud Systems

Author

Listed:
  • Zakariyae Bouflous

    (ENSEM, Hassan 2 University of Casablanca, Morocco)

  • Mohammed Ouzzif

    (EST, Hassan 2 University of Casablanca, Morocco)

  • Khalid Bouragba

    (EST, Hassan 2 University of Casablanca, Morocco)

Abstract

Containers are a key technology in modern cloud environments. They provide a lightweight manner to package and deploy service applications compared to virtual machines, with an isolated processing approach. The state-of-the-art containers LB algorithms do not take into account efficient mapping between container requirements and servers' capabilities, resulting in wastage of resources and increased response time, which negatively impacts the overall QoS. This manuscript proposes a new LB algorithm for containers called resource-aware least busy (RALB). RALB not only considers the current load of each node (as per the least connection) but also takes into account the current resource requirements of containers. It assigns containers to the least busy server with optimal capacity from a resource perspective. The authors implemented a prototype of the algorithm, and simulation results shows that more even distribution of workload and better utilization of resources across the nodes can be achieved, resulting in lower latency and high reliability compared to the randomized algorithm.

Suggested Citation

  • Zakariyae Bouflous & Mohammed Ouzzif & Khalid Bouragba, 2023. "Resource-Aware Least Busy (RALB) Strategy for Load Balancing in Containerized Cloud Systems," International Journal of Cloud Applications and Computing (IJCAC), IGI Global, vol. 13(1), pages 1-14, January.
    • Handle: RePEc:igg:jcac00:v:13:y:2023:i:1:p:1-14
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCAC.328094
    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:13:y:2023:i:1:p:1-14. 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.