Paper Title
Distribution Of Work Load At Balancer Level Using Enhanced Round Robin Scheduling Algorithm In A Public Cloud

Cloud computing is a technology where one can avail various services like storage, software usage and also some other shared equipments based on requirement of the users on rental basis. Generally cloud computing can work with a normal system and the Internet only. The number of users who uses cloud technology was increasing day by day. The increase in the number of users results in high traffic and improper load balancing. To balance the load equally to all nodes, various static and dynamic algorithms have been proposed and these algorithms consider various parameters like performance, response time, fault tolerance, high availability, cost parameters, number of services, scalability, flexibility, reduced overhead for users, etc. Each algorithm has its advantages and disadvantages. Hence there is a need to do more research work in this area i.e. load balancing. In this paper, cloud architecture for distributing the load to various nodes by the balancers using Enhanced Round Robin scheduling algorithm is proposed. The work load is distributed to the various nodes by the balancers is done using two parameters: one is node status (idle, normal and overload) and time stamp (point of time at which node status changed). Based upon these two parameters all nodes are sorted and stored in a list. Using round robin scheduling algorithm the incoming jobs are allotted to nodes in the list.