Optimizing Load Balancing using Metaheuristics: A Survey

Load balancing is a significant issue in cloud computing that makes it difficult to guarantee proper service functioning in addition to the QoS, performance assessment, and service contract compliance that companies demand from cloud service providers (CSP). The primary objective of load balancing is to map workloads to utilize computational resources that greatly improve performance. Because of its large solution space, load balancing in cloud computing belongs to the class of problems stated as NP-hard problems. Consequently, it takes longer to forecast the optimal course of action. There aren't many approaches that might potentially handle these problems in polynomial time and yield an optimal solution. Previous studies have confirmed that metaheuristic-based techniques can achieve correct results in a reasonable amount of time.

Authors

Institutions

Publication Details

Published
2024-12-18
DOI
https://doi.org/10.1109/pdgc64653.2024.10984408
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Load Balancing using Metaheuristics: A Survey

Jagpreet Sidhu, Yugal Kumar, Arvinder Kaur
Scheduling and Optimization Algorithms
article

Optimizing Load Balancing using Metaheuristics: A Survey

Jagpreet Sidhu, Yugal Kumar, Arvinder Kaur
article en

Abstract

Load balancing is a significant issue in cloud computing that makes it difficult to guarantee proper service functioning in addition to the QoS, performance assessment, and service contract compliance that companies demand from cloud service providers (CSP). The primary objective of load balancing is to map workloads to utilize computational resources that greatly improve performance. Because of its large solution space, load balancing in cloud computing belongs to the class of problems stated as NP-hard problems. Consequently, it takes longer to forecast the optimal course of action. There aren't many approaches that might potentially handle these problems in polynomial time and yield an optimal solution. Previous studies have confirmed that metaheuristic-based techniques can achieve correct results in a reasonable amount of time.

Narsee Monjee Institute of Management Studies (IN), Punjab Engineering College (IN)
Openalex Percentile: Top 56%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.