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 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

scholarly journals An Analysis on ECSE Load Balancing Algorithm with CDC as a Service Broker Policy in Cloud with Heterogeneous Communication and Device Characteristics

2019 ◽  
Vol 8 (9) ◽  
pp. 1631-1635
Keyword(s):  
Load Balancing ◽  
Response Time ◽  
Data Center ◽  
Data Centers ◽  
Cloud Data ◽  
Heterogeneous Device ◽  
Cloud Data Centers ◽  
Service Broker ◽  
Load Balancing Algorithm ◽  
Machine Allocation

Load balancing algorithms and service broker policies plays a crucial role in determining the performance of cloud systems. User response time and data center request servicing time are largely affected by the load balancing algorithms and service broker policies. Several load balancing algorithms and service broker polices exist in the literature to perform the data center allocation and virtual machine allocation for the given set of user requests. In this paper, we investigate the performance of equally spread current execution (ESCE) based load balancing algorithm with closest data center(CDC) service broker policy in a cloud environment that consists of homogeneous and heterogeneous device characteristics in data centers and heterogeneous communication bandwidth that exist between different regions where cloud data centers are deployed. We performed a simulation using CloudAnalyst an open source software with different settings of device characteristics and bandwidth. The user response time and data center request servicing time are found considerably less in heterogeneous environment.

scholarly journals Simulation and performance assessment of a modified throttled load balancing algorithm in cloud computing environment

2022 ◽  
Vol 12 (2) ◽  
pp. 2087
Author(s):  
Noha G. Elnagar ◽  
Ghada F. Elkabbany ◽  
Amr A. Al-Awamry ◽  
Mohamed B. Abdelhalim
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Response Time ◽  
Processing Time ◽  
Virtual Machines ◽  
Active Monitoring ◽  
Load Fluctuation ◽  
Load Balancing Algorithm ◽  
And Performance ◽  
Load Balancer

<span lang="EN-US">Load balancing is crucial to ensure scalability, reliability, minimize response time, and processing time and maximize resource utilization in cloud computing. However, the load fluctuation accompanied with the distribution of a huge number of requests among a set of virtual machines (VMs) is challenging and needs effective and practical load balancers. In this work, a two listed throttled load balancer (TLT-LB) algorithm is proposed and further simulated using the CloudAnalyst simulator. The TLT-LB algorithm is based on the modification of the conventional TLB algorithm to improve the distribution of the tasks between different VMs. The performance of the TLT-LB algorithm compared to the TLB, round robin (RR), and active monitoring load balancer (AMLB) algorithms has been evaluated using two different configurations. Interestingly, the TLT-LB significantly balances the load between the VMs by reducing the loading gap between the heaviest loaded and the lightest loaded VMs to be 6.45% compared to 68.55% for the TLB and AMLB algorithms. Furthermore, the TLT-LB algorithm considerably reduces the average response time and processing time compared to the TLB, RR, and AMLB algorithms.</span>

scholarly journals Energy-aware load balancing in distributed data centers

2020 ◽  
Author(s):  
Rodrigo A. C. Da Silva ◽  
Nelson L. S. Da Fonseca
Keyword(s):  
Energy Consumption ◽  
Load Balancing ◽  
Virtual Machine ◽  
Data Center ◽  
Data Centers ◽  
Energy Savings ◽  
Virtual Machines ◽  
Distributed Data ◽  
Energy Aware ◽  
Cloud Data

This paper summarizes the dissertation ”Energy-aware load balancing in distributed data centers”, which proposed two new algorithms for minimizing energy consumption in cloud data centers. Both algorithms consider hierarchical data center network topologies and requests for the allocation of groups of virtual machines (VMs). The Topology-aware Virtual Machine Placement (TAVMP) algorithm deals with the placement of virtual machines in a single data center. It reduces the blocking of requests and yet maintains acceptable levels of energy consumption. The Topology-aware Virtual Machine Selection (TAVMS) algorithm chooses sets of VM groups for migration between different data centers. Its employment leads to relevant overall energy savings.

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.

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.

Efficient task scheduling on virtual machine in cloud computing environment

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mahfooz Alam ◽  
Mahak ◽  
Raza Abbas Haidri ◽  
Dileep Kumar Yadav
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Response Time ◽  
Virtual Machine ◽  
Task Allocation ◽  
Completion Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Content Type ◽  
Minimum Completion Time

Purpose Cloud users can access services at anytime from anywhere in the world. On average, Google now processes more than 40,000 searches every second, which is approximately 3.5 billion searches per day. The diverse and vast amounts of data are generated with the development of next-generation information technologies such as cryptocurrency, internet of things and big data. To execute such applications, it is needed to design an efficient scheduling algorithm that considers the quality of service parameters like utilization, makespan and response time. Therefore, this paper aims to propose a novel Efficient Static Task Allocation (ESTA) algorithm, which optimizes average utilization. Design/methodology/approach Cloud computing provides resources such as virtual machine, network, storage, etc. over the internet. Cloud computing follows the pay-per-use billing model. To achieve efficient task allocation, scheduling algorithm problems should be interacted and tackled through efficient task distribution on the resources. The methodology of ESTA algorithm is based on minimum completion time approach. ESTA intelligently maps the batch of independent tasks (cloudlets) on heterogeneous virtual machines and optimizes their utilization in infrastructure as a service cloud computing. Findings To evaluate the performance of ESTA, the simulation study is compared with Min-Min, load balancing strategy with migration cost, Longest job in the fastest resource-shortest job in the fastest resource, sufferage, minimum completion time (MCT), minimum execution time and opportunistic load balancing on account of makespan, utilization and response time. Originality/value The simulation result reveals that the ESTA algorithm consistently superior performs under varying of batch independent of cloudlets and the number of virtual machines’ test conditions.

A New Conception of Load Balancing in Cloud Computing Using Tasks Classification Levels

2018 ◽  
Vol 8 (4) ◽  
pp. 118-133 ◽  
Author(s):  
Fahim Youssef ◽  
Ben Lahmar El Habib ◽  
Rahhali Hamza ◽  
Labriji El Houssine ◽  
Eddaoui Ahmed ◽  
...  
Keyword(s):  
Load Balancing ◽  
Data Center ◽  
Execution Time ◽  
Data Centers ◽  
Virtual Machines ◽  
Service Providers ◽  
Cloud Service ◽  
Mathematical Functions ◽  
Worst Case ◽  
Cloud Users

Cloud users can have access to the service based on “pay as you go.” The daily increase of cloud users may decrease the performance, the availability and the profitability of the material and software resources used in cloud service. These challenges were solved by several load balancing algorithms between the virtual machines of the data centers. In order to determine a new load balancing improvement; this article's discussions will be divided into two research axes. The first, the pre-classification of tasks depending on whether their characteristics are accomplished or not (Notion of Levels). This new technique relies on the modeling of tasks classification based on an ascending order using techniques that calculate the worst-case execution time (WCET). The second, the authors choose distributed datacenters between quasi-similar virtual machines and the modeling of relationship between virtual machines using the pre-scheduling levels is included in the data center in terms of standard mathematical functions that controls this relationship. The key point of the improvement, is considering the current load of the virtual machine of a data center and the pre-estimation of the execution time of a task before any allocation. This contribution allows cloud service providers to improve the performance, availability and maximize the use of virtual machines workload in their data centers.

OpenFlow-Based Global Load Balancing in Fat-Tree Networks

2014 ◽  
Vol 989-994 ◽  
pp. 4794-4798 ◽  
Author(s):  
Yu Wen Wu ◽  
Wei Zhang
Keyword(s):  
Load Balancing ◽  
Data Center ◽  
Essential Role ◽  
Data Centers ◽  
Cloud Services ◽  
Tree Topology ◽  
The Self ◽  
Internal Load ◽  
Tree Networks ◽  
Load Balancing Algorithm

Cloud services have been explosively popular over the last decade. And data centers play an essential role in providing cloud services. Inside a data center, any server instance has the chance to inject traffic of various applications into the network. Yet how to balance the enormous internal load to make the best of data center network is a highly prioritized problem to be solved. To provide balanced traffic in data centers, this paper proposes an OpenFlow-based GLB load balancing algorithm in data center fat-tree networks. GLB uses a path-related weight to select path. This weight indicates how balanced of a path. We implement GLB algorithm as a module in an openflow controller platform, POX. On the self-defined modified mininet emulation platform, we conduct experiments in a fat-tree topology environment running random traffic to generate performance data. Experiment results demonstrate that our proposed GLB algorithm outperforms DLB algorithm in terms of load balancing.

Sign in / Sign up

Export Citation Format

Share Document