IJRIT International Journal of Research in Information Technology, Volume 2, Issue 10, October 2014, Pg. 422-429

International Journal of Research in Information Technology (IJRIT)

www.ijrit.com

ISSN 2001-5569

Load Balancing for Distributed File Systems in Cloud Umamaheshwararao Ch

K.S. Kiran Kumar

M.Tech Research Scholar, Dept. of CSE Rao & Naidu Engineering College, Ongole, Andhra Pradesh, India. [email protected]

Asst. Professor, Dept. of CSE Rao & Naidu Engineering College, Ongole, Andhra Pradesh, India. [email protected]

Abstract: Load balancing in the cloud computing general condition has an important force of meeting blow on the operation good amount balancing makes cloud computing more good at producing an effect and gets better user pleasure. This thing gives name of person when meeting for first time a better amount balance design to be copied for the public cloud based on the cloud making into parts idea of a quality common to a group with an electric button mechanism to select different designs for different situations. The Algorithm puts to use the damaged and without full use theory to the amount balancing secret design to get better the doing work well in the public cloud general condition.

1. Introduction Cloud Computing is a pulling to self technology in the field of knowledge processing machine science. In Gartners go to person in authority it says that the cloud will take changes to the it industry. The cloud is changing our existence by making ready Users with new types of services Users get public organization from a cloud without giving money for attention to the details NIST gave a statements of cloud Computing as a design to be copied for making able everywhere right on request Network way in to a shared pool of configurable Computing resources e.g., Networks computers place for storing applications and services that can be rapidly provisioned and given with least managers of a business hard work or public organization giver effect on one another. More and more people undergo punishment attention to cloud Computing Cloud Computing is good at producing an effect and scalable but supporting the without change, unmoving of processing so many jobs in the cloud Computing general condition is a very complex hard question with amount balancing letting into one's house much attention for researchers. Since the mixed bag of goods getting in good example is not certain to take place and the amount of room of each network point in the cloud be different from for amount balancing hard question amount of work control is turning point to get better system operation and support without change, unmoving amount balancing designs depending on whether the system driving power are important can be either at rest and forcefull at rest designs do not use the system information and are less complex while forcefull designs will take added costs for the system but can change as the system position (in society) changes A forcefull design is used here for its able to make ready adjustments. The design to be copied has a main controller and balancers to get the idea and get at the details of the information. Thus the forcefull control has little effect on the other working network points The system position (in society) then provides a base for selecting the right amount balancing secret design. The amount balancing good example given in this thing is directed at the public cloud which has a great number of network points with made distribution Computing resources in many different geographic places. Thus this design to be copied makes a division the public cloud into several cloud makes division of when the general condition is very greatly sized and complex these divisions make simpler the amount balancing. The cloud has a main controller that Umamaheshwararao Ch, IJRIT

422

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 10, October 2014, Pg. 422-429

selects the right makes division of for getting to jobs while the balancer for each cloud division into parts selects the best amount balancing secret design.

2. Related Work There have been many studies of amount balancing for the cloud general condition amount balancing in cloud Computing was described in a white paper written by Adler who introduced the instruments and techniques commonly used for amount balancing in the cloud. However amount balancing in the cloud is still a new hard question that needs new buildings and structure design to adjust to many changes Chaczko et Al., described the undertakings that amount balancing plays in getting (making) better the doing a play and supporting without change, unmoving. There are many amount balancing Algorithms such as Round Robin equally put out on top Current wrongdoer put to death Algorithm and Ant colony Algorithm Nishant et Al used the ant colony optimization way in network points amount balancing Randles et Al gave a made a comparison analysis of some Algorithms in cloud Computing by check the operation time and price. They concluded that the ESCE Algorithm and throttled Algorithm are better than the Round Robin Algorithm. Some of the Greek and Latin amount balancing methods are similar to the thing or amount put to one side way in the operating system for example the Round Robin Algorithm and the First Come First put ball in play FCFS rules. The Round Robin Algorithm is used here because it is fairly simple.

3. System Model There is several cloud computinggroups with this work put at point at which rays come together on a public cloud. A public cloud is based on the quality example cloud Computing design to be copied with support on condition that by a public organization giver. A large public cloud will join many network points and the network points in different about geography places Cloud making into parts is used to manage this greatly sized cloud. A cloud division into parts is a subarea of the public cloud with divisions based on the geographic places. The buildings and structure design is given view in Fig 1. The amount balancing secret design is based on the cloud making into parts idea of a quality common to a group. After making come into existence the cloud makes division of the amount balancing then starts when a mixed bag of goods gets to at the system with the main controller coming to a decision which cloud division into parts should get the mixed bag of goods. The division into parts amount balancer then comes to a decision how to give to the jobs to the network points. When the amount position (in society) of a cloud division into parts is normal this making into parts can be done locally if the cloud divisioninto parts amount position is not normal this mixed bag of goods should be got moved from one position to another to another division into parts. The complete work process is made clear in Fig 2. 3 1 Main Controller and Balancers The amount balance answer is done by the main controller and the balancers. The main controller first gives to jobs to the right cloud division into parts and then gives

Umamaheshwararao Ch, IJRIT

423

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 10, October 2014, Pg. 422-429

news to with the balancers in each division into parts to refresh this position (in society) information. Since the main controller business agreements with information for each division into parts smaller data puts will lead to the higher processing rates. The balancers in each division into parts get the idea the position (in society) information from every network point and then select the right secret design to make distribution the jobs. The relation between the balancers and the main controller is given view in Fig 3. 3 2 Assigning jobs to the cloud partition When a mixed bag of goods gets to at the public cloud the first step is to select the right make division of the cloud division into parts position (in society) can be separated into three types 1 Idle: When the rate on a hundred of unworking network points goes over limits , change to unworking position (in society) 2 Normal: When the rate on a hundred of the normal network points goes over limits , change to normal amount position (in society) (3) Over-weight: When the rate on a hundred of the over-weighted network points goes over limits , change to over-weighted position (in society). The parameters , ,  and are put by the cloud division into parts balancers. The main controller has to exchange with the balancers frequently to refresh the position (in society) information. The main controller then sends the jobs using the supporter’s secret design: When mixed bag of goods i gets to at the system, the main controller questions the cloud division into parts where mixed bag of goods is placed. If this places position (in society) is unworking or normal, the mixed bag of goods is put one's hands on special to some place. If not, another cloud division into parts is discovered that is not overweighted. The Algorithm is made clear in Algorithm. 3.3 Assigning jobs to the nodes in the cloud partition Umamaheshwararao Ch, IJRIT

424

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 10, October 2014, Pg. 422-429

The cloud division into parts balancer gets together amount information from every network point to value the cloud division into parts position (in society). This put value of each network points amount position (in society) is very important. The first work is to make statement of the sense of words the amount degree of each network points. The network point amount degree is related to different at rest parameters and forcefull parameters. The at rest parameters join the number of CPUs , the CPU processing goes quickly, the memory size, and so onforcefull parameters are the memory use of relation, the CPU use of relation, the Network bandwidth , and so on. The amount degree is worked out from these parameters as under:

Step 1 Define a load parameter set: F = {F1, F2, Fm} with each Fi (1    , Fi ∈ [0, 1])parameter being either static or dynamic. m represents the total number of the parameters. Step 2 Compute the load degree as: Load_degree (N)=∑   iFi, i(∑  i= 1)are weights that may differ for different kinds of jobs.N represents the current node. Step 3 Define evaluation benchmarks. Calculate the average cloud partition degree from the node load degree statistics as: Load_degreeavg =

∑ 

 

Step 4 Three network points amount position (in society) levels are then formed as: • IdleWhen Load_degree(N) = 0, there is no job being processed by this node so the statusis charged to Idle. •

Normal For 0 < Load_Degree(N)  Load_Degreehigh,

the node is normal and it can process other jobs.

Umamaheshwararao Ch, IJRIT

425

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 10, October 2014, Pg. 422-429



Overloaded

When

Load_DegreehighLoad_degree(N), the node is not available and cannot receive jobs until it returns to the normal. The amount degree results are input into the amount position (in society) tables made come into existence by the cloud division into parts balancers. Each balancer has an amount position (in society). Table and refreshes it each fixed stage in history t . The table is then used by the balancers to work out the division into parts position (in society). Each division into parts position (in society) has a different amount balancing substance mixed in liquid. When a mixed bag of goods gets to at a cloud division into parts, the balancer gives to the mixed bag of goods to the network points based on its current amount secret design. This secret design is changed by the balancers as the cloud division into parts position (in society) changes.

4. Cloud Partition Load Balancing Strategy 4.1 Motivation Good amount balance will get better the operation of the complete cloud. However, there is no common way that can adjust to all possible different places, positions. Different methods have been undergone growth in getting (making) better having existence answers to get broken up new questions. Each one way has better chances in one area but not in all places, positions. as an outcome of that, the current design to be copied gets mixed together several methods and puts electric light on between the amount balance way based on the system position (in society). A relatively simple way can be used for the division into parts unworking state with a more complex way for the normal state. The amount balancers then electric button methods as the position (in society) changes. Here, the unworking position (in society) uses a got better Round Robin Algorithm while the normal position (in society) uses a damaged and without full use theory based amount balancing secret design. 4.2 Load balance strategy for the idle status When the cloud division into parts is un working, many Computing resources are ready (to be used) and relatively few jobs are getting to. In this place, position, this cloud division into parts has the power to process jobs as quickly as possible so a simple amount balancing way can be used. There are many simple amount balance Algorithm methods such as the random Algorithm, the Weight Round Robin, and the forcefull Round Robin. The Round Robin Algorithm is used here for its simpleness. The Round Robin Algorithm is one of the simplest amount balancing Algorithms, which passes each new request to the next server in the queue. The Algorithm does not record the position (in society) of each connection so it has no position (in society) information. In the regular Round Robin Algorithm, every network point has an equal chance to be selected, however, in a public cloud, the form of a thing and the doing a play of each network point will be not the same; in this way, this way may over-weight some network points. In this way, a got better Round Robin Algorithm is used, which called Round Robin based on the amount degree put value. The Algorithm is still fairly simple. Before the Round Robin step, the network points in the amount balancing table are ordered based on the amount degree from the lowest to the highest. The system puts up (a building) a going round in circles queue and walks through the queue many times. Regular works will then be given to network points Umamaheshwararao Ch, IJRIT

426

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 10, October 2014, Pg. 422-429

with low amount degrees. The network point order will be changed when the balancer refreshes the amount position (in society) Table. However, there may be read and write condition of change at the refresh stage in history t . When the balance table is refreshed, at this short time, if a mixed bag of goods gets to at the cloud division into parts, it will take the not in agreement hard question. The system position (in society) will have changed but the information will still be old. This may lead to a wrong amount secret design good quality and a wrong network points order. To get broken up this hard question, two amount position (in society) tables should be made come into existence as: amount position (in society) Table and amount position (in society) Table 2. A flag is also given to each table to giving an idea of read or write. When the flag = read, then the Round Robin based on the amount degree put value Algorithm is using this table. When the flag = write, the table is being refreshed, new information is written into this table. In this way, at each moment, one table gives the right network point places in the twisted hair hanging down back for the got better Round Robin Algorithm, while the other is being got ready with the changed knowledge information. Once the data is refreshed, the table flag is changed to read and the other table’s flag is changed to write. The two tables then do in turn to get answer to the condition of change. The process is made clear in Fig.4. 4.3 Load balancing strategy for the normal status When the cloud division into parts is normal, jobs are getting to much quicker than in the unworking stateand the place, position is far more complex, so a different secret design is used for the amount balancing. Each User wants his jobs completed in the shortest time, so the public cloud needs a way that can complete the jobs of all Users with good-sensed move time. Penmatsa and Chronopoulos made an offer an at rest amount balancing secret design based on damaged and without full use theory for made distribution systems. And this work provides us with a new paper of the amount balance hard question in the cloud general condition. As a putting into effect of made distribution system, the amount balancing in the cloud Computing 8 general condition can be viewed as a damaged and without full use. Damaged and without full use theory has non-cooperative games and cooperative playing activity. In cooperative playing activity, the decision makers eventually come to an agreement which is telephoned a necessary agreement. Each decision maker comes to a decision by making a comparison notes with each others. In non-cooperative playing activity, each decision maker makes decisions only for his own help. The system then reachs the Nash equilibrium , where each decision maker makes the optimized decision. The Nash equilibrium is when each player in the damaged and without full use has selected a secret design and no player can help by changing his or her secret design while the other players designs keep being unchanged. There have been many studies in using damaged and without full use theory for the amount balancing. Grosu et Al. made an offer an amount balancing secret design based on damaged and without full use theory for the made distribution systems as a non-cooperative damaged and without full use using the made distribution structure. They made a comparison this Algorithm with other old and wise methods to make clear to that their Algorithm was less being complex with better doing a play. Aote and Kharat gave a forcefull amount balancing scaled-copy based on damaged and without full use theory. This design to be copied is related on the forcefull amount position (in society) of the system with the Users being the decision makers in a non-cooperative damaged and without full use. Since the network Computing and cloud Computing conditions are also made distribution system, these Algorithms can also be used in network Computing and cloud Computing conditions. earlier studies have given view that the

Umamaheshwararao Ch, IJRIT

427

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 10, October 2014, Pg. 422-429

amount balancing secret design for a cloud division into parts in the normal amount position (in society) can be viewed as a noncooperative damaged and without full use, as described here. The players in the damaged and without full use are the network points and the regular works. take as probable there are N hard growths in the current cloud division into parts with N jobs getting to, then make statement of the sense of words the supporters parameters. ! i : processing power of each network point, i = 1, . . . , n. "j : Time spending of each job. " = ∑#  "j :Time spent by the entire cloud partition," < ∑  !i.  sji: : Fraction of job j that assigned to node i (∑ & % ji =1 and 0  s ji 1). In this design to be copied, the most important step is having experience the right value of sji. The current design to be copied uses the way of Grosu et Al. called the best answer to work out sji of each network point, with a greedy Algorithm then used to work out sji for all network points. This way gives the Nash equilibrium to make seem unimportant the move time of each mixed bag of goods. The secret design then changes as the network points statuses change.

5. Future Work Since this work is just a with the idea framework more work is needed to instrument the framework and get broken up new problems Some important points are 1 Cloud division rules: Cloud division is not a simple hard question. Thus the framework will need a detailed cloud division methodology for example network points in a cluster may be far from other network points or there will be some clusters in the same geographic area 6 that are still far apart. The division rule should simply be based on the geographic marked off country division or state. 2 How to group the refresh stage in history. In the data statistics analysis the main controller and the cloud division into parts balancers need to refresh the information at a fixed stage in history. If the stage in history is too short the high number of times will effect the system operation If the stage in history is too long the information will be too old to make good decision. Thus tests and statistical instruments are needed to put a reasonable refresh times. 3 A better amount position (in society) put value a good algorithm is needed to put amount degreehigh and amount degreelow and the put value mechanism needs to be more complete. 4 Discover other amount balance secret design other amount balance designs may make ready better results so tests are needed to make a comparison different designs. Many tests are needed to give support to (a statement) system able to use and doing work well.

References [1] R. Hunter, The why of cloud, http://www.gartner.com/DisplayDocument?doc cd=226469&ref= g noreg, 2012. [2] M. D. Dikaiakos, D. Katsaros, P. Mehra, G. Pallis, and A. Vakali, Cloud computing: Distributed internet computing for IT and scientific research, Internet Computing, vol.13, no.5, pp.10-13, Sept.-Oct. 2009. [3] P. Mell and T. Grance, The NIST definition of cloud computing, http://csrc.nist.gov/ publications/nistpubs/800145/SP800-145.pdf, 2012.

Umamaheshwararao Ch, IJRIT

428

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 10, October 2014, Pg. 422-429

[4] Microsoft Academic Research, computing?query=cloud%20computing, 2012.

Cloud

computing,

http://libra.msra.cn/Keyword/6051/cloud-

[5] Google Trends, Cloud computing, http://www.google.com/trends/explore#q=cloud%20computing, 2012. [6] N. G. Shivaratri, P. Krueger, and M. Singhal, Load distributing for locally distributed systems, Computer,vol. 25, no. 12, pp. 33-44, Dec. 1992. [7] B. Adler, Load balancing in the cloud: Tools, tips and techniques, http://www.rightscale. com/info center/whitepapers/Load-Balancing-in-the-Cloud.pdf, 2012 [8] Z. Chaczko, V. Mahadevan, S. Aslanzadeh, andC. Mcdermid, Availability and load balancing in cloud computing, presented at the 2011 International Conference on Computer and Software Modeling, Singapore, 2011. [9] K. Nishant, P. Sharma, V. Krishna, C. Gupta, K. P. Singh, N. Nitin, and R. Rastogi, Load balancing of nodes in cloud using ant colony optimization, in Proc. 14thInternational Conference on Computer Modelling andSimulation (UKSim), Cambridgeshire, United Kingdom,Mar. 2012, pp. 28-30. [10] M. Randles, D. Lamb, and A. Taleb-Bendiab, A comparative study into distributed load balancing algorithms for cloud computing, in Proc. IEEE 24thInternational Conference on Advanced Information Networking and Applications, Perth, Australia, 2010,pp. 551-556.

Umamaheshwararao Ch, IJRIT

429

Load Balancing for Distributed File Systems in Cloud

for the public cloud based on the cloud making into parts idea of a quality common ... balancing secret design to get better the doing work well in the public cloud.

489KB Sizes 5 Downloads 280 Views

Recommend Documents

Distributed Load-Balancing in a Multi-Carrier System
of SLIM to cases where Quality-of-Service (QoS) parameters are specified and ... For example, a cellular network based on EVDO-RevB [1] is one such system.

Utility-Aware Deferred Load Balancing in the Cloud ...
Abstract—Distributed computing resources in a cloud comput- ing environment ... in various ways including the use of renewable energy [2],. [3] and improved ...

Load Balancing in Cloud Computing: A Survey - IJRIT
Cloud computing is a term, which involves virtualization, distributed computing, ... attractive, however, can also be at odds with traditional security models and controls. ... Virtualization means “something which isn't real”, but gives all the

Load Balancing in Cloud Computing: A Survey - IJRIT
Keywords: Cloud computing, load balancing, datacenters, clients, distributed servers. 1. ... Hybrid Cloud (Combination of Public & Private Cloud). Fig. 2: Three ...

Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems
A core problem in peer to peer systems is the distribu- tion of items to be stored or computations to be car- ried out to the nodes that make up the system. A par-.

load balancing
Non-repudiation means that messages can be traced back to their senders, ..... Traffic sources: web, ftp, telnet, cbr (constant bit rate), stochastic, real audio. ... updates, maintaining topology boundary etc are implemented in C++ while plumbing ..

Configuring Internal Load Balancing (console) Cloud Platform
... “create” and your ILB is ready to distribute traffic! Click Create. Done! Page 9. ‹#› https://cloud.google.com/compute/docs/load-balancing/internal/. Learn more.

An Algorithm for Load Balancing in Network Management ...
tructures often have support for seamlessly adding and remov- ing computing resources, whether by changing the physical or virtual machines, or by adding/removing machines on the fly[3]. The advent of this heterogeneity, the increase in scale in mana

Efficient Load Balancing for Bursty Demand in Web ...
server IP address, the subsequent requests from the same client will be sent to the same .... to a dedicated server load balancer. It also being able to handle.

Dynamic Load Balancing on Single- and Multi-GPU Systems
GPU systems, our solution achieves near-linear speedup, load balance .... extended to GPU clusters. ... memory consists of the register file, shared memory, con-.

A Survey on Load Balancing of Resources in Cloud ...
time load condition in every servers; In cloud computing environment, these algorithms ... graphics processing unit (GPU) bunches are introduced for the edge to ...

Multilevel Load Balancing in NUMA Computers
Avail- able at URL http://h21007.www2.hp.com/dspp/files/unprotected/super- domejan05.pdf, 2005. [6] Hewlett-Packard, Intel, Microsoft, Phoenix and Toshiba.

Hybrid Load Balancing in Auto-ConfigurableTrusted ...
together to achieve the goal of Computer Supported. Cooperative Working ... loaded nodes to lighter one through process migration. There are instances when ...

Hybrid Load Balancing in Auto-ConfigurableTrusted ...
critical application services after hardware and software failures. ... process migration [27] or data migration according to the property of ... program that should migrate. Many of the ...... Data Mining, Cognitive Sciences, Object Oriented.

Configuring Search Appliances for Load Balancing or Failover
Considerations. 9. Monitoring the Status of the Configuration ... Failover configurations typically involve two instances of an application or a particular type of hardware. The first .... This configuration requires a DNS server and switch. Benefits

An efficient load balancing strategy for grid-based ...
Feb 20, 2007 - 4 – the importance of the cost of the communications make load balancing more difficult. Thus, the load bal- ..... This guarantees the low cost of the unfold operator. As (13) .... RENATER4 national network, by a 2.5 Gigabit connecti

Configuring Search Appliances for Load Balancing or Failover
Load Balancing with a Virtual Connection. 7 .... Content files on a host at IP address 192.168.0.10. 4. ... This configuration requires a DNS server and switch.

Configuring Search Appliances for Load Balancing or Failover
Google Search Appliance: Configuring Search Appliances for Load Balancing or Failover. 2. Google, Inc. 1600 Amphitheatre Parkway. Mountain View, CA ...

Online Load Balancing for MapReduce with Skewed ...
strategy is a constrained version of online minimum makespan and, in the ... server clusters, offering a highly flexible, scalable, and fault tolerant solution for ...

practical load balancing pdf
Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. practical load balancing pdf. practical load balancing pdf. Open.

vdm20-load-balancing-guide.pdf
Download. Connect more apps... Try one of the apps below to open or edit this item. vdm20-load-balancing-guide.pdf. vdm20-load-balancing-guide.pdf. Open.

Multilevel Load Balancing in NUMA Computers
we present our test results, using benchmarks and analytical models. Finally, .... The Linux load balancing algorithm uses a data structure, called sched domain ...

Frugal Storage for Cloud File Systems
Apr 10, 2012 - HSM systems are utilized to reduce data storage costs for enterprises, with the ..... Note that from the definition of OPT(ℓ),. d2OPT(ℓ). dℓ2. = 0.

7.0 - Configuring Search Appliances for Load Balancing or ...
Monitoring the Status of the Configuration ... application, dividing the work load between the instances. .... This configuration requires a DNS server and switch.