See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/289335580

Different technique of load balancing in distributed system: A review paper

Conference Paper · April 2015

DOI: 10.1109/GCCT.2015.7342686

CITATIONS READS

10 495

3 authors, including:

Mohd Shahid Husain Riyazuddin Khan

University of Technology and Applied Sciences (CAS - Ibri) Oman Jamia Millia Islamia
59 PUBLICATIONS 268 CITATIONS 2 PUBLICATIONS 13 CITATIONS

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Critical Concepts, Standards, and Techniques in Cyber Forensics View project

Service Mechanism to Reduce Query Latency in iVANET: An Approach to Improve Quality of Service in iVANET (IoV) View project

All content following this page was uploaded by Mohd Shahid Husain on 07 August 2021.

The user has requested enhancement of the downloaded file.

Proceedings of 2015 Global Conference on Communication Technologies(GCCT 2015)
Different Technique of Load Balancing In
Distributed System: A Review Paper
Riyazuddin Khan 1 Mohd Haroon2
Integral University Integral University
riyazkhan.cs@gmail.com mharoon@iul.ac.in
Abstract- load in network is rapidly increases day by
day by the user input or by the machine
communication, so it will affect the performance of the
computing nodes, if we will not justify the load of the
computing node, it means we will not consider a
desirable output from the computing node , load of the
computing node is calculated on the basis of queue
length and available memory. The main objective of this
work is to improve the throughput as well as minimized
the CPU time. Load balancing can be defined as a
method of improving the performance of a
distributed and parallel system by redistributing the
load among the processors. Load balancing is control
word wide wave for increasing demands so fast and
Precise Load balancing is an important point in
increasing efficiency of distributed system operation.
But it is a difficult task in very large scale
distributed system because the distributed systems
always have dynamically changed global state. For
high availability, throughput, and scalability
the distributed system needs better and
efficient load balancing. In this paper, we present an
overview of the different techniques and methodology
given by different researchers throughout the globe
and try to analyse their effectiveness in improving the
methods of load balancing.
Key Words- Static Load Balancing, Dynamic Load
Balancing, Load Balancer, Distributed System.
1. INTRODUCTION
The growth and speed of the use of computer has
magnified the number of resources trying to share
the application and thereby increased the amount of
load and traffic across internet. Solution to the
problem can be achieved by increasing the size of
servers or by distributing the applications in
efficient manner across many servers. Distribution
of resources is called as load balancing. Load
Balancing is based on the idea of moving from
places to places of surplus or extra load from
heavily loaded node to lighter loaded ones. The
problem begins with when to discover out that
when the node has to be migrated. This solution to
the problem is basically based on local load
situation and its analysis. For example, a simple
method may be the assessment of the load between
978-1-4799-8553-1/15/$31.00 © 2015 IEEE
Mohd Shahid Husain3
Integral University
shahid@iul.ac.in
different nodes in reference to the neighbouring
node and then to find out the node to which the task
has to be migrated. But the two nodes, each with
same task might not be uniformly loaded as in case
of distributed environment; the nodes are of
different nature. Now, load determination can be
estimated by knowledge of processing power of
each node. Processing power not only includes
processing speed of processor but it also includes
the overall methodology of node. In applications
with same workloads, we can use static load
balancing as a pre processor for the computation.
Other applications, such as adaptive finite element
methods, they have workloads that cannot be
determined or changed during the evaluation; such
types of applications require dynamic load
balancers that adjust the decomposition as the
computation goes on. Load balancing algorithms
differ in their complexity where complexity is
defined by the amount of communication taking
place that is used to find out the least loaded node.
Static algorithms do not collect any information and
make choices based on probability, while dynamic
algorithms collect different degree and varying
amounts of state information to carry out their
decisions. The most important parameter of the
system was configured out to be the cost of
transferring a job of load from one node to another.
This cost limits the dynamic algorithms, but
thereby taking complexity into consideration are
the dynamic algorithms which do collect varying
and different amounts of information. Potentially
the more information an algorithm can collect the
better it becomes in decision making. The problem
with the complicated load balancing algorithms is
that they cannot keep up the pace with the quickly
changing state information of the system.
2. RELATED WORK
Parveen Jain and Daya Gupta. In this paper the
author focussed first on using the distributed system
.Then, he concentrated what role does distributed
system has in realizes load balancing. The author
showed that static load balancing doesn’t prove to
be useful in handling the, load balancing strategy in
case of distributed system. Hence, he urged need of
using dynamic load balancing technique in
371
Proceedings of 2015 Global Conference on Communication Technologies(GCCT 2015)
distributed computing environment since it adheres
to the dynamic needs of the system. A sender
initiated or receiver initiated approaches are there to
find the desired load for transferring the load. He
gave the concept of primary and secondary nodes
[1]. As the name recommended primary nodes
carry the basic task for transferring the load while
the secondary nodes are required in case of
handling the overload conditions.
Revathy R et.al. Has focussed on the needs of
storing the files in the cloud by allocating each
node to the files to store. The main focus is to serve
the storage and computing functions. We partition
the files into different modules and store in
different nodes[2]. Then the author planned the
load rebalancing algorithm in which he divide the
nodes into two parts heavily and lightly nodes. As
the name suggest intense node are nodes having
load greater than confident threshold value as
defined by the system whereas lighter nodes are the
nodes having load value less than the threshold
value. Without any prior knowledge of the global
allocation, the aim is to remove the load from
heavily loaded into lighter, loaded system and this
process is repeated until all heavily nodes become
light nodes.
Nidhi Kataria Chawla . Has given attention of
implementing load balancing in parallel and
distributed computing environment. It considers
load distribution at the run time[3]. The current
load information is distributed at runtime. The
master assigns a new load to the slaves only after
considering the current information collected.
Dynamic load balancing completes the job while
they are in execution. It continuously monitors the
loads of the process and any imbalance in load
reaches some predefined level, then only
redistribution of the work takes place. The fuzzy
logic has been implemented in reaching the load
balance with the help of fuzzy logic controller. It
makes certain predefined values and then based on
those predefined values the load balancing
procedure is carried out.
Abhijit A. Rajguru and S.S. Apte . Has discussed
a comparative analysis of various techniques taking
into account their pros and corns have been taken
into consideration.[4] The author proposes that each
processor does the work exactly allocated to him.
The author talks about round robin, central
algorithm and threshold algorithm. Dynamic load
balancing can be done in two different ways –
distributed and no distributed. In distributed, the
dynamic load balancing is done by all nodes
present in the computing environment and task of
load balancing is collective among them.
Distributed environment generally generates more
messages than no distributed environment because
each node in the system needs to communicate with
them. The advantage of using the distributed one is
that even if one of the nodes fails, it will not cause
the total process to stop. In case of no distributed,
either one node or group of nodes do not take part
978-1-4799-8553-1/15/$31.00 © 2015 IEEE
in it. The authors takes into consideration various
qualitative parameters such as nature of behaviour
of load balancing, rejection of overload load
handling, reliability of algorithm, adaptability of
the algorithm to various changing situations and
stability in terms of delays of transfer of
information. Response time, waiting time,
turnaround time and execution time are also taken
into consideration. This paper successfully
classified various classification algorithms.
Prof. Pranalini S. Ketkar and Ankita Bhimrao
Patkure . An author focuses on implementing the
file system in cloud environment. Map Reduce
function is used for processing big scale datasets.
Map function generates key value pairs and Reduce
function merges all intermediate key values with
same intermediate key.[5] The optimized cloud
partitioning a technique divide the cloud into a
number of nodes based on cloud cluster technique.
Files are divided into portion and allocated to the
server. The storage network is based on distributed
hash table (DHT) each chunk having rapid key
lookups, a unique identifier is assigned to each
chunk. In load rebalancing, loads are classified as
heavy and light node. All heavy nodes share their
load with light node. Node equalization is to reduce
latency, overloading and resource utilization. The
balancing task is performed without the prior global
knowledge.
Zubair khan et.al. Has discussed different
algorithms to deal with the load balancing
conditions of parallel and distributed computers. It
describes the static, dynamic and hybrid load
balancing techniques. In dynamic load balancing, it
begins with the initiation which specifies the
system which starts the load balancing behaviour
and load balancer location. The information
exchange deals with the load flow through the
network and finally the load selection in which
from which node load has to be exchanged is
decided. It discusses the Rake algorithm in which
firstly, the average load is broadcasted. Each
processor sends it to its right neighbour the data
over average workload. During extra workloads,
each processor sends to its right average workload.
Valeria Cardellini et.al. [6] has focussed on the
issue of balancing the load in case of web Servers.
It tries to spread the incoming request from web
servers to multiple clients. The nodes may be
geographically distributed. There are two
mechanisms for distributing the request to replicate
the content tree on the local disk or by sharing the
information by using a distributed file system. The
concept of magic router uses a fast mechanism for
fast packet interposing. In order to balance the
nodes in the web servers, round robin, random and
incremental load have been proposed as per TCP
load adjustment [9]. The other is the Local Director
writes the IP information of each client server
packet as per the dynamic mapping table of
connections between each session and server where
it has been redirected.
372
Proceedings of 2015 Global Conference on Communication Technologies(GCCT 2015)
3. LOAD BALANCER STRATEGIES
Various different methods and algorithms have
been stated, implemented and differentiated in a
number of studies [8, 9]. Generally, load balancing
is a kind of optimization the scheduling problem.
The load balancing strategy can be generally find
out by inspection, such as with a lattice of
rectangular of grid points divided into smaller
rectangles, so that the problem of load balancing is
solved before the program is defined and written.
Depending on the kind of knowledge used in
manufacturing load balancing choice, it can be
classified into two broad categories global or local
strategy [8]. In global policies, the load balancer
tries to use the performance data of all the available
Workstations whereas in local strategy workstations
are differentiated into different classes. The
advantage in a local scheme is that performance
profile information is only shared only with the
local group. The choice of a global or local strategy
is completely dependent on the activities what an
application will demonstrate. Focussing on the time
to hold together the tasks for processing elements,
load balancing algorithms can be further classified
as static or dynamic. The nontrivial static load
balancing techniques distributes the task to
processing nodes throughout the compile time,
while dynamic algorithms hold together tasks of
processing elements at the run time. Static load
balancing algorithms depends on the assessment of
the estimating execution times of the tasks and
introduce communication requirements. It is not
attractive for parallel programs that are of the
dynamic nature and/or unpredictable and different
type therefore in dynamic load balancing, tasks are
generated and killed without any pattern at run time
[3]. Further, focussing on the location where the
load balancing decision is to be approved out i.e.
the inhabitant of the load balancer, these can be
even further divided either as centralized and
distributed load balancing. The case where the load
balancer resides at the centralized node is called
centralized load balancing strategy; otherwise if it
resides at every workstation which is under
consideration is called the distributed load
balancing strategy[7]. In case of, quasi dynamic,
the reasons determining the optimal balance tend to
change during program runtime, but disjointedly
and less regularly. Because the change is discrete,
hence the problems of load balance and hence its
solution remains the constant till the next change. If
any of the changes are not frequent enough, any
savings made in the successive calculation saves
the time spent trying to solving the load balancing
problem. The difference between static and this
case is that the load balancing has to be carried out
in concurrent to prevent a subsequent blockage.
A. Dynamic Load balancing Techniques:
The equations and the circumstances determining
the perfect balance modify frequently or constantly
978-1-4799-8553-1/15/$31.00 © 2015 IEEE
during execution, so that the cost of the load
balancing computation after each consecutive
change should be less in addition to trying to
optimize the splitting of the real calculation. This
implies that there should be a decision made every
now and often to make a decision whether load
balancing should be done, and how much time
should we waste on it. Dynamic policies, on the
other side, rely on current state of system
information and determine the task to processors
during run time. Hence, they are more helpful
considering the performance point of view. In the
dynamic approach, the load balancing decisions are
based on the present state of the system; loads are
certified to transfer dynamically from an
overloaded node to an under loaded node to receive
earlier service. This skill to give response to
changes in the system is the main plus point of the
dynamic approach for the load balancing. It
consists of four components, a Load Measurement
rule, an Information Exchange rule, an Initiation
rule and also a Load Balancing Operation.
B. Policies in Load balancing Algorithms
Load balancing algorithms can be describe by
implementation of the following policies
Information strategy which specify what workload
information is to be composed and when it has to
be collected and from where, Triggering strategy
which determine the suitable period to begin a load
balancing method. Then the Resource type strategy
which classifies a resource to be a server or receiver
of tasks according to the availability of status.
Location strategy which uses the output of the
resource type strategy to find a suitable partner for
a server or a receiver, Selection strategy which
defines the tasks that should be migrated from
overloaded resources to the idle resources.
C. Issues in Performance Evaluation
The main objective of load balancing methods is to
speed up the execution time of applications on
resources whose workload varies at run time in
random way. Hence, it is significant to define
metrics to measure the resource workload:
(i) How we should measure resource workload?
(ii) What criteria are there to define this workload?
(iii) How to avoid the harming effects of resources
dynamicity towards the workload,
(iv) How we should think the resources
heterogeneity in order to get an immediate average
workload representative of the system?
4. COMPARATIVE ANALYSIS OF
VARIOUS DYNAMIC LOAD
BALANCING TECHNIQUES
This section we will be presenting characteristic
analysis of many types of dynamic load balancing
techniques base on the location of decision making,
373
Proceedings of 2015 Global Conference on Communication Technologies(GCCT 2015)
the information used for the decision making
process[5], scalability factor, and the overhead of
switching the profile information.
A. Centralized Dynamic Load Balancing
Techniques: This technique presents the
responsibility of the Load balancing choice which
remains with the master node and the information
required for the load balancing is gather from the
other (slave’s) nodes on either on demand basis or
after a sure calculated amount of fixed time
interval, or even the information may be gather
only when any change occurs in their working
stage. The obvious point is since the information is
not send on different; the not required traffic over
the interconnection network gets less. In addition,
no unnecessary profile information is exchange
overhead is done. But, the scalability seems to be
constant and limited with this technique.
B. Distributed Non cooperative Dynamic
Load Balancing Techniques : In distributed non
cooperative dynamic scheduling techniques the
accountability of the load balancing techniques
distributed over all the working different nodes that
is, workstations in place of the master node. The
work load information is composed based on the on
demand basis that is, whenever any node tries to
changes its current balanced working state to
overloaded state, the specific node distribute the
load information to rearrange to load to be balanced
or alike[3]. This technique provides little scalability
as compared to the centralized scheme. But since
the load information has to be distributed over
several working nodes before rescheduling the
current overload, this may increate the traffic in
interconnection network in addition to the small
information exchange overhead.
C. Distributed Cooperative Optimal Dynamic
Load Balancing Techniques: In distributed
cooperative optimal dynamic load balancing
techniques, different to distributed no cooperative
dynamic scheduling techniques the decision of load
balancing decision is disseminated over all the
workstations in its place of master node[6]. Further,
in this case also load balancing information strategy
is dependent on demand unlike the case of no
cooperative dynamic scheduling techniques with
the exception of having average overhead during
exchange of information of the profile. This
technique does provide efficient scalability.
978-1-4799-8553-1/15/$31.00 © 2015 IEEE
D. Distributed Cooperative Semi optimal
Heuristic Dynamic Load Balancing Techniques:
Unlike the previous two techniques, in distributed
helpful semi optimal heuristic dynamic load
balancing technique the accountability load
balancing decision is assigned over all the
workstations together with demand driven
information strategy and average profile
information exchange transparency and moderate
scalability.
E. Distributed Cooperative Semi optimal
Approximation Dynamic Load Balancing
Techniques :In this techniques too, the load
balancing accountability, information strategy and
scalability remains same unlike in the case of
distributed cooperative semi optimal heuristic
dynamic load balancing techniques i.e. to
workstations, demand driven and moderate
scalability in that order with the exception of
uncontrollable much more profile information
exchange overhead increasing the traffic over the
interconnection networks[4].
a) Performance Analysis
Here simply sender started algorithms are
supposed. In this analysis, each virtual organization
has its own load information on virtual organization
queue, or its personal domain, which consists of
itself and its adjacent [1] load information. If the
load of a virtual organization load goes beyond the
limit then load balancing technique are used, firstly
compute the average load in virtual organization
domain, Select the load balancing algorithm
because it signifies a typical class of decentralized
approach and allow relationship to our work [1].
The definition of adjacent based load balancing
approach is very similar to neighbour based load
balancing.
Now the CPU time T is calculated T=(IC*CPI)/f
And the throughput is calculated by W=f/IC*CPI
b) Simulation Model
TABLE 1. TU mean time unit and PT means percentage.
Simulation model Value Value
Size of system, n 20
The number of identified virtual 10
organizations, m
The difference of average processing power 5 percentage
among identified virtual organizations, Df
Mean calculating time of system jobs, X 2.0 time unit
The computation to communication ratio, {0.1, 0.2, 0.5, 1, 2,
CCR 3, 4}
Mean reassign delay, 0.05 time unit
Standard deviation of reassign delay, 25 percentage
Distance coefficient to from a virtual 1.5
organization to its nearest
virtual organization,
374
Proceedings of 2015 Global Conference on Communication Technologies(GCCT 2015)
Period for periodic information exchange, Tp
Number of associates, k
Number of random associates/adjacent for
information update,
TABLE 2. RESULT
ART 1 2 3 4 5 6 7 8
LD .1 .23 .25 .27 .29 .34 .5
RESULT LOAD VERSES RESPONSE TIME
5. CONCLUSION
This paper is primarily based on focussing the load
balancing techniques provided till now. Load balancing
has been the most important parameter in determining the
routing of data from nodes therefore; it tries to give a
secure channel for maintaining trust. it analyzes the
different solution given by different researchers across
the globe and tries to gives the pros and corns of each
approach[6] . It compares each researchers work and tries
to give the best out of it .However; the approaches have
been able to give static and dynamic solution to the
problem. This paper will help to analyze the different
approaches suggested and take the best out of it. it gives
an idea of how to build up and look forward to load
balancing techniques .considering the fact the load
balancing has, there is still need for certain automation
when we take into consideration routing and other
factors.
978-1-4799-8553-1/15/$31.00 © 2015 IEEE
View publication stats
10 time unit
6
2
Load balancing has immense and wide scope. Other
researches can be carried out in this field. Fuzzy logic
seems to have a great potential in this field and further
research can be carried out in this area.
9 10
.56 .6 .68
REFERENCES
[1] Parveen Jain, Daya Gupta, “An Algorithm for Dynamic
Load Balancing in Distributed Systems with Multiple
Supporting Nodes by Exploiting the Interrupt Service”,
International Journal of Recent Trends in Engineering, Vol
1, No. 1, May 2009.
[2] Revathy R , A.Illayarajaa,” Efficient Load Re Balancing
Algorithm for Distributed File Systems”, International
Journal of Innovative Technology and Exploring
Engineering (IJITEE) ISSN: 2278-3075, Volume-2, Issue-6,
May 2013.
[3] Nidhi Kataria Chawla, “A New Fuzzy Algorithm for
Dynamic Load Balancing In Distributed Environment”,
Asian Journal of Technology & Management Research
[ISSN: 2249 –0892] Vol. 04 – Issue: 01 (Jan - Jun 2014).
[4] Abhijit A. Rajguru, S.S. Apte, “ A Comparative
Performance Analysis of Load Balancing Algorithms in
Distributed System using Qualitative Parameters”,
International Journal of Recent Technology and Engineering
(IJRTE) ISSN: 2277-3878, Volume-1, Issue-3, August 2012.
[5] Prof. Pranalini, S. Ketkar Ankita Bhimrao Patkure, “Survey
on Load Rebalancing for Distributed File System in Cloud”,
International Journal of Innovative Research in Advanced
Engineering (IJIRAE) Volume 1 Issue 2 (April 2014).
[6] Zubair Khan, Ravendra Singh, Jahangir Alam, Shailesh
Saxena,” Classification of Load Balancing Conditions for
parallel and distributed systems”, IJCSI International
Journal of Computer Science Issues, Vol. 8, Issue 5,No 1,
September 2011 ISSN (Online): 1694-0814.
[7] Mohd Haroon Ashwani Singh, Mohd Arif, “Routing
Misbehabiour In Mobile Ad Hoc Network”, IJEMR, Volume
4, Issue 5 ,October 2014.
[8] ShwetaRajrani, RenuBagoria, “A SemiDistributed Load
balancing Algorithm using Clustered Approach”,
International Journal of Computer Science and Mobile
Computing, Vol.3, June2014, pg.843-851.
[9] Mohammad Haroon, Mohammad Husain,” Different
Policies For Dynamic Load Balancing”, International
Journal of Engineering Research And Technology, Volume
1, issue 10, 2012.
[10] S Mukherjee, R. Khan,” Overview of secured web services
specifications”, Information & Communication
Technologies (ICT), 2013 IEEE Conference on 11-12 April
2013.
375