Improved and Efficient Dynamic Load Balancing Algorithm in Cloud Based Distributed System
Manjula K.1, S. Meenakshi Sundaram2
1Manjula K, Research Scholar, Department of Computer Science and Engineering, DBIT Bengaluru, affiliated to VTU Belagavi (Karnataka) India.
2Dr. S. Meenakshi Sundaram, Professor and HOD, Department of CSE GSSSIETW Mysuru, affiliated to VTU Belagavi (Karnataka) India. 

Manuscript received on January 05, 2020. | Revised Manuscript received on January 25, 2020. | Manuscript published on January 30, 2020. | PP: 4812-4816 | Volume-8 Issue-5, January 2020. | Retrieval Number: E6889018520/2020©BEIESP | DOI: 10.35940/ijrte.E6889.018520

Open Access | Ethics and Policies | Cite  | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: The basic idea of building Distributed Systems (DS) is to replenish systematic way to access disseminated resources in a decisive way. As It ensures remote access to the resources, the vital part in distributed systems is to allow proper allocation of the resources. Efficient allocation of resources amongst the various Computing Nodes (CN) can happen with the help of various scheduling policies. The various scheduling policies that are being used for efficient load balancing are Round Robin, Throttled, equally spread Load Balancing Algorithms. These are the traditional algorithms which help in performing load balance amongst CN. In this research paper an Improved and Efficient Dynamic Load Balancing Algorithm is proposed which fairs comparatively well compared with the traditional existing approaches which come along with the Cloud Simulator. The simulation of the same is made using Cloud Simulator whose efficiency in terms of response time and cost is proved to be more than 5% when compared to the traditional approaches.
Keywords: Distibuted systems, Cloud Computing, Load Balancing, Cloud Sim.
Scope of the Article: Cloud Computing.