load rebalancing the distributed file on cloud

International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 4, April 2013)
International Journal of Emerging Technology and Advanced Engineering Paper
LOAD REBALANCING ALGORITHM FOR DISTRIBUTED FILE SYSTEM IN CLOUDS
Miss. Gayatri B. Pawar1, Mr. Abhijit Shinde2
1 Pune university, B.E. Computer Engineering Final year, Smt. Kashibai navale college of engineering, pune, India.
2 Pune university, B.E. Computer Engineering Final year, Smt. Kashibai navale college of engineering, pune, India.
Email Id – [e-mail], [e-mail]
Abstract -
The rapid growth of the World Wide Web has brought huge increase in traffic to popular web sites. As a consequence, end users often experience poor response time or denial of service. A cluster of multiple servers that behaves like a single host can be used to improve the throughput and alleviate the server bottlenecks. To achieve such a cluster, we need robust routing algorithms that provide scalability, effective load balancing and high availability in a constantly changing environment. Due to an ever-increasing diversity of workloads and cluster configurations, it is very difficult to propose a single algorithm that performs best under all conditions. In this paper, we review a number of proposed load balancing algorithms for clusters of web servers. We focus on an experimental analysis of the performance under a number of well-known load balancing algorithms. We study the performance of the algorithms through a simulation to evaluate their performance under different conditions and workloads. The results of our study are reported in the paper.
KEYWORDS – Load rebalance, Distributed file system, clouds, Hash table, Algorithms.

I INTRODUCTION Internet server programs supporting mission-critical applications such as Network Load Balancing servers (also called hosts) in a cluster

References: [2] L. M. Ni, C.-W. Xu, and T. B. Gendreau, “A Distributed Drafting Algorithm for Load Balancing,” IEEE Trans. Software Eng., vol. 11, no. 10, pp. 1153–1161, Oct. 1985. [3] S. Ghemawat, H. Gobioff, and S.-T. Leung, “The Google File System,” in Proc. 19th ACM Symp. Operating Systems Principles (SOSP’03), Oct. 2003, pp. 29–43. [6] P. Scheuermann, G. Weikum, and P. Zabback, “Data Partitioning and Load Balancing in Parallel Disk Systems,” in Proc. 7th Int’l Conf. Very Large Data Bases (VLDB’98), Feb. 1998, pp. 48–66. [7] S. A. Weil, S. A. Brandt, E. L. Miller, and C. Maltzahn, “CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data,” in ACM/IEEE Conf. High Performance Networking and Computing (SC’06), Nov. 2006. [8] F. B. Schmuck and R. L. Haskin, “GPFS: A Shared-Disk File System for Large Computing Clusters,” in Proc. USENIX Conf. File and Storage Technologies (FAST’02), Jan. 2002, pp. 231–244. [10] Y. Hua, Y. Zhu, H. Jiang, D. Feng, and L. Tian, “Supporting Scalable and Adaptive Metadata Management in Ultra Large-scale File Systems,” IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 4, pp. 580–593, Apr. 2011. [11] B. Welch, M. Unangst, Z. Abbasi, G. Gibson, B. Mueller, J. Small, J. Zelenka, and B. Zhou, “Scalable Performance of the Panasas Parallel File System,” in Proc. 6th USENIX Conf. File and Storage Technologies (FAST’08), Feb. 2008, pp. 17–33. [12] W. Ligon and R. B. Ross, Beowulf Cluster Computing with Linux. MIT Press, Nov. 2001, ch. PVFS: Parallel Virtual File System, pp. 391–430. [13] A. W. Leung, M. Shao, T. Bisson, S. Pasupathy, and E. L. Miller, “Spy-glass: Fast, Scalable Metadata Search for Large-Scale Storage Systems,” in Proc. 7th USENIX Conf. File and Storage Technologies (FAST’09), Feb. 2009, pp. 153–166. [14] B. Fan, H. Lim, D. Andersen, and M. Kaminsky, “Small Cache, Big Effect: Provable Load Balancing for Randomly Partitioned Cluster Services,” in Proc. 2nd ACM Symp. Cloud Computing (SOCC’11), Oct. 2011.