CLOUD COMPUTING Mr.R.Suresh and 2 Mr.C.Ramkumar 12 PG Student 1 Email.id: suresh91.r49@gmail.com, 2 rockfortramu005@gmail.

com Phone no: 95663 95341, 80563 70166 Department of MCA SNS College of Engineering
1

Abstract
Cloud computing is a term, which involves virtualization, distributed computing, networking, software and web services. A cloud consists of several elements such as clients, datacenter and distributed servers. It includes fault tolerance, high availability, scalability, flexibility, reduced overhead for users, reduced cost of ownership, on demand services etc. Central to these issues lies the establishment of an effective load balancing algorithm. The load can be CPU load, memory capacity, delay or network load. Load balancing is the process of distributing the load among various nodes of a distributed system to improve both resource utilization and job response time while also avoiding a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. Load balancing ensures that all the processor in the system or every node in the network does approximately the equal amount of work at any instant of time. This technique can be sender initiated, receiver initiated or symmetric type (combination of sender initiated and receiver initiated types).Our objective is to develop an effective load balancing algorithm using Divisible load

scheduling theorm to maximize or minimize different performance parameters (throughput, latency for example) for the clouds of different sizes

Introduction
Cloud computing is an on demand service in which shared resources, information, software and other devices are provided according to the clients requirement at specific time. Its a term which is generally used in case of Internet. The whole Internet can be viewed as a cloud. Capital and operational costs can be cut using cloud computing.

Figure 1: A cloud is used in network diagrams to depict the Internet. Load balancing in cloud computing systems is really a challenge now. Always a distributed solution is required. Because it is not always practically feasible or cost efficient to maintain one

or more idle services just as to fulfill the required demands. Jobs cant be assigned to appropriate servers and clients individually for efficient load balancing as cloud is a very complex structure and components are present throughout a wide spread area. Here some uncertainty is attached while jobs are assigned.

Objectives
1. To study the performance of some of the existing load balancing algorithms 2. To design and develop the concept of load balancing using Divisible Load Scheduling Theory (DLT) for the clouds of different sizes 3. To evalute the performance of the proposed scheme using analytical studies proposed in and using MATLAB

Datacenter Datacenter is nothing but a collection of servers hosting different applications. A end user connects to the datacenter to subscribe different applications. A datacenter may exist at a large distance from the clients. Now-a-days a concept called virtualisation is used to install a software that allow multiple instances of virtual server applications. 2.2.3 Distributed Servers Distributed servers are the parts of a cloud which are present throughout the Internet hosting different applications. But while using the application from the cloud, the user will feel that he is using this application from its own machine

Type of Clouds
Based on the domain or environment in which clouds are used, clouds can be divided into 3 catagories : _ Public Clouds _ Private Clouds _ Hybrid Clouds Clients End users interact with the clients to manage information related to the cloud. Clients generally fall into three categories as given in Mobile: Windows Mobile Smartphone, smartphones, like a Blackberry, or an iPhone. Thin: They dont do any computation work. They only dispaly the information.Servers do all the works for them. Thin clients dont have any internal memory. Thick: These use different browsers like IE or mozilla Firefox or Google Chrome to connect to the Internet cloud. Now-a-days thin clients are more popular as compared to other clients because of their low price, security, low consuption of power, less noise, easily replaceble and repairable etc.

Virtualization
It is a very usefull concept in context of cloud systems. Virtualisation means something which isnt real, but gives all the facilities of a real. It is the software implementation of a computer which will execute different programs like a real machine. Virtualisation is related to cloud, because using virtualisation an end user can use different services of a cloud. The remote datacenter will provide different services in a fully or partial virtualised manner. 2 types of virtualization are found in case of clouds as given in _ Full virtualization _ Paravirtualization

Services provided computing

by

Cloud

Service means different types of applications provided by different servers across the cloud. It is generally given as as a service. Services in a cloud are of 3 types as given in _ Software as a Service (SaaS) _ Platform as a Service (PaaS)

_ Hardware as a Service (HaaS) or Infrastructure as a Service (IaaS) Load Balancing Introduction It is a process of reassigning the total load to the individual nodes of the collective system to make resource utilization effective and to improve the response time of the job, simultaneously removing a condition in which some of the nodes are over loaded while some others are under loaded. A load balancing algorithm which is dynamic in nature does not consider the previous state or behavior of the system, that is, it depends on the present behavior of the system. The important things to consider while developing such algorithm are estimation of load, comparison of load, stability of different system, erformance of system, interaction between the nodes, nature of work to be transferred, selecting of nodes and many other ones . This load considered can be in terms of CPU load, amount of memory used, delay or Network load. Goals of Load balancing As given in the goals of load balancing are : _ To improve the performance substantially _ To have a backup plan in case the system fails even partially _ To maintain the system stability _ To accommodate future modification in the system Types of Load balancing algorithms Depending on who initiated the process, load balancing algorithms can be of three catagories as given in _ Sender Initiated: If the load balancing algorithm is initialised by the sender _ Receiver Initiated: If the load balancing algorithm is initiated by the receiver Dynamic Load balancing algorithm

In a distributed system, dynamic load balancing can be done in two different ways: distributed and non-distributed. In the distributed one, the dynamic load balancing algorithm is executed by all nodes present in the system and the task of load balancing is shared among them. The interaction among nodes to achieve load balancing can take two forms: cooperative and noncooperative . In the first one, the nodes work side-by-side to achieve a common objective, for example, to improve the overall response time, etc. In the second form, each node works independently toward a goal local to it, for example, to improve the response time of a local task. Dynamic load balancing algorithms of distributed nature,usually generate more messages than the non-distributed ones because, each of the nodes in the system needs to interact with every other node. A benefit, of this is that even if one or more nodes in the system fail, it will not cause the total load balancing process to halt, it instead would effect the system performance to some extentcan introduce immense stress on a system in which each node needs to interchange.

Policies or Strategies in dynamic load balancing

There are 4 policies: _ Transfer Policy: The part of the dynamic load balancing algorithm which selects a job for transferring from a local node to a remote node is reffered to as Transfer policy or Transfer strategy. _ Selection Policy: It specifies the processors involved in the load exchange (processor matching) _ Location Policy: The part of the load balancing algorithm which selects a destination node for a transferred task is reffered to as location policy or Location strategy.

_ Information Policy: The part of the dynamic load balancing algorithm responsible for collecting information about the nodes in the system is reffered to as Information policy or Information strategy.

link and measurement speed was studied. A comparison is also made between different strategies.

REFERENCES:
1.Bunya, Rajkumar; Chee Shin Yeo, Srikumar Venugopal (PDF). MarketOriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities. Department of Computer Science and Software Engineering, The University of Melbourne, Australia. pp.9. http://www.gridbus.org/~raj/papers/h pcc2008_keynote_cloudcomputing.p df. Retrieved 2008-07-31. 2.The Top Cloud Computing Solutions people are looking for in 2009 Survey by onCloudComputing.com 2009-0706. Retrieved 2009-09-11.Johnston, Sam; Urquhart, James; Wellner, Rich (2008-09-16). "Cloud Computing:Bill of rights". http://wiki.cloudcommunity.org/wiki /CloudComputing:Bill_of_Rights. Retrieved 2008-09-16. 3.http://aws.typepad.com/aws/2008/0 6/the-forthcoming.html 4.Jones, M. Tim, Cloud Computing with Linux from IBM DeveloperWorks (2008-09-10).

Future Work
Cloud Computing is a vast concept and load balancing plays a very important role in case of Clouds. There is a huge scope of improvement in this area. We have discussed only two divisible load scheduling algorithms that can be applied to clouds, but there are still other approaches that can be applied to balance the load in clouds. The performance of the given algorithms can also be increased by varying different parameters.

Conclusion
Till now we have discussed on basic concepts of Cloud Computing and Load balancing and studied some existing load balancing algorithms, which can be applied to clouds. In addition to that, the closed-form solutions for minimum measurement and reporting time for single level tree networks with different load balancing strategies were also studied. The performance of these strategies with respect to the timing and the effect of