Clustered Node Based Load Balancing In Distributed Environment

T Padmaja, N Suresh, R Lakshmi Tulasi

Abstract


Cloud computing having tremendous growth on recent years but it is not segregation on shared clouds.  Distributed file systems are key building blocks for cloud computing applications based on the Map Reduce programming paradigm. In such file systems, nodes simultaneously serve computing and storage functions; a file is partitioned into a number of chunks allocated in distinct nodes so that Map Reduce tasks can be performed in parallel over the nodes. Data storage and communication which are to be done in huge amount, in such cases clouds are most provably used. "The cloud", also focuses on increasing the effectiveness of the public resources. Cloud resources are usually not only shared by multiple users but are also vigorously reallocated per demand. This can work for apportioning resources to users .But In the time of apportionment  these are indeed .So In this paper we are introducing novel mechanism. We investigate to implement security provided for cloud computing and Evaluate the Quality of Service-QOS (Ex. Response Time) of whole system. In cloud computing one server controls number of sub servers, files, it can add, delete, and append dynamically  Freight stabilization in the cloud computing surroundings has an imperative impact on the performance. Excellent freight stabilizing makes cloud computing more efficient and improves user satisfaction. In this paper we are presenting freight stabilizing techniques for cloud segregating.


Keywords


Freight Stabilizing, Cloud Segregating, Freight Stabilizing Models, Shared Cloud.

References


Heiser J. What you need to know about cloud computing security and compliance, Gartner, Research, ID Number: G00168345, 2009.

Seccombe A.., Hutton A, Meisel A, Windel A, Mohammed A, Licciardi A, (2009). Security guidance for critical areas of focus in cloud computing, v2.1. Cloud Security Alliance, 25 p.

Mell P, Grance T (2011) The NIST definition of Cloud Computing. NIST, Special Publication 800–145, Gaithersburg, MD.

J. Dean and S. Ghemawat, “MapReduce: Simplified Data Processing on Large Clusters,” in Proc. 6th Symp,Operating System Design and Implementation (OSDI‟04), Dec. 2004, pp. 137–150

J. Byers, J. Considine, and M. Mitzenmacher, Simple load balancing for distributed hash tables, in Proceedings of IPTPS, Berkeley, CA, Feb. 2003.

Hadoop Distributed File System, http://hadoop.apache.org/hdfs/.

Hadoop Distributed File System “Rebalancing Blocks,” ,”http://developer.yahoo.com/hadoop/tutorial/module2.html#r ebalancing, 2012.

Ram Prasad Padhy (107CS046), PGoutam Prasad Rao (107CS039).”Load balancing in cloud computing system” Department of Computer Science and Engineering National Institute of Technology, Rourkela Rourkela-769 008, Orissa, India May, 2011.

M. Randles, D. Lamb, and A. Taleb-Bendiab, ―A Comparative Study into Distributed Load Balancing Algorithms for Cloud Computing‖, Proceedings of 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, Perth, Australia, April 2010, pages 551-556.

S.Penmatsa and T.Chronopoulos, Game-theoretic static load balancing for distributed systems, Journal of Parallel and Distributed Computing, vol.71, no.4, pp.537-555, Apr. 2011.

A.Rao, K.Lakshmi narayanan, S.Surana, R.Karp and I.Stoica, Load Balancing in Structured P2P Systems‖, Proc. Second Int„l Workshop Peer-to-Peer Systems (IPTPS „02), pp. 68-79, Feb. 2003.

S.Surana, B.Godfrey, K.Lakshminarayanan, R.Karp and I.Stoica,―Load Balancing in Dynamic Structured P2P Systems,‖ Performance Evaluation,vol.63, no. 6, pp. 217-240, Mar. 2006.

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari Balakrishnan. ―Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.‖ in Pmc. ACM SIGCOMM. San Diego, 2001, pp. 149-160.

John Byers, Jeffrey Considine, and Michael Mituenmacher, ―Simple Load Balancing for Distributed Hash Tables.in Pmc.IPTfS, Feb. 2003.

J. R. Douceur and R. P. Watlenhofer, “Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System,‖ in Pmc. DISC,2001.

R.L. Rivest, A. Shamir, and L. Adleman. “A Method for Obtaining Digital Signatures and Public key Cryptosystems”, Communications of the ACM, 21(2), 120-126, February 1978.

RSA Laboratories, High Speed RSA Implementation, RSA Data Security, November 1994.


Full Text: PDF[FULL TEXT]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.