Effectual Load Balancing in Cloud Computing

Zubair Khan Department of C.S.E Invertis University Bareilly India

zubair.762001@gmail.com

Arun Gangwar M.Tech C.S.E Invertis University Bareilly India

gangwar50@gmail.com

Sumit Sanwal M.Tech C.S.E Invertis University Bareilly India

sanwalsumit@gmail.com

Naresh Kr. Gangwar M.Tech C.S.E Invertis University Bareilly India

er.nkgangwar@gmail.com

Abstract:-This paper illustrates the load balancing algorithms that would be an efficacious approach to maintain the load in clouds. As this is the major task in cloud computing to provide the scalable access to the end users and gives them prominent outfits. Now days, number of users are increasing their requirements so the providers gives the effectual services with maximum utilization, minimize the resources consumption, which will further reduce energy consumption and carbon emission rate, it is a very challenging issue and an ultimate goal for service providers. The algorithm we have proposed in this paper, will emphatically handle the demand of excessive users by balancing the load in cloud computing. Its performance comparison with round robin algorithm is being done using cloud analyst tool. Keywords:-Virtual Machine (VM), Cloud Computing, Data Centers, SaaS, IaaS, PaaS, OLB, LBMM.

adopted by the industry and there is a rapid expansion in data centers. This expansion has caused the dramatic increase in energy use and its impact on the environment in terms of carbon footprints. The colligate between energy consumption and carbon emission has given rise to an energy management issue which is to improve energy efficiency in cloud computing to achieve green computing. There should be the appropriate process to assign the numerous tasks to different virtual machines. In this study, the proposed algorithm solves this problem. The rest of the paper is organized as follows. Section 2 explains the basic concept of load balancing. Section 3 explains problem definition. Section 4 reviews the background and related work. Section 5 presents proposed work and simulations. The conclusion is given in Section 6. II. LOAD BALANCING The goal of load balancing is meliorating the performance by balancing the load among their various resources (network links, CPU, disk drives) to achieved optimal resource utilization, maximum throughput, maximum response time and avoiding overload. To distribute load on different systems we use generally traditional algorithms like whose used in web servers, but there algorithms do not always give the expected performance with large scale and distinct structure of service oriented data centers.[5] To overcome the shortcomings of their algorithms, load balancing has been widely studied by researchers and implemented by computer vendors in distributed systems. In general, load balancing algorithms follow two major classifications [6]: Depending on how the charge is distributed and how processes are allocated to nodes.

I.

INTRODUCTION

Cloud computing is emerging as a new paradigm of large scale distributed computing. Cloud computing has often been used with synonymous terms such as software as a service (SaaS), grid computing, cluster computing, autonomic computing, utility computing and now a day very popular computing called green computing.[1] Cloud computing is a framework for enabling a suitable, on demand network access to a shared pool of computing resources(eg. Network, servers, storage, applications and services). The access to the infrastructure incurs payments in real currency in cloud environment. Today network bandwidth, less response time, minimum delay in data transfer and minimum data transfer cost are main challenging issues in cloud computing load balancing environment.[2] Due to the exponential growth of cloud computing, it has been widely 978-1479913756/13/$31.00 2013 IEEE

Depending on the information status of the node.

III. PROBLEM DEFINITION The problematic situations in cloud computing occurs when many users send their request to the cloud for different services or same services at a time and all have to assign to different virtual machine(VM). A job departs from the system after the VM is hosted for the required amount of time. We assume jobs are queued in the system when all servers are busy. We are interested in the maximum rates at which jobs can be processed in such a system and properly allocation of resources than can support the maximum rates. The capacity of a cloud system is defined to be the set of traffic loads under which the queues in the system can be stabilized. Hence the proposed algorithm is designed to overcome such kind of vault. IV. EXISTING LOAD BALANCING TECHNIQUES IN CLOUD COMPUTING Scheduling strategy on load balancing of virtual machine resources - J. Hu et al. [8] proposed a scheduling strategy on load balancing of VM resources that uses historical data and current state of the system. This strategy achieves the best load balancing and reduced dynamic migration by using a genetic algorithm. It helps in resolving the issue of load-imbalance and high cost of migration thus achieving better resource utilization. But one problem is that it should not consider fault tolerance. Join-Idle-Queue - Y. Lua et al. [5] proposed a Join- Idle-Queue load balancing algorithm for dynamically scalable web services. This algorithm provides large-scale load balancing with distributed dispatchers by, first load balancing idle processors across dispatchers for the availability of idle processors at each dispatcher and then, assigning jobs to processors to reduce average queue length at each processor. By removing the load balancing work from the critical path of request processing, it effectively reduces the system load, incurs no communication overhead at job arrivals and does not increase actual response time. Central load balancing policy for virtual machines - A. Bhadani et al. [9] proposed a Central Load Balancing Policy for Virtual Machines (CLBVM) that balances the load evenly in a

distributed virtual machine/cloud computing environment. This policy improves the overall performance of the system but does not consider the systems that are fault-tolerant. Two-phase load balancing algorithm (OLB + LBMM) - S.-C. Wang et al. [7] proposed a two- phase scheduling algorithm that combines OLB (Opportunistic Load Balancing) and LBMM (Load Balance Min-Min) scheduling algorithms to utilize better executing efficiency and maintain the load balancing of the system. OLB scheduling algorithm, keeps every node in working state to achieve the goal of load balance and LBMM scheduling algorithm is utilized to minimize the execution time of each task on the node thereby minimizing the overall completion time. This combined approach hence helps in an efficient utilization of resources and enhances the work efficiency. A Task Scheduling Algorithm Based on Load Balancing - Y. Fang et al. [10] discussed a two-level task scheduling mechanism based on load balancing to meet dynamic requirements of users and obtain a high resource utilization. It achieves load balancing by first mapping tasks to virtual machines and then virtual machines to host resources thereby improving the task response time, resource utilization and overall performance of the cloud computing environment. Y*=Yes; N#=No

[7]
Performance Response Time Scalability Overhead Throughput Resource Utilization Fault Tolerance Y* N# N N N Y N

[5]
Y Y N Y N N N

[8]
N N N Y N Y N

[9]
Y Y N Y Y N N

[10]
Y Y N N N Y N

Table:-1 Metrics considered by existing load balancing techniques.

V.

PROPOSED WORK

A cloud computing consists of a number of networked servers. Each of the servers may host multiple VMs. Each VM requires a set of resources,

including CPU, memory and storage space. VMs are classified according to the resources they request. Example Table given below shows list of three types of VMs (called instances) available in Amazon EC2. [3]
Instance Type Standard Extra-large High Memory Extra-large High CPU Extra-large Memory GB 15 17.1 7 CPU units 8 EC2 6.5 EC2 20 EC2 Storage GB 1,680 420 1,690

otherwise check the next VM. It no VM is free, and then the task has to wait in queue. This process continued until the queues become empty. This helps to provide less response time rather than round robin algorithm. A. Proposed Algorithm 1) Each server maintain A list of virtual machines 2) Each server maintain number of types of queues for different types of jobs 3) Assign the c(capacity)50 for each VM 4) If(True) 5) Enqueue(Q, ts) 6) Else(Q=NULL) 7) Sort the VMs according to the total task assigned to them in non-decreasing order 8) For each VM 9) Do if total task assigned to VMi<c 10) Then tdequeue(Q) 11) Assign t to VMi C Capacity Ts Task required by users Q Queue (Q1, Q2 Qn) T Is a task that are assigned to a particular VM B. Simulation

We assume there are A distinct VM configurations and that each VM configuration is specified in terms of its requirements for K different resources. Let Rak be the amount of type-k resources (eg. memory) required by a type-a VM, P different servers. Let Dik denotes amount of type-k resource at server i. given a server an A- dimensional vector B is said to a feasible VM- configuration if the given servers can simultaneously host B1 type-1 VMs B2 type- 2 VMs---- BA type-A VMs. In other words, B is feasible at server I if and only if

for all k. we let Bmax denote the maximum number of VMs of any type that can be served on any server. The algorithm technique is related to throttled policy. Throttled policy is completely based on virtual machine. Client requested to load balancer and then right VM is assigned. [4] For load balancing on different servers, we presenting a proposed algorithm in which there is a list of virtual machines. And each server maintains different queues for different types of jobs. It then uses this queue length information in making scheduling decisions. All VM in list contains the capacity to handle the request of 50 users we assumes (it is very high in real but for convenient we assumes 50 users per VM). The requests that were sent by users will reach to a different different queue according to the types of jobs entered in FCFS bases. All virtual machine are sorted, and check the availability of first VM, if it has the capacity then take a task from queue and assign this to VM

Cloud analyst tool is used for simulation process, proposed algorithm is based on the concept of throttled policy; hence there is comparison between the response time of round robin and proposed algorithm The many components of cloud analyst tool are used to analyses the algorithm. Every component has to assign various parameters on which bases it become simulate the algorithm; there are different parameters that are set for different components. There are six users U1, U2, U3, U4, U5, U6 that are located in six different region R1, R2, R3, R4, R5, R6 around the world as shown in Table.2

Name

Simulation time 120 minutes Region Request per user per hr.

Data size per request (bytes)

Peak hours start (GMT)

Peak hours end (GMT)

Avg peak user

Avg offpeak user

U1 U2 U3 U4 U5 U6

R1 R2 R3 R4 R5 R6

60 80 70 70 40 50

50 50 50 50 50 50

5 5 5 5 5 5

10 10 10 10 10 10

21,000 15,000 18,000 14,000 24,000 20,000

200 500 600 200 700 300

Table: - 2 User Base Configuration

In application development configuration, as shown in table 3 there data centers are taken with 50, 20, 30 number of VMs respectively.
Application Deployment Configuration: Service broken policy CLOSEST DATA CENTER Data Center VMs Image Size D1 D2 D3 50 20 30 1000 1000 1000 Table: - 3 Application Deployment Configuration Memory 512 512 512 BW 1000 1000 1000

The data center configuration depicts the region in which data center are established. As data center D1 is in region R1, D2 is in region R2 and D3 is in region R3. Other configuration is also defined like memory cost, storage cost and data transfer cost etc. in table. 4
Name Region Arch OS VMM Cost per VM $/hr. Memory Cost $/s Storage cost $/s Data Transfer Cost $/Gb Physical Hardware Units

D1 D2 D3

R1 R2 R3

x86 x86 x86

Linux Linux Linux

Xen Xen Xen

0.2 0.2 0.2

0.02 0.02 0.02

0.1 0.1 0.1

0.1 0.1 0.1

3 2 1

Table: - 4 Data Center Configuration

Fig. 1 shows the data center D1, D2, D3 with user connected to them. The distance between the user and data center shown in figure it is an approximate values for convenience but in real these value in thousand or hundreds of thousands of km. The performance analysis between round robin algorithm and the proposed algorithm is done using this cloud analyst tool. Round robin algorithm is

random sampling based algorithm. In random sampling based algorithm the load randomly selected in case that some server is heavily loaded or some are lightly loaded. After performing simulation, the generated result shows the overall response time summary for both algorithms, table. 5 shows the overall response time and data center processing time for round robin algorithm and proposed algorithm.

U3 D1
250 km 500 km 750 km

R4

R1 U1

1000 km

U5 R5 U6 R6 D3 R3
200 km

D2 R2
100 km

U4 U2

Fig: - 1 Combination of data centers and users.

RR- Round Robin PA- Proposed Algorithm

User base Avg at RR Min(ms) RR Max(ms) RR Avg at PA Min(ms) PA Max(ms) PA

U1 U2 U3 U4 U5 U6

50.90 51.20 300.80 51.30 500.80 502.40

35.76 39.40 212.27 38.00 360.76 375.72

62.51 65.45 392.26 66.80 625.00 630.72

49.00 51.10 300.00 51.25 499.50 501.20

36.67 37.20 212.28 38.80 362.76 390.94

65.52 67.56 399.28 69.56 622.76 625.20

Table:-5 Response Time By Region

These charts shows that proposed algorithm is better than available algorithms shown in table-5 shows that proposed algorithm overall response time and data center processing time is less than round

robin therefore proposed algorithm is better than available one.

VI.

CONCLUSION

The response time and processing time are the issues among various major issues that should be overcome to get the scalable access to the services provided by a cloud. Scalable access is necessary to scale up any business. For business purpose infrastructure as a service, for individual user software as a service and for a developer platform as a service should be provided by a cloud. Every user should get the service without any delay. As this proposed algorithm deals with such kind of issues and its simulation gives best result in comparison with round robin algorithm. Future work on improvement in this area like security issues in load balancing in cloud and provide reliable service. REFERENCES
[1] [2] W.Kim, Cloud Computing: Today and Tomorrow, Journal of Object Technology, 8, 2009. Jaspreet Kaur, Comparison of load balancing algorithm in a cloud, International Jouranal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com vol.2, Issue 3, May June 2012, pp1169-1173.\. Aws.amazon.com Ms. NITIKA, Comparative analysis of load balancing algorithms in cloud computing, International Journal of Engineering and Science vol.1, Issue 1. Yi Lu, Qiaomin Xie, Gabriel Kliot, Alan Geller, James R.Larus, Albert Greenberg, Join-Idle-Queue: A Novel Load Balancing Algorithm for Dynamically Scalable web services, IFIP PERFORMANCE 2011 29th International Symposium on Computer Performance, Moodeling, Measurements and Evaluation 2011, 18-20 October, 2011, Amaterdam, Netherlands. Elarbi Badidi, Architecture et services pour la distribution de charge dans less systemes. Distributes objet, University de Montreal Faculte des etudes superieures, there doctorale, 20 juillet 2000. S. Wang, K. Yan, W. Liao, S.Wang, Towards a Load Balancing in a Three-level Cloud Computing Network, Proceedings of the 3rd IEEE International Conference on Computer Science and Information Technology [ICCSIT], Chengdu, China, September 2010, page 108-113. J. Hu, J.Gu, G.sun, and T.Zhao, A Schedulihg Strategy on Load Balancing of Virtual Machine Resources in Cloud Computing Environment, Third International Symposium on Parallel Architecture, Algorithm and Programming (PAAP), 2010, pages 89-96. A. Bhadani, and S.Chaudhary, Performance evaluation of web servers using central load balancing policy over virtual machines on cloud ,Proceedings of the Third Annual ACM Bangalore Conference (COMPUTE), January 2010.

Information Systems and Mining. Lecture Notes in Computer Science; vol 6318,2010, pages 271-277.

[3] [4]

[5]

[6]

[7]

[8]

[9]

[10] Y.Fang, F.Wang, and J.Ge, A Task Scheduling Algorithm Based on Load Balancing in Cloud Computing, web