Author
Listed:
- Baskar K
- Peter Soosai Anandaraj A
- Ramesh P. S.
- Swedhaa Mathivanan
Abstract
In cloud computing environments, user requests often lead to varying load conditions across the system, resulting in underloaded, overloaded, or balanced states. Both underloading and overloading can cause system inefficiencies, including increased power consumption, prolonged execution times, and higher machine failure rates. Therefore, effective load balancing (LB) becomes a critical aspect of task scheduling in cloud systems, whether at the level of virtual machines (VMs) or independently. To address these challenges, this paper proposes the Chronological Kookaburra Optimization Algorithm (ChKOA) for efficient LB in cloud computing (CC). The proposed ChKOA is the combination of chronological concept with the Kookaburra Optimization Algorithm (KOA). Initially, tasks are assigned to VMs in a round‐robin manner. Based on specific VM parameters, the VMs are classified into overloaded and underloaded categories using deep embedded clustering (DEC). Tasks in overloaded VMs are prioritized and redistributed to underloaded VMs, considering factors such as supply, demand, capacity, predicted load, and key Quality of Service (QoS) metrics, including resource availability and reliability. Load prediction is performed using a Deep Residual Network (DRN). Simulation results demonstrate that the proposed ChKOA achieves a balanced load of 0.535, capacity utilization of 0.954, resource availability of 0.954, reliability of 0.936, and a computational cost of 0.327 s.
Suggested Citation
Baskar K & Peter Soosai Anandaraj A & Ramesh P. S. & Swedhaa Mathivanan, 2025.
"QoS‐Aware Load Balancing in Cloud Computing Based on Chronological Kookaburra Optimization Algorithm,"
International Journal of Network Management, John Wiley & Sons, vol. 35(5), September.
Handle:
RePEc:wly:intnem:v:35:y:2025:i:5:n:e70020
DOI: 10.1002/nem.70020
Download full text from publisher
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:wly:intnem:v:35:y:2025:i:5:n:e70020. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.