By Topic

Novel algorithms for load balancing using hybrid approach in distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mayuri A. Mehta ; Department of Computer Engineering, Sarvajanik College of Engg. and Tech., Surat, India ; Sumegha Agrawal ; Devesh C. Jinwala

With ever increasing network traffic, dynamic load balancing can achieve improved performance in a typical distributed system to cope with the fluctuating workload. The hybrid dynamic load balancing algorithm stays away from the drawbacks of centralized and decentralized load balancing approaches. In this paper, first we address the two imperative design issues that are crucial to the hybrid algorithm viz. division of distributed nodes into virtual groups (clusters) and cluster head (supernode) selection in each group. We propose a new strategy for clustering of nodes based on the theory of integer partition. We deal with supernode selection in each group by proposing two novel algorithms that describe the tradeoff between message complexity and performance. Subsequently, we evaluate the performance of the hybrid algorithm in heterogeneous distributed system. We observe that our hybrid algorithm potentially outperforms the classical decentralized load balancing algorithm.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2012 2nd IEEE International Conference on

Date of Conference:

6-8 Dec. 2012