A Review of Load Balancing Algorithms and Strategies in

Cloud Computing

Kanjula Shanmukeshwar Reddy (19103325),

Karrotu Venkat Sai (19103326),

Mattagunja Nikhil (19103338),

Gogada Taraka Rama Rajesh Naidu (19103316)

Under the guidance of Dr. Suraj Sharma (Assistant professor in SOSET, GGV, Bilaspur)

ABSTRACT

With the advent of Web 3.0 and various cloud computing technologies it has added a new trend
in users by accessing various services on the basis of pay as you use at any time and any
geographical location. With the increase in rapid resources provisioning of these cloud services
various business entities and organizations are shifting to this technology. As there was a huge
demand for these services there was a situation of under and over utilization of resources. For the
effective utilization of resources there has to be a balance of load among the various computing
resources. This technique of load balancing is a major challenge found almost in every cloud
environment where it can resolve multi-variant, multi-constant problem that enhances
performance and efficiency of cloud platform resources. These drawbacks in cloud resource
utilization can be resolved by various cloud load balancing techniques such as some existing
algorithms, nature inspired algorithms, machine learning based techniques and some other
services provided by the cloud itself. Further the factors caused unbalancing load problem weren’t
studied in this literature. This paper will compare some existing models with some analytic metrics
and analyses the advantages and shortcomings of them.

INDEX TERMS Cloud load balancing, load balancing techniques, load balancing metrics.
I. INTRODUCTION
The first use of virtual computers became popular in
the 1990s, leading to the development of the modern
cloud computing infrastructure. By the last year of 20th
century, Salesforce became an emerging example of
using Cloud Computing successfully. In 2002, Amazon
introduced its web-based retail services and in 2006 it
launched web services namely EC2, which offers
online services to clients or other websites on rent
basis. In the same year there was introduction of
Google Docs services by Google and later by it and
other tech-giants like Microsoft, IBM, Oracle, Alibaba
etc. As there was a huge surge in Cloud Computing
technologies the demand for their services too
increased for an extent. Thereby, the pressure or
workload on the servers is increased and this pressure
situation has to be handled by distributing the workload
among them equally or uniformly or in an efficient
manner. Based on this problem the concept of load
balancing is introduced which revolves around the
mitigation of workload in various Cloud Computing
Technologies. The main schema around this load
balancing concept is to optimize the performance of a
system by preventing bottlenecks and overloading of
resources, thereby improving the overall efficiency and
reliability of the system. Over the years, researchers
have developed various load balancing techniques
using both traditional and natural inspired algorithms
which were classified into static and dynamic
methodologies based on their type of resource
scheduling involved in them for achieving the goal of
effective resource utilization [1]. Static and dynamic
scheduling are the methods based on which the tasks
are scheduled and in these two the former methodology
expects the earlier information about the structure and
different parameters like time, memory etc.., They
don't have information about present condition of
framework. So, it may lead uneven distribution of load,
particularly when the framework changes into dynamic
environment [2]. Though dynamic algorithms work
better when compared to static algorithms, it is difficult
to design and develop an algorithm for dynamic cloud
environment [3]. The balancing of the load is the main
objective of any load balancing algorithm. However,
there are some parameters such as turnaround time,
response time which need to be considered when
designing any algorithms. Traditional load balancing
techniques such as round-robin, random, and least-
connection algorithms which are static methods have
been widely used in the industry to distribute the
workload. These techniques are relatively simple to
implement and require minimal computational
overhead, making them a popular choice for load
balancing in many systems. However, they may not
always be effective in handling complex and dynamic
workloads, which require more sophisticated load
balancing techniques.
However, the dynamic methodologies are capable of
adapting to changing workloads and can optimize the
system's performance more efficiently than traditional
load balancing techniques. In this research paper, we
present a comprehensive review of load balancing
techniques with a focus on traditional and natural
inspired algorithms. We shall discuss the strengths and
weaknesses of each technique, their suitability for
different types of workloads, and their performance in
real-world scenarios. We have also evaluated the
effectiveness of these techniques in different
environments and highlight the current trends in load
balancing research.
II. LITERATURE REVIEW
There are various accounts and studies on different
algorithms up to the current knowledge, because of pall
grounded service computing is still evolving. In [4] authors
compared in terms of outturn, response time, reversal time,
staying time in different types of Round Robin algorithms
similar as Modified Round Robin, Time Slice Priority Based
Round Robin, Round Robin and stated that in terms of high
outturn and lower response time, TSPBRR gives better
results. In [5] it proposed a new system called elastic pall
maximum- min algorithm (ECMM). Which is bettered on
base of maximum- min algorithm. In [6] it mentions the
configuring storehouse services in pall as a structure as a
Service model. In [7] the author proposed an algorithm for a
cargo balancing in tasks that was grounded on honey freak
geste. Authors proposed a scheduling algorithm which
supports cargo balancing in pall with respect to colorful
criteria of quality services grounded on coffers [8]. In [9] it
bandied about inheritable algorithms used for dynamic cargo
balancing in the type of distributed terrain. In [10] authors
apply a mongrel fashion grounded on flyspeck mass
Optimization (PSO) for enhancing resource application and
reducing makespan time. It mentions that inheritable
Algorithm (GA) was employed by the traditional models to
attain the result in an optimal way for the issues in scheduling
of tasks in the type of distributed surroundings like pall and
grid computing [11]. In [12] it states that there are colorful
meta- heuristic and heuristic algorithms proposed for task
scheduling and cargo balancing in pall resource operation.
The authors bandy the significance of cargo balancing in
Cloud Computing, colorful types of loads in pall and the
significance of effective application of the coffers [13]. It
[14] plans an enhanced ant colony fashion for resolving the
scheduling issue. In [15] it proposes a task scheduling
scheme grounded on the sharing medium and optimization
algorithms of mass intelligence. By combining Ant Colony
Optimization, inheritable Algorithm and Artificial Bee
Colony, a sharing module was being enforced to partake the
result in an optimal way. In [16] the author notes that the
extensively used dynamic cargo balancing algorithm for pall
terrain is the Honey Bee rustling algorithm, it performs with
lower response time than compared to other being
algorithms. They in [17] proposed an algorithm for cargo
balancing with the use of inheritable algorithm which was
designed for minimization of task in pall computing terrain.
In [18] they've made a probabilistic approach for distribution
of dynamic cargo in pall on the base of distributed ranges
that were being apprehensive of QoS (Quality of Services).
This approach had employed various ants as a ranking
inorder for distinguish it from the mortal coffers (HRs). [19]
introduced an algorithm to allocate cipher coffers at colorful
spots under the defined access of total network coffers, by
this system it can resolve network cargo using resource
allocation. [20] Effective task scheduling and cargo
balancing in pall structure can be achieved by new approach
called MHO (Meta- Heuristic Optimization). It's a mongrel
optimization fashion which combines the advantage of
Firefly Algorithm (FA) and Particle Swarm Optimization
(PSO) algorithm. The main end of this algorithm is used to
reduce prosecution time & deadline.
III. CHALLENGES IN LOAD BALANCING
The various challenges that are usually occurs in Cloud
Computing are briefly summarized in this paper up to some
extent based on their impact [28].
1) Security
The primary concern in Cloud Computing is security
as they were managed by third party or service
providers such that they can manage our data.
2) Data Migration
Whatever the data we are storing in the cloud it can
be easily migrated such that the process ensures data
compatibility, and test the system before its
deployment have been taken place.
3) Fault tolerance
It is the most important parameter due to resource may
be lost at any time due to the failure of any
components then the ability to retrieve the data which
was stored in the system is crucial part.
4) Administrative Capabilities
As there were many cloud services are available, the
first step is infrastructure management,
transformation of network. There is a huge potential
for enriching the robustness and functioning of Load
balancing that has given to date. [21]
5) Performance
The performance of any cloud services can be
affected by numerous factors such as bandwidth,
processing power, network latency. For ensuring
better performance, business entities need to carefully
consider their needs of infrastructure and select the
required cloud services to meet their needs.
6) Integration
Cloud services integration with the existing systems
can be challenging. Business entities need to ensure
that their cloud services can integrate with the
previous systems for avoiding the problem of data
collision and compatibility issues.
7) Cost
Many of the cloud services are cost-effective but they
can be expensive too if they aren’t managed properly.
Organizations need to carefully examine and evaluate
their usage patterns and pick the appropriate pricing
services or models to mitigate overarching expenses.
IV. LOAD BALANCING
Load balancing is a technique used in computer networks to
distribute incoming traffic across multiple servers, resources,
or instances to optimize resource utilization, improve
scalability, and ensure high availability of services [22].
The goal of load balancing is to ensure that no single server
or resource is overwhelmed with traffic while others remain
idle. Load balancing algorithms distribute traffic based on
predefined rules, real-time information about server capacity
and load, or a combination of both.
Load balancing can be implemented at different layers of the
network infrastructure, including the network, application,
and database layers. Network load balancing (NLB)
distributes traffic at the network layer, while application load
balancing (ALB) distributes traffic at the application layer,
providing more granular control over traffic distribution.
Database load balancing (DLB) distributes traffic across
multiple database servers to improve performance and
availability [23].
 A. BASED ON INITIATION PROCESS
In load balancing, sender-initated, receiver-initiated, and
symmetric communication can be used to distribute
incoming network traffic across multiple servers or resources
[24].
Initiated sender load balancing: In this approach, the load
balancer distributes traffic to the servers based on the
requests initiated by the sender. The sender sends all the
requests to the load balancer, which then distributes the
traffic to the servers based on predefined rules or algorithms.
This approach is commonly used in streaming applications
where the sender continuously sends data to the receivers.
Receiver-initiated load balancing: In this approach, the load
balancer distributes traffic to the servers based on the
requests initiated by the receiver. The receiver sends a
request to the load balancer, which then distributes the traffic
to the servers based on predefined rules or algorithms. This
approach is commonly used in web applications where the
receiver requests specific data from the server.
Symmetric load balancing: In this approach, the load
balancer distributes traffic to the servers based on a
symmetric or bidirectional communication model. Both the
sender and receiver can initiate communication with the load
balancer, and the load balancer distributes traffic to the
servers based on predefined rules or algorithms.
Each approach has its own advantages and disadvantages and
is suited for different types of applications. The choice of
load balancing approach depends on factors such as the type
of application, the network environment, and the
performance requirements.
B. BASED ON STATE OF RESOURCE
SCHEDULING
Load balancing algorithms can be classified into different
categories based on their approach to distributing traffic.
Some of the most common categories include [24]:
Static Load Balancing Algorithms:
Static load balancing algorithms use fixed rules to distribute
traffic across servers or resources. These algorithms do not
take into account the current state or capacity of the servers,
and the rules are defined in advance. Static load balancing
can be simple and efficient but may not adapt well to changes
in traffic patterns or server capacities [24].
Dynamic Load Balancing Algorithms:
Dynamic load balancing algorithms use real-time
information about server capacities and traffic loads to make
decisions about traffic distribution. These algorithms can
adjust quickly to changes in traffic patterns and server
capacities, ensuring that resources are utilized optimally.
Dynamic load balancing can be more complex and require
more computational resources but can provide better
performance and scalability [24].
Nature-Inspired Load Balancing Algorithms:
Nature-inspired load balancing algorithms use principles
derived from natural systems, such as genetic algorithms, ant
colony optimization, or swarm intelligence, to distribute
traffic across servers. These algorithms can adapt to changes
in traffic patterns and server capacities and can provide
optimal solutions that are difficult to achieve with traditional
algorithms. Nature-inspired load balancing algorithms can
be computationally intensive but can provide superior
performance and scalability.
Overall, choosing the appropriate load balancing algorithm
depends on the specific requirements and constraints of the
system. Static algorithms can be simple and efficient but may
not adapt well to changes, while dynamic and nature-inspired
algorithms can provide better performance and scalability
but may require more computational resources.
Load balancing aims at: -
1) Enhance the throughput of the network
2) Fault Tolerance
3) Scalability of the system
4) Efficient resource utilization
5) Reliability in the service
6) Minimize the system overhead
Round robin algorithm In cloud computing, Round Robin
is a load balancing algorithm used to distribute incoming
traffic or requests among a group of servers or virtual
machines (VMs) that are part of a server cluster. The
Round Robin algorithm works by rotating the incoming
requests or traffic through a predefined list of servers or
VMs in a circular order. Each server or VM in the list is
given an equal chance to handle a request or traffic,
regardless of its current workload or resource utilization
[25].
Weighted Round Robin (WRR) is a load balancing
algorithm used in cloud computing to distribute incoming
traffic or requests among a group of servers or virtual the dissimilarity between them. One key feature of active
machines (VMs) that are part of a server cluster. Unlike the clustering is that it allows the clusters to evolve and adapt
standard Round Robin algorithm, where each server or VM to changes in the data over time [24].
is given an equal chance to handle a request, the WRR
algorithm assigns a weight to each server or VM in the Throttled Load Balancing Algorithm
cluster [24]. According to this algorithm, the total number of VMs are
maintained in the form of a table by the load balancer and
The Min-Max algorithm is a recursive algorithm that is their states (BUSY/AVAILABLE) [26, 27].
commonly used in game theory to determine the optimal
move for a player assuming that the other player is also Algorithm Pros Cons
playing optimally. It is also known as the Minimax
algorithm. The Min-Max algorithm works by building a
game tree that represents all possible moves and counter-
Round Robin Equal distribution Process is not
moves that can be made by both players. The algorithm Algorithm of work load known in
alternates between two types of nodes in the game tree: [25] advance. For a
Max nodes and Min nodes. A Max node represents the larger task
player's turn, and the algorithm selects the move that context switching
maximizes the score. A Min node represents the opponent's increases
turn, and the algorithm assumes that the opponent will
select the move that minimizes the score [25].

The VM (Virtual Machine) assignment load balancing Processing time

algorithm is used to distribute incoming network traffic Weighted Optimal resource not taken into
across multiple virtual machines in a cloud computing Round Robin utilization consideration
environment. The goal of this algorithm is to enhance [24]
processors utilization and ensure that no VM’s are given
more tasks than they can handle. One common VM
assignment load balancing algorithm is the Round Robin Min Max Shorter makes pan Shorter jobs have
algorithm. In this algorithm, incoming requests are Algorithm as compared to to wait
distributed in a circular manner to each virtual machine in [25] Min- Min
the pool [23].

Opportunistic Load Balancing Algorithm is a dynamic VM Assign Proper VM VM processing

load balancing algorithm that takes advantage of available LB utilization power is not
resources to distribute incoming traffic across multiple Algorithm considered
servers. This algorithm is used to improve the overall [23]
performance and scalability of a server cluster. In Opportunistic Keeps all available Does take into
opportunistic load balancing, the incoming traffic is Load VM busy account the
dynamically routed to the server that has the least amount Balancing previous load
of workload at that moment. The algorithm also monitors (OLB) [25]
the performance of the servers and dynamically adjusts the
traffic distribution to maintain optimal performance [25].
Overall, the opportunistic load balancing algorithm is a Active Existing load is VM processing
clustering taken into power is not
powerful tool for improving the performance and
algorithm consideration considered
scalability of server clusters, particularly in environments [24]
where the workload is unpredictable or varies significantly
over time.
Throttled Utilization of Current workload
Active clustering algorithm is a clustering technique Load resources of VM isn’t
which used to partition data into groups or clusters based on Balancing effectively considered
their similarity. In active clustering, the algorithm starts [26, 27]
with an initial set of clusters and then iteratively merges or
splits them based on certain criteria. The goal is to TABLE 1. Comparison of various Existing Load balancing
maximize the similarity within the clusters and minimize algorithms.
Nature Inspired algorithms Nature
Inspired
Pros Cons
Algorithm
These Load Balancing algorithms are influenced by natural
phenomena or biological behaviour. Some of them are: GAs is often There is no
robust to changes guarantee that a
Genetic algorithm: In [1, 29] it states that these type of in the problem or GA will find the
algorithm follows natural behavior of travelling in the best solution to a
chromosomes from the older to younger generations. The Genetic environment, problem,
chromosomes shall be developed by using some standard [1,29] which means they particularly if the
measures in an iterative way successively. can continue to problem is poorly
work well even if defined or
Ant Colony Optimization: It follows the natural behavior the problem has many variables.
of ants which is attributed to their process of searching the changes.
food. Usually, they leave a chemical named pheromone
while in search of food. If the food source was found, they ACO is often ACO can require
will take the food and then in their path leaves that robust to changes careful parameter
in the problem or tuning to achieve
pheromone. The intensity of the chemical is based on the
in the good performance,
size of the food source [1, 30]. Ant Colony environment, which can be time-
Optimization which means it consuming and
Particle Swarm Optimization: This algorithm follows the
[1, 30] can continue to difficult.
natural behavior of flocking of birds. Generally, they will
work well even if
flock when there are abundant food resources are available. the problem
This type of behavior of birds is applied to find the optimal changes.
path in virtual machine for handling the workload [1].
PSO can be used PSO can be
Water Wave Algorithm: This algorithm is based on the to solve a wide computationally
natural behavior of water wave flow and its theory is based Particle range of expensive,
on shallow wave theory. It is developed for 3D space of Swarm problems, particularly for
seabed for optimization of a problem but initially it was Optimization including large problems or
used to schedule high speed trains [1]. optimization, problems with
[1] feature selection, many variables.
Honey Bee Foraging: The author in [31] suggested this and machine
algorithm which was focused on optimization in bee colony learning.
and the behavior of honey bees, which will be optimizing
the food or nectar which was collected by them to reach the The WWA is a The convergence
simple algorithm rate of the WWA
maximum levels of production.
that is easy to can be slow,
Other Techniques implement and especially for
can be easily complex problems.
The cloud load balancing is also can be done by an AWS Water Wave modified to solve
service that is EC2 by using VM wares [1] various
optimization
Amazon Elastic Compute Cloud (EC2) EC2 by AWS problems.
is a well-known cloud computing service that allows users
to launch and manage virtual machines, called instances,
It has a good ability The convergence
on-demand, and provides resizable compute capacity in the to search for global rate of the HBFA
cloud. Load balancing is an essential component of the optima, as it uses can be slow,
AWS infrastructure, and EC2 offers several load balancing the concept of especially for
options to distribute traffic across multiple instances and Honey Bee swarm intelligence
and the recruitment
complex problems.
enhance application scalability, performance, and Foraging
process of honey
availability in the cloud [32]. The Elastic Load Balancer bee foraging to
[30, 31]
(ELB) is the most commonly used load balancing model for converge to the best
EC2 instances. Choosing the right load balancing model for solution.
an application depends on the specific needs, traffic
TABLE 2. Comparison of various Nature Inspired Algorithms.
volume, and level of control and customization required.
The cloud load balancing also can be done by using Deep
Learning by using the keras library
Cloud load balancing using deep learning techniques
involves training a deep neural network on historical data to
predict the optimal distribution of incoming traffic across
multiple servers or instances. Keras is a popular deep
learning library that provides a high-level interface for
building and training neural networks. Here's a high-level
overview of how cloud load balancing using deep learning
with Keras could work [33]:
Collect and pre-process data: The first step is to collect and
pre-process historical data on traffic patterns, resource
usage, and server availability. This data can be obtained
from server logs, monitoring tools, or other sources. The
data should be pre-processed to remove any noise or
outliers, and normalized to ensure consistent scaling.
Define the neural network architecture: The next step is to
define the neural network architecture using Keras. The
architecture will depend on the specific requirements of the
load balancing problem, but could include multiple layers
of fully connected or convolutional neural networks.
Train the neural network: Once the neural network
architecture is defined, it needs to be trained on the pre-
processed historical data. This involves splitting the data
into training and validation sets, and using an optimizer and
loss function to update the network weights and biases
during backpropagation. Keras provides a range of built-in
optimizers and loss functions, or users can define custom
ones.
Deploy the trained model: After the neural network is
trained, the next step is to deploy the model to the cloud
infrastructure. This could involve using Keras with a cloud
platform such as AWS, GCP, or Azure to manage the
instances and distribute traffic based on the predictions
from the model.
Monitor and update the model: Finally, the trained model
needs to be continuously monitored and updated as traffic
patterns change or new instances are added or removed.
This may involve using real-time monitoring tools and
retraining the model periodically on updated data to ensure
optimal load balancing performance. In summary, cloud
load balancing using deep learning techniques with Keras
involves collecting and pre-processing data, defining and
training a neural network model, deploying the model to the
cloud infrastructure, and continuously monitoring and
updating the model to optimize load
balancing performance.
V. LOAD BALANCING METRICS FOR
VARIOUS ALGORITHMS
1) Performance: The overall system efficiency can be
calculated using this metric, which should be improved at
an optimal cost [34-36].
2) Resource Utilization: This metric is useful in verifying
whether a system's resources are being utilized effectively
or not. Ideally, resource utilization should be at optimal
levels.
3) Response time: It is defined as the time period between
the sender’s request and the receiver’s response. It shall be
reduced for enhancing the performance of a system.
4) Overhead: The overhead associated with executing a
load balancing algorithm encompasses additional expenses,
inter-processor and inter-process communication, and task
migration. To optimize the efficiency of an algorithm, this
overhead must be minimized.
5) Fault tolerance: Fault tolerance refers to a system's
ability to continue processing uninterrupted even if one or
more system elements fail. To ensure effective load
balancing, a system should have a high level of fault
tolerance.
6) Scalability: Scalability refers to a system's capability to
increase or expand the number of nodes while maintaining
the same level of Quality of Service (QoS) in the event of
an increase in the number of users.
7) Migration time: The "task migration time" metric is
defined as the duration taken to transfer tasks or resources
from one node to another. To achieve better performance,
task migration time should be minimized.
8) Throughput: Throughput is a metric that measures the
total number of jobs completed by a system. To achieve
optimal system performance, the throughput should be
high.
VI. SUMMARIZATION
After examining load balancing techniques in resource
scheduling, including nature-inspired and cloud-based
methods such as deep learning, we analyzed their
 Algorithm Overhead Resource Response Performan Fault Scalability Migration Throughput
Utilization time ce tolerance time

Round ✓ ✓ ✓ ✓  ✓  ✓
Robin

Min-Max ✓ ✓ ✓ ✓    ✓

OLB    ✓    ✓

ACO ✓ ✓  ✓  ✓ ✓ ✓

Throttled  ✓ ✓ ✓ ✓ ✓ ✓ ✓

Active ✓ ✓     ✓ ✓
clustering

Honey Bee  ✓      
Foraging

TABLE 3. Comparison of various Load balancing

algorithms based on the 8 metrics

Balancing is a technique employed to evenly distribute the

advantages and disadvantages. The findings were organized
in Table 1 and Table 2, which specifically focused on nature-
inspired algorithms. By comparing the techniques based on
8 metrics, we evaluated their performance and ability to
demonstrate the properties outlined in Table 3.
VII. FUTURE RESEARCH DIRECTIONS
Although there is a wealth of literature on this subject,
this study has identified specific aspects that warrant further
investigation.
workload among nodes to optimize resource utilization and
system performance. This research paper emphasizes the
significance of Load Balancing, its benefits, and various
types. The study conducts a survey of different Load
Balancing algorithms proposed by researchers, analyzing
each algorithm's pros and cons. To compare these
algorithms, various performance parameters such as
scalability, throughput, performance and others were
considered. Based on the analysis of various algorithms, it is
observed that the Throttled load balancing algorithm and Ant
Colony Optimization algorithm exhibit superior
performance in the metrics.

ACKNOWLEDGMENT
VIII. CONCLUSION
The authors express their gratitude to all individuals who
The IT industry is witnessing a rising trend in Cloud
contributed to the enhancement of this paper's content.
Computing that demands high infrastructure, resources, and
storage. Among the numerous challenges posed by Cloud
Computing, Load Balancing plays a crucial role. Load
REFERENCES
[1]. Arulkumar V, Bhalaji N (2019) Load balancing in cloud
computing using water wave algorithm. Concurr Comput
Pract Exp. https:// doi.org/10.1002/cpe.5492.
[2]. Chen SL, Chen YY, Kuo SH (2017) CLB: a novel load
balancing architecture and algorithm for cloud services.
Comput Electr Eng 58:154–160
[3]. Patel S, Patel H, Patel N (2016) Dynamic load balancing
techniques for improving performance in cloud computing.
Int J Comput Appl 138(3):1–5
[4]. Samal P, Mishra P (2013) Analysis of variants in round
robin algorithms for load balancing in cloud computing. Int
J Comput Sci Inf Technol 4(3):416–419
[5]. Li X, Mao Y, Xiao X, Zhuang Y (2014) An improved
max–min taskscheduling algorithm for elastic cloud. In:
IEEE international symposium on computer, consumer and
control, pp 340–343
[6]. D. Eyers, R. Routray, R. Zhang, D. Willcocks, and P.
Pietzuch, ‘‘Towards a middleware for configuring large-
scale storage infrastructures,’’ in Proc. 7th Int. Workshop
Middleware Grids, Clouds e-Sci., 2009, p. 3
[7]. L. D. D. Babu and P. V. Krishna, ‘‘Honey bee behavior
inspired load balancing of tasks in cloud computing
environments,’’ Appl. Soft Comput., vol. 13, no. 5, pp.
2292–2303, May 2013
[8]. Saramu KA, Jaganathan S (2015) Intensified scheduling
algorithm for virtual machine tasks in cloud computing.
Artificial Intelligence and Evolutionary Algorithms in
Engineering Systems 325:283– 290.
https://doi.org/10.1007/978-81-322-2135-7_31
[9]. Y.-L. Chou, S. Liu, E.-Y. Chung, and J.-L. Gaudiot, ‘‘An
energy and performance efficient DVFS scheme for irregular
parallel divide-and-conquer algorithms on the intel SCC,’’
IEEE Comput. Archit. Lett., vol. 13, no. 1, pp. 13–16,
Jan./Jun. 2014
[10]. Al-Olimat HS, Alam M, Green R, Lee JK (2015)
Cloudlet scheduling with particle swarm optimization. Proc
IEEE Int Conf Commun Syst Netw Technol.
https://doi.org/10.1109/CSNT.2015.252
[11]. Beegom AA, Rajasree M (2015) Genetic algorithm
framework for bi-objective task scheduling in cloud
computing systems. Distributed computing and internet
technology. Springer, Berlin, pp 356–359
[12]. Shishira SR, Kandasamy A, Chandrasekaran K (2016)
Survey on Meta heuristic optimization techniques in cloud
computing, Intl. Conference on Advances in Computing,
Communications and Informatics (ICACCI), IEEE, 1434–
1440. https://doi.org/10.1109/ ICACCI.2016.7732249.
[13]. R. Kaur and P. Luthra, ‘‘Load balancing in cloud
computing,’’ in Proc. Int. Conf. Recent Trends Inf.,
Telecommun. Comput. (ITC), Dec. 2012, pp. 14–20
[14]. Zuo L, Shu L, Dong S, Zhu C, Hara T (2015) A multi-
objective optimization scheduling method based on the ant
colony algorithm in cloud computing. Proc IEEE Conf
Access Big Data Serv Comput Intell Ind Syst.
https://doi.org/10.1109/ACCESS.2015.2508940
[15]. F. U. Xiao, ‘‘Task scheduling scheme based on
sharing mechanism and swarm intelligence optimization
algorithm in cloud computing,’’ Comput. Sci., vol. 45, no.
1, pp. 303–307, 2018.
[16]. Krishna, P. V. (2013). Honey bee behavior inspired
load balancing of tasks in cloud computing environments.
Applied Soft Computing, 13(5), 2292–2303.
[17]. K. Dasgupta, B. Mandal, P. Dutta, J. K. Mondal, and
S. Dam, ‘‘A genetic algorithm (GA) based load balancing
strategy for cloud computing,’’ Procedia Technol., vol. 10,
pp. 340–347, Dec. 2013
[18]. Razzaghzadeh, S., Navin, A.H., Rahmani, A.M.,
Hosseinzadeh, M.: Probabilistic modeling to achieve load
balancing in expert clouds. Ad Hoc Netw. 59, 12–23 (2017)
[19]. M. Keller and H. Karl, "Response-Time-Optimized
Service Deployment: MILP Formulations of Piece-Wise
Linear Functions Approximating Bivariate Mixed-Integer
Functions," IEEE Transactions on Network and Service
Management, vol. 14, no. 1, pp. 121-135, 2017
[20]. S. Peer Mohamed Ziyath, S. Senthilkumar Journal of
Ambient Intelligence and Humanized Computing
https://doi.org/10.1007/s12652-020-02282-7
[21]. A. Rashid and A. Chaturvedi, ‘‘Cloud computing
characteristics and services a brief review,’’ Int. J. Comput.
Sci. Eng., vol. 7, no. 2, pp. 421–426, Feb. 2019, doi:
10.26438/ijcse/v7i2.421426.
[22]. Kumar, S., Rana, D.S.: Various dynamic load
balancing algorithms in cloud environment: a survey. Int. J.
Comput. Appl. 129(6), 16 (2015)
[23]. S. K. Mishra, B. Sahoo, and P. P. Parida, ‘‘Load
balancing in cloud computing: A big picture,’’ J. King Saud
Univ.-Comput. Inf. Sci., vol. 32, no. 2, pp. 149–158, Feb.
2020, doi: 10.1016/j.jksuci.2018.01.003
[24]. Aditya, A., Chatterjee, U., Gupta, S.: A comparative
study of different static and dynamic load balancing
algorithm in cloud computing with special emphasis on
time factor. Int. J. Curr. Eng. Technol. 5(3), 1898–1907
(2015)
[25] R. K. Mondal and P. Ray. Load Balancing. Accessed:
May 10, 2020. [Online]. Available:
https://www.academia.edu/ 21990663/Load_Balancing
[26]. Mukundha, C., Venkatesh, N., Akshay, K.: A
comprehensive study report on load balancing techniques in
cloud computing. Int. J. Eng. Res. Dev. 13(9), 35–42 (2017)
[27]. Kashyap, D., Viradiya, J.: A survey of various load
balancing algorithms in cloud computing. Int. J.
Sci.Technol. Res 3(11), 115–119 (2014)
[28]. Wikipedia. (Apr. 15, 2020). Cloud Computing
Security. Accessed: May 10, 2020. [Online]. Available:
https://en.wikipedia.org/w/index.php?title=Cloud_computig
_security&oldid=951138168.
[29]. E. J. Ghomi, A. M. Rahmani, and N. N. Qader,
‘‘Load-balancing algorithms in cloud computing: A
survey,’’ J. Netw. Comput. Appl., vol. 88, pp. 50–71, Jun.
2017.
[30]. P. Kumar and R. Kumar, ‘‘Issues and challenges of
load balancing techniques in cloud computing: A survey,’’
ACM Comput. Surveys, vol. 51, no. 6, pp. 1–35, Feb. 2019,
doi: 10.1145/3281010.
[31]. S. Joshi and U. Kumari, ‘‘Load balancing in cloud
computing: Challenges & issues,’’ in Proc. 2nd Int. Conf.
Contemp. Comput. Informat. (IC3I), Greater Noida, India,
Dec. 2016, pp. 120–125, doi: 10. 1109/IC3I.2016.7917945.
[32]. Dr. Sharvani GS, Resma KS, Turkish Journal of
Computer and Mathematics Education Vol.12 No. 11
(2021), 515-531.
[33]. I.J. Information Technology and Computer Science,
2020, 3, 8-18 Published Online June 2020 in MECS
(http://www.mecs-press.org/) DOI:
10.5815/ijitcs.2020.03.02
[34]. Devaraj, A., Saviour, F., et al.: Hybridization of firefly
and improved multi-objective particle swarm optimization
algorithm for energy efficient load balancing in cloud
computing environments. J. Parallel Distrib. Comput. 142,
36–45 (2020)
[35]. Suntharam, S.M.S.: Load balancing by max-min
algorithm in private cloud environment. Int. J. Sci. Res.
(IJSR) 4, 438 (2013). ISSN (Online): 2319–7064 Index
Copernicus Value (2013): 6.14 Impact Factor
[36]. Nishant, K., et al.: Load balancing of nodes in cloud
using ant colony optimization. In: 2012 UKSim 14th
International Conference on Computer Modelling and
Simulation. IEEE (2012).