SIMPLE EFFICIENT SEMI DISTRIBUTED APPROACH TO LOAD BALANCING IN DISTRIBUTED SYSTEMS

Abstract

With the increase in the number of concurrent users on the Internet, the load balancing problem in distributed systems is becoming more significant. There have been numerous number of strategies proposed till far for getting load balanced among each node of a system to avoid the situation when a node is overloaded, the other is sitting idle. To the best of my knowledge, almost all strategies take the support of broadcasting of load information and a lot of task transfer if a task reaches a heavily loaded server, or in some cases, a node which is just heavier than the other node. Broadcasting of load information increases significant traffic congestion on the network and also makes the load information stale. And task transfer sometimes takes time more than the service time of a task. This dissertation gives a load balancing strategy named SeizeToken which eliminates any need of l:kad information. Also it tries to minimize the need of task transfer up to a large extent. The algorithm proposed is inspired by the Token ring algorithm in computer networks. Seize Token is compared with some existing load balancing strategies. The simulation results show that SeizeToken gets a much better response time than others..Also some variations of SeizeToken has been compared.