AIRCC PUBLISHING CORPORATION
STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTING
Tran Cong Hung and Nguyen Xuan Phi
Posts and Telecommunications Institute of Technology, Vietnam
The rapid growth of users on the cloud service and number of services to the user increases the load on the servers at cloud datacenter. This issue is becoming a challenge for the researchers. And requires used effectively a load balancing technique not only to balance the resources for servers but also reduce the negative impact to the end-user service. The current, load balancing techniques have solved the various problems such as: (i) load balancing after a server was overloaded; (ii) load balancing and load forecast for the allocation of resources; iii) improving the parameters affecting to load balancing in cloud. The study of improving these parameters have great significance to improving system performance through load balancing. From there, we can propose more effective methods of load balancing, in order to increase system performance. Therefore, in this paper we researched some parameters affecting the performance load balancing on the cloud computing.
Load,balancing;Virtual,machines;Load,Balancing parameters;Cloud Computing.
Cloud computing is a rapidly growing technology in today’s Internet world. With the advent of cloud computing, a new age of the Internet has really started. Along with the use of cloud computing in excess of any applications or services running on the Internet so far. Although the number of users on the Internet is huge compared to those who used the devices on the cloud, but the growth rate of users in cloud computing is growing. The Internet giants like Google, Microsoft, Amazon, and many other small-scale businesses, have started using Cloud and gives the user base for their Cloud experience and serve other purposes such as: work, business, research, … cloud computing allows users to use software applications without having to install them on their computers. End-users pay a subscription fee to use Cloud services. That means that businesses only pay a service fee to use the software without hardware infrastructure equipment, Storage, … for your business purposes. All the rest is due to the cloud service provider is responsible. Businesses focus on their main objective is business. In cloud computing, software is stored directly from the server of the service provider end user access through the Internet environment, this has increased the efficiency of their business over and over again. These include a number of cloud services typically such as Gmail (Google), EC2 (Amazon), Azure (Microsoft), Bluemix Cloud platform (IBM), … With so many amenities, the popularity, the user to use cloud computing will increase. The increase in the number of users is synonymous with the increasing number of requests for cloud service providers at any given time. The number of users can be considered as the load of the server. Therefore, inevitably will lead to processing power of the server will be overloaded. The solution to this problem may be to increase the number of servers, increase the processing power of the server, or in many cases is scheduled for requesting access to the servers. The increase in processing power of servers is costly and is a temporary solution and in many cases unnecessary. So the solution is to study primacy of algorithms for resource balancing (load) on cloud computing for businesses will help service providers reduce the considerable cost hardware infrastructure equipment.
With that approach, we studied the parameters affect the performance load balancing on the cloud and it is the basis to propose methods for improving high performance load balancing on the cloud. This paper is organized as follows: Part I: introduction. Part II is the related work. Section III studies the affect of the parameters by using the tool CloudSim. Part IV simulation results and Section V concludes.
2. RELATED WORK
In works , the P. Srinivasa Rao et al. refers to the elements to take a balanced approach to effective, the information nodes of all other nodes. When a node receives a job, it has to query the status of the other buttons to find out which node has less usage to forward the work, and when all nodes are query phenomenon overload happens. With the nodes broadcast a statement informed about its status will also cause huge load on the network. Next is the issue of time wasted at each node to perform query status. Besides, the current state of the network is also a factor affecting the performance load balancing. Because, in a complex network, with multiple subnets, the network node configured to locate all the other node is a fairly complex task. Thus, querying the status of nodes in the cloud will affect the performance load balancing.
The Agraj Sharma et al.  showed that factors response time will greatly affect the performance load balancing on the cloud. The work  outlined two outstanding issues of the previous algorithm are: i) load balancing occurs only when the server is overloaded; ii) continuous information retrieval resources available lead to increased computational cost and bandwidth consumption. So the authors have proposed an algorithm based on the response time of the request to assign the required decisions for servers appropriately, the algorithm approach has reduced the query information on available resources, reduced communication and computation on each server. The result is simulated with ECLIPSE software using JAVA IDE 1.6 has proven the correctness of the proposed algorithm.
According to algorithm Min – Min  minimizes the time to complete the work in each network node however algorithm has yet to consider the workload of each resource. Therefore, the authors offer algorithm Load Balance Improved Min-Min (LBIMM) to overcome this weakness. Failure to consider the workload of each resource leading to a number of resources are overloaded, some resources are idle; therefore, the work done in each resource is a factor affecting the performance load balancing on the cloud. Tradition Algorithm Min – Min is simple and is the basis for the current scheduling algorithm in cloud computing. After giving the algorithm to consider the workload of each resource to overcome the limitations of tradition algorithm Min – Min is algorithm LBIMM  for better experimental results, shown in Table 1.
In this experiment, the same value the Number of Task and Number of Resources but LBIMM
given Makespan (execution time in each resource) than less value and Average Resource
Utilization Ratio (percentage of resource use average) higher than the algorithm Min – Min.Again shows, the study workload in the cloud resources that have great influence on the balance of resources in the cloud. The parameters mentioned here are: Average Resource Utilization Ratio and Makespan.
The study aims to maximize throughput, reduce latency in cloud computing is also the author Dhinesh Babu L.D et al.  concerned. Because the problem of balancing resources on cloud computing is an optimization problem NP-hard class, load balancing for independent work is a very important priority in the scheduling algorithm on cloud. With the proposed algorithm HBBLB with the basic parameters are: through put, the waiting time in the queue, authors proved the effect of these parameters on performance job scheduling avoid overloading on the cloud environment.
In the works  Author Gaochao Xu and his team believe in environmental load balancing cloud computing has a significant impact on the performance of the system. Good load balancing makes cloud computing more effectively and improve the satisfaction of users. This work  introduced a load balancing model for the Public Cloud based on the concept of Cloud Partitioning with a conversion mechanism to choose different strategies for different situations. The division cloud into partitions will contribute to building load-balancing strategy is effective.
Figure 1 shows the relationship of cloud partitions after having broken into separate partitions . In each partition has its own set of load balancing and the balance is subject to the control of the Main Controller, select the partition decision cloud to serve, the information on the partition (state, load level, bandwidth, …) management focus in the Main Controller. Now that we can see, in order to improve the efficiency of load balancing on the cloud, the division into separate partitions cloud will improve overall system performance servers.
Hiren H. Bhatt et al.  propose an algorithm enhanced load balancing using flexible load sharing algorithm (FLS). The author says, in the distributed environment, load balancing of the nodes and task scheduling is the main concern for the designers. In the Fig 2 show the nodes of domain in cloud scenario.
Domain of node A includes the node F and H, and B includes H, I, and D with FLS if H is the domain of A then the domain of node H will include node A. Then node will exchange the information from one node to another node. The third partition function will make the partition in to each domain so that using the remote location the information will be transferred to another domain. This research shows the basic technique for grouping the virtual machines. Divide the virtual machines to different groups and flexible load sharing will easily workload distributed for the virtual machines so that will reduce the overload VMs. The parameters in this study are: virtual grouping machines, load sharing.
Ritu Kapur  propose an algorithm LBRS (Load Balanced Resource Scheduling Algorithm). The idea of the algorithm is to consider the importance of resource scheduling policys and load balancing for resources in cloud. The main goal is to maximize the CPU Utilization, maximize the Throughput, minimize the Response Time, minimize the Waiting time, minimize the Turnaround Time, minimize the Resource Cost and obey the Fairness princip. In here, the parameters mentioned are QoS: throughput, response time, waiting time,…
We found that the study of the parameters affecting to load balancing in cloud very practical sense, not only can increase performance processing by load balancing method the system but also the scientific basis to study make effective algorithms for improving performance of load balancing on the cloud computing. Some key parameters: throughput, response time, latency, execution time, … Our main goal are methods to maximize throughput, reduce response time, minimum chemical timeout, reducing implementation time, … to improve performance for data center cloud.
3. CLOUDSIM: SIMULATION TOOL FOR CLOUD COMPUTING
Tools are the authors of CloudSim works  announced is very useful for simulating cloud computing environment. We used CloudSim Tool for simulation of our experiment.
3.1. THE BASIC COMPONENTS OF CLOUDSIM
The function of the main class in CloudSim :
3.2. NETWORK TRAFFIC FLOW IN SIMULATION
Modeling network topology to perform simulated cloud entities (host, storage capacity, users) has significant implications because the latency of the network architecture directly affect the experience customer services.
Looking at Figure 5 we can see, there is delay matrix in CloudSim. From entity i to entity j take some time t + d with t is the time the message was sent, and d is the latency. The simulation using matrix latency easier when performing simulations of routers, switches and this matrix can be replaced by the weight or bandwidth between entities in data center. CloudSim taken from file Brite network topology include the following information: hosts, data centers, Cloud Broker, …
4. SIMULATION RESULTS
In this scenario, we simulate a Datacenter only a physical host and create 10 virtual machines (VM) on the host. The aim is recorded and compared the time taken by a Cloudlet (considered Job) on the virtual machine when changing the parameter simulation, such as the magnitude of cloudlet, bw, ram, mips, … of the virtual machine. Scenario simulation is done on CloudSim, here the Cloudlet can be considered as the work on job, depending on the magnitude of it that the virtual machine will handle fast or slow. Correspondingly, the Cloudlet in Figure 4 is the input of the system and we made a total measurement time (Time Execution) since CloudSim Cloudlet on until the end. Time Execution Unit of measure is milliseconds. Parameter mips represents the number of million intruction per second. The parameters of the VM and the Cloudlet used to simulate as follows (Table 3):
4.1 THE MIPS PARAMETER AFFECTED
With 10 virtual machines created with the same parameter we obtained the results as shown in Table 4.
From Table 4 we see when the same input parameters, we obtained Time is equal. Now, we change the values of parameters mips (as Table 5), the results obtained as Table 6 and Figure 6.
From Figure 6 we see, VM9 (with mips = mips * 9) has highest mips should be the first choice to Cloud carried out the work, therefore the smallest Time Execution, next the VMs has mips descending is selected, VM2 should have the smallest mips then Time Execution is the greatest. Figure 6 shows the correlation between mips and Time Execution. The degree of influence of mips parameter clearly affect the execution time of the virtual machines in the cloud. Therefore, the research to increase value of mips will avoid the traffic deadlock or otherwise improve performance of load balancing in the cloud.
4.2 THE LENGTH PARAMETER AFFECTED
In CloudSim, length parameter represents the size of the Cloudlet (job). In here, we will simulate split length value for virtual machines, which simulate the tasks to be subdivided and assigned to virtual machines run in the Cloud.
Since the parameters in Table 6 (the other parameters is unchange), we obtained the results as shown in Table 7 and Figure 7.
Figure 7 show that, the virtual machine has length value greater (length = 40000, from Table 3) then the time to execute the greater. The length value represents the size of the job come to cloud. Here we see that, VM5, VM9 and VM10 corresponding length value is length/100 = 400, length/100 = 400, length/50 = 800 (with length = 40000, from Table 6), so corresponding time of execution is 20ms, 20ms and 40ms (Figure 7). The VM6 and VM7 have length value smaller length value of VM5, so corresponding time of execution is 3.3ms and 2.5ms (smaller execution time of VM5 is 20ms). Reason for time of executed on VM5, VM9 and VM10 larger than the other VMs is because it has a larger length value. Besides, VM7 has minimum length value (in Table 6) so there will be minimal execution time and vice versa VM10 greatest length value should have performed well greatest time. Now that we can see, the study of algorithms to be able to split the job before being assigned to the virtual machine VM is extremely important. This work has reduced the bottleneck phenomenon and increased the processing speed of the system, or in other words increase the performance for load balancing, balance of resources.
In the future, cloud computing is a promising technology, is a model for providing the resources needed for customer service oriented. Platform virtualization is one of the essential characteristics of cloud computing, virtualization refers to factors affecting business performance, such as information technology resources, hardware, software, operating system and service. Cloud computing is characterized by distributed computing and this is also the risk of bottlenecks that may occur during the allocation of resources for load balancing. The preventable risk overloading in cloud computing will make resources highly available status. The system access requests can occur simultaneously and will not avoid the “competitive” idle resources of the cloud. We have simulation and analysis of data on the impact of the parameters on cloud to performance of load balancing. From there, we discovered that, parameters makespan (runtime) is of great significance for the data center cloud. So the task of the researchers is to study the algorithms are effective load balancing to reduce the time makespan of virtual machines. Research suggest adjusting the parameters in order to improve performance of load balancing is also a research aimed at solving the imbalance on the cloud computing environment.
 P. Srinivasa Rao, V.P.C Rao and A.Govardhan,“Dynamic Load Balancing With Central Monitoring of Distributed Job Processing System”, International Journal of Computer Applications (0975 – 8887) ,Volume 65– No.21, March 2013.
 Agraj Sharma, Sateesh K. Peddoju, “Response Time Based Load Balancing in Cloud Computing”, 2014 International Conference on Control, Instrumentation, Communication and Computational Technologies (ICCICCT).
 Huankai Chen, Frank Wang, Na Helian, Gbola Akanmu, “User-Priority Guided Min-Min Scheduling Algorithm For Load Balancing in Cloud Computing”, Parallel Computing Technologies, 2013 National Conference.
 Dhinesh Babu ,Venkata Krishna P, “Honey bee behavior inspired load balancing of tasks in cloud computing environments”, Elsevier- Journal of Applied Soft Computing, no-l3, 2013, pp-2292-2303
 Gaochao Xu, Junjie Pang and Xiaodong Fu, “A Load Balancing Model Based on Cloud Partitioning for the Public Cloud”, Tsinghua Science and Technology , ISSN 1007-0214 04/12, pp 34-39, Volume 18, Number I, Febuary 2013.
 Hiren H. Bhatt and Hitesh A. Bheda, “Enhance Load Balancing using Flexible Load Sharing in Cloud Computing”, 2015 1st International Conference on Next Generation Computing Technologies (NGCT-2015) Dehradun, India, 4-5 September 2015.  Ritu Kapur, “A Workload Balanced Approach for Resource Scheduling in Cloud Computing”, 2015 Eighth International Conference on Contemporary Computing (IC3), 20-22 Aug. 2015
 Rodrigo N. Calheiros, Rajiv Ranjan, Anton Beloglazov, Cesar A. F. De Rose and Rajkumar Buyya, “CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms” , Softw. Pract. Exper. 2011; 41:23–50, Published online 24 August 2010 in Wiley Online Library (wileyonlinelibrary.com). DOI: 10.1002/spe.995
Tran Cong Hung was born in Vietnam in 1961. He received the B.E in electronic and Telecommunication engineering with first class honors from HOCHIMINH University of technology in Vietnam, 1987. He received the B.E in informatics and computer engineering from HOCHIMINH University of technology in Vietnam, 1995. He received the master of engineering degree in telecommunications engineering course from postgraduate department Hanoi University of technology in Vietnam, 1998. He received Ph.D at Hanoi University of technology in Vietnam, 2004. His main research areas are B – ISDN performance parameters and measuring methods, QoS in high speed networks, MPLS. He is, currently, Associate Professor PhD. of Faculty of Information Technology II, Posts and Telecoms Institute of Technology in HOCHIMINH, Vietnam.
Nguyen Xuan Phi was born in Vietnam in 1980. He received Master in Posts & Telecommunications Institute of Technology in Ho Chi Minh, Vietnam, 2012, major in Networking and Data Transmission. Currently, he is a PhD candidate in Information System from Post & Telecommunications Institute of Technology, Vietnam. He is working at the Information Technology Center of AGRIBANK in Ho Chi Minh, Vietnam.