A Two-Phase Load Balancing Algorithm for Cloud Environment

2021 ◽  
Vol 13 (1) ◽  
pp. 38-55
Author(s):  
Archana Singh ◽  
Rakesh Kumar
Keyword(s):  
Load Balancing ◽  
Data Center ◽  
Virtual Machines ◽  
Second Phase ◽  
Cloud Environment ◽  
Cloud Platform ◽  
Efficient Utilization ◽  
Two Phase ◽  
Excessive Load ◽  
Load Balancing Algorithm

Load balancing is the phenomenon of distributing workload over various computing resources efficiently. It offers enterprises to efficiently manage different application or workload demands by allocating available resources among different servers, computers, and networks. These services can be accessed and utilized either for home use or for business purposes. Due to the excessive load on the cloud, sometimes it is not feasible to offer all these services to different users efficiently. To solve this excessive load issue, an efficient load balancing technique is used to offer satisfactory services to users as per their expectations also leading to efficient utilization of resources and applications on the cloud platform. This paper presents an enhanced load balancing algorithm named as a two-phase load balancing algorithm. It uses a two-phase checking load balancing approach where the first phase is to divide all virtual machines into two different tables based on their state, that is, available or busy while in the second phase, it equally distributes the loads. The various parameters used to measure the performance of the proposed algorithm are cost, data center processing time, and response time. Cloud analyst simulation tool is used to simulate the algorithm. Simulation results demonstrate superiority of the algorithm with existing ones.

scholarly journals Efficient utilization of energy consumption in cloud environment

2018 ◽  
Vol 7 (1.7) ◽  
pp. 189
Author(s):  
G Soniya Priyatharsini ◽  
N Malarvizhi
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Data Center ◽  
Virtual Machines ◽  
Vital Role ◽  
Cloud Environment ◽  
Efficient Utilization ◽  
Server Consolidation ◽  
Resource Request

In the tremendous growth of the cloud computing, server consolidation plays a vital role. It gives more benefits also it gives the pollution towards the nature. Inspite of avoiding this, saving of energy in the data center or the cluster is more important. In this regard this paper proposes a method of which reduces the energy consumption. This is done by identifying the active physical machines and the remaining machines were kept in the sleep or off mode according to the user’s availability. Here Virtual Machines (VMs) are grouped under the particular types. Based on this type the customer’s resource request can be maintained.

scholarly journals Proposing a load balancing algorithm with an integrative approach to reduce response time and service process time in data centers

2019 ◽  
Vol 16 (4) ◽  
pp. 627-637
Author(s):  
Sanaz Hosseinzadeh Sabeti ◽  
Maryam Mollabgher
Keyword(s):  
Load Balancing ◽  
Data Processing ◽  
Response Time ◽  
Virtual Machine ◽  
Data Center ◽  
Processing Time ◽  
Data Centers ◽  
Virtual Machines ◽  
Overall Response ◽  
Load Balancing Algorithm

Goal: Load balancing policies often map workloads on virtual machines, and are being sought to achieve their goals by creating an almost equal level of workload on any virtual machine. In this research, a hybrid load balancing algorithm is proposed with the aim of reducing response time and processing time. Design / Methodology / Approach: The proposed algorithm performs load balancing using a table including the status indicators of virtual machines and the task list allocated to each virtual machine. The evaluation results of response time and processing time in data centers from four algorithms, ESCE, Throttled, Round Robin and the proposed algorithm is done. Results: The overall response time and data processing time in the proposed algorithm data center are shorter than other algorithms and improve the response time and data processing time in the data center. The results of the overall response time for all algorithms show that the response time of the proposed algorithm is 12.28%, compared to the Round Robin algorithm, 9.1% compared to the Throttled algorithm, and 4.86% of the ESCE algorithm. Limitations of the investigation: Due to time and technical limitations, load balancing has not been achieved with more goals, such as lowering costs and increasing productivity. Practical implications: The implementation of a hybrid load factor policy can improve the response time and processing time. The use of load balancing will cause the traffic load between virtual machines to be properly distributed and prevent bottlenecks. This will be effective in increasing customer responsiveness. And finally, improving response time increases the satisfaction of cloud users and increases the productivity of computing resources. Originality/Value: This research can be effective in optimizing the existing algorithms and will take a step towards further research in this regard.

scholarly journals A NOVEL APPROACH OF OPTIMIZING PERFORMANCE USING K-MEANS CLUSTERING IN CLOUD COMPUTING

2016 ◽  
Vol 15 (14) ◽  
pp. 7435-7443 ◽  
Author(s):  
Sheenam Kamboj ◽  
Mr. Navtej Singh Ghumman
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Virtual Machine ◽  
Job Scheduling ◽  
Virtual Machines ◽  
Turnaround Time ◽  
Cloud Environment ◽  
Single Node ◽  
Novel Approach ◽  
Load Balancing Algorithm

Cloud computing is distributed computing, storing, sharing and accessing data over the Internet. It provides a pool of shared resources to the users available on the basis of pay as you go service that means users pay only for those services which are used by him according to their access times. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results. 

scholarly journals A NOVEL APPROACH OF JOB ALLOCATION USING MULTIPLE PARAMETERS IN IN CLOUD ENVIRONMENT

2018 ◽  
Vol 17 (1) ◽  
pp. 7103-7110
Author(s):  
Ashima Ashima ◽  
Vikramjit Singh
Keyword(s):  
Load Balancing ◽  
Virtual Machines ◽  
Complete Solution ◽  
Research Work ◽  
Cloud Service ◽  
Threshold Value ◽  
Work Load ◽  
Cloud Environment ◽  
Multiple Parameters ◽  
Load Balancing Algorithm

Cloud computing is Internet ("cloud") based development and use of computer technology ("computing"). It is a style of computing in which dynamically scalable and often virtualized resources are provided as a service over the Internet. This research deals with the balancing of work load in cloud environment. Load balancing is one of the essential factors to enhance the working performance of the cloud service provider. Grid computing utilizes the distributed heterogeneous resources in order to support complicated computing problems. Grid can be classified into two types: computing grid and data grid. We propose an improved load balancing algorithm for job scheduling in the Grid environment.  Hence, in this research work, a multi-objective load balancing algorithm has been proposed to avoid deadlocks and to provide proper utilization of all the virtual machines (VMs) while processing the requests received from the users by VM classification. The capacity of virtual machine is computed based on multiple parameters like MIPS, RAM and bandwidth. Heterogeneous virtual machines of different MIPS and processing power in multiple data centers with different hosts have been created in cloud simulator. The VM’s are divided into 2 clusters using K-Means clustering mechanism in terms of processor MIPS, memory and bandwidth. The cloudlets are divided into two categories like High QOS and Low QOS based on the instruction size. The cloudlet whose task size is greater than the threshold value will enter into High QOS and cloudlet whose task size is lesser than the threshold value will enter into Low QOS. Submit the job of the user to the datacenter broker. The job of the user is submitted to the broker and it will first find the suitable VM according to the requirements of the cloudlet and will match VM depending upon its availability. Multiple parameters have been evaluated like waiting time, turnaround time, execution time and processing cost. This modified algorithm has an edge over the original approach in which each cloudlet build their own individual result set and it is later on built into a complete solution.

scholarly journals AN ENHANCED TASK ALLOCATION STRATEGY IN CLOUD ENVIRONMENT

2017 ◽  
Vol 16 (6) ◽  
pp. 6953-6961
Author(s):  
Kavita Redishettywar ◽  
Prof. Rafik Juber Thekiya
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Virtual Machine ◽  
Data Centers ◽  
Job Scheduling ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Cloud Data ◽  
Cloud Data Centers ◽  
Load Balancing Algorithm

Cloud computing is a vigorous technology by which a user can get software, application, operating system and hardware as a service without actually possessing it and paying only according to the usage. Cloud Computing is a hot topic of research for the researchers these days. With the rapid growth of Interne technology cloud computing have become main source of computing for small as well big IT companies. In the cloud computing milieu the cloud data centers and the users of the cloud-computing are globally situated, therefore it is a big challenge for cloud data centers to efficiently handle the requests which are coming from millions of users and service them in an efficient manner. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.

scholarly journals Analysis of Heterogeneous Device Characteristics in Round Robin Based Load Balancing Algorithm with Closest Data Center as Service Broker Policy in Cloud

2019 ◽  
Vol 8 (9) ◽  
pp. 1627-1630
Keyword(s):  
Load Balancing ◽  
Response Time ◽  
Data Center ◽  
Data Centers ◽  
Virtual Machines ◽  
Round Robin ◽  
Cloud Data ◽  
Cloud Data Centers ◽  
Service Broker ◽  
Load Balancing Algorithm

Load balancing is an important aspect in cloud to share load among different virtual machines running on various physical nodes. The user response time which is an important performance metric is being highly influenced by the efficient load balancing algorithm for cloud data centers. Virtual machines which are part of the cloud data centers consist of various types of physical devices. The user response time is affected significantly by the capacity of physical devices that exist as part of the data centers. Several load balancing algorithms exist in the literature to allocate task effectively on various virtual machines running in data centers. We investigate the performance of round robin based load balancing algorithm with closest data center as service broker policy in cloud data centers. We have performed a simulation with data centers that consist of devices with different physical characteristics such as memory, storage, bandwidth, processor speed and scheduling policy using Round Robin load balancing algorithm with closest data centers as service broker policy. We present the merits of heterogeneous device characteristics in reducing the user response time and the data center request service time. We used Cloud Analyst, an open source simulation tool for cloud computing environment

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

scholarly journals eTPM: A Trusted Cloud Platform Enclave TPM Scheme Based on Intel SGX Technology

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3807 ◽  
Author(s):  
Haonan Sun ◽  
Rongyu He ◽  
Yong Zhang ◽  
Ruiyun Wang ◽  
Wai Hung Ip ◽  
...  
Keyword(s):  
Virtual Machines ◽  
Trusted Computing ◽  
Information Leakage ◽  
Research Topic ◽  
Cloud Environment ◽  
Cloud Platform ◽  
Computing Technology ◽  
Security Issues ◽  
Runtime Environment ◽  
Cloud Users

Today cloud computing is widely used in various industries. While benefiting from the services provided by the cloud, users are also faced with some security issues, such as information leakage and data tampering. Utilizing trusted computing technology to enhance the security mechanism, defined as trusted cloud, has become a hot research topic in cloud security. Currently, virtual TPM (vTPM) is commonly used in a trusted cloud to protect the integrity of the cloud environment. However, the existing vTPM scheme lacks protections of vTPM itself at a runtime environment. This paper proposed a novel scheme, which designed a new trusted cloud platform security component, ‘enclave TPM (eTPM)’ to protect cloud and employed Intel SGX to enhance the security of eTPM. The eTPM is a software component that emulates TPM functions which build trust and security in cloud and runs in ‘enclave’, an isolation memory zone introduced by SGX. eTPM can ensure its security at runtime, and protect the integrity of Virtual Machines (VM) according to user-specific policies. Finally, a prototype for the eTPM scheme was implemented, and experiment manifested its effectiveness, security, and availability.

scholarly journals An Optimal Solution in cloud computing for Load Balancing using Genetic Algorithm

2019 ◽  
Vol 8 (6) ◽  
pp. 2490-2494
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Load Balancing ◽  
Virtual Machines ◽  
Optimal Solution ◽  
Cloud Services ◽  
Research Trend ◽  
Schedule Length ◽  
Research Gap ◽  
Load Balancing Algorithm

Cloud computing is a research trend which bring various cloud services to the users. Cloud environment face various challenges and issues to provide efficient services. In this paper, a novel Genetic Algorithm based load balancing algorithm has been implemented to balance the load in the network. The literature review has been studied to understand the research gap. More specifically, load balancing technique authenticate the network by enabling Virtual Machines (VM). The proposed technique has been further evaluated using the Schedule Length Runtime (SLR) and Energy consumption (EC) parameters. Overall, the effective results has been obtained such as 46% improvement in consuming the energy and 12 % accuracy for the SLR measurement. In addition, results has been compared with the conventional approaches to validate the outcomes.

Sign in / Sign up

Export Citation Format

Share Document