a secure high performing cloud using load rebalancing technique in distributed file system
ajith vishnu.p,george chellin chandran,usha ruby
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:2 Issue:3 Year: 08 April,2014 Pages:176-183
Abstract
Map Reduce programming paradigm plays a vital role in the development of cloud computing application using the Distributed file system where nodes concurrently provide computing as well as storage functions. Initially a file is partitioned into number of chunks allocated into different nodes so that Map Reduce technique can be performed in the nodes. Since cloud computing is a dynamic environment upgrading, replacing and adding new nodes to the environment is a frequent concern. This confidence is obviously insufficient in a large-scale, failure-prone atmosphere since the central load balancer is put under significant workload that is linearly scaled with the structure of the system range, and may lead to a performance bottleneck the single point of failure. To overcome the failure in this paper, a fully distributed load rebalancing algorithm is presented to handle the load imbalance problem. The proposed algorithm is compared alongside a centralized approach in a production system and a competing distributed way out is available on hand in the literature. The simulation results point towards our proposal when compared with the existing centralized approach significantly outperforms the former distributed algorithm in terms of load imbalance factor, movement cost, and algorithmic overhead.
Kewords
DHT, Centralized System, Load ImBalancing, Distributed System.
Reference
[1] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek,F. Dabek, and H. Balakrishnan, ―Chord: a Scalable Peer-to-Peer LookupProtocol for Internet Applications,‖IEEE/ACM Trans. Netw., vol. 11,no. 1, pp. 17–21, Feb. 2003. [2] A. Rowstron and P. Druschel, ―Pastry: Scalable, Distributed ObjectLocation and Routing for Large-Scale Peer-to-Peer Systems,‖ LNCS 2218, pp. 161–172, Nov. 2001. [3] G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman,A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, ―Dynamo:Amazon‘s Highly Available Key-value Store,‖ in Proc. 21st ACM Symp.Operating Systems Principles (SOSP’07), Oct. 2007, pp. 205–220. [4] A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, ―LoadBalancing in Structured P2P Systems,‖ in Proc. 2nd Int’l Workshop Peerto- Peer Systems (IPTPS’02), Feb. 2003, pp. 68–79. [5] D. Karger and M. Ruhl, ―Simple Efficient Load Balancing Algorithms forPeer-to-Peer Systems,‖ in Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA’04), June 2004, pp. 36–43. [6] D. DeWitt, R. H. Gerber, G. Graefe, M. L. Heytens, K. B. Kumar,and M. Muralikrishna. Gamma -a high performance dataflow database. In Proc. VLDB, 1986. [7] D. DeWitt and J. Gray. Parallel database systems: The future of highperformance database processing. Communications of the ACM,36(6), 1992. [8] H. Feelifl, M. Kitsuregawa, and B. C. Ooi. A fast convergencetechnique for online heat-balancing of btree indexed database overshared-nothing parallel systems. In Proc. DEXA, 2000. [9] P. Ganesan, M. Bawa, and H. Garcia-Molina.Online balancing ofrange-partitioned data with applications to p2p systems.Technical Report http://dbpubs.stanford.edu/pubs/2004-18, Stanford U., 2004. [10] P. Ganesan, B. Yang, and H. Garcia-Molina. One torus to rule themall: Multi-dimensional queries in p2p systems. In WebDB, 2004. [11] S. Ghandeharizadeh and D. J. DeWitt.A performance analysis of alternativemulti-attribute declustering strategies. In Proc. SIGMOD, 1992. [12] N. J. A. Harvey, M. Jones, S. Saroiu, M. Theimer, and A. Wolman.Skipnet: A scalable overlay network with practical locality properties. In Proc. USITS, 2003. [13] D. R. Karger and M. Ruhl. Simple efficient load-balancing algorithmsfor peer-to-peer systems.In Proc. IPTPS, 2004
