Efficient Load Re Balancing Algorithm for Distributed File Systems
Revathy R1, A.Illayarajaa2

1Ms. Revathy R, Department of Computer Science and Engineering,  Annai Mathammal Sheela Engineering College, Namakkal (Tamil Nadu), India.
2A. Ilayarajaa, Assistant Professor, Department of Computer Science and Engineering, Annai Mathammal Sheela Engineering College, Namakkal (Tamil Nadu), India.
Manuscript received on 10 May 2013 | Revised Manuscript received on 18 May 2013 | Manuscript Published on 30 May 2013 | PP: 135-138 | Volume-2 Issue-6, May 2013 | Retrieval Number: F0818052613/13©BEIESP
Open Access | Editorial and Publishing 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 (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: This system presents an innovative idea in cloud computing. In a giant cloud we are able to add thousands of nodes together. The main aim is to allot files to those nodes while not creating significant load to any of the nodes, for that files square measure partitioned off into completely different modules. Another objective is to cut back the network inconsistencies and network traffic attributable to the unbalancing of hundreds. The reduction of network inconsistency can result in maximization of network information measure in order that {so many|numerous|such a big amount of, such a giant amount of, such a lot of} large applications will run in it. Because of quantifiability property we are able to add, delete, update new nodes in order that it supports heterogeneousness of the system. To enhance the potential of nodes we tend to use Distributed file system in Cloud Computing Applications.
Keywords: Cloud Computing, Distributed Hash Tables, Load Rebalancing.

Scope of the Article: Web Algorithms