scholarly journals Computer Networks Optimization using Load Balancing Algorithms on the Citrix ADC Virtual Server

2021 ◽  
Vol 6 (1) ◽  
pp. 103
Author(s):  
Hardiyan Kesuma Ramadhan ◽  
Sukma Wardhana
Keyword(s):  
Load Balancing ◽  
Response Time ◽  
Large Scale ◽  
Round Robin ◽  
It Infrastructure ◽  
Digital Era ◽  
Traffic Distribution ◽  
Best Response ◽  
Cpu Utilization ◽  
Load Balancer

In the digital era and the outbreak of the COVID-19 pandemic, all activities are online. If the number of users accessing the server exceeds IT infrastructure, server down occurs. A load balancer device is required to share the traffic request load. This study compares four algorithms on Citrix ADC VPX load balancer: round-robin, least connection, least response time and least packet using GNS3. The results of testing response time and throughput parameters show that the least connection algorithm is superior. There were a 33% reduction in response time and a 53% increase in throughput. In the service hits parameter, the round-robin algorithm has the evenest traffic distribution. While least packet superior in CPU utilization with 76% reduction. So algorithm with the best response time and throughput is the least connection. The algorithm with the best service hits is round-robin. Large scale implementation is recommended using the least connection algorithm regarding response time and throughput. When emphasizing evenest distribution, use a round-robin algorithm.

A Conceptual Framework Towards Implementing a Cloud-Based Dynamic Load Balancer Using a Weighted Round-Robin Algorithm

2020 ◽  
Vol 10 (2) ◽  
pp. 22-35 ◽  
Author(s):  
Sudipta Sahana ◽  
Tanmoy Mukherjee ◽  
Debabrata Sarddar
Keyword(s):  
Load Balancing ◽  
Response Time ◽  
Dynamic Load ◽  
Processing Time ◽  
Round Robin ◽  
Cloud Infrastructure ◽  
Previous Survey ◽  
Survey Papers ◽  
Multiple Servers ◽  
Load Balancer

Cloud load balancing has become one of the most vital aspects of Cloud computing that has captured the attention of IT organizations and business firms in recent years. Among the issues related to this particular aspect, one such issue which needs to be addressed is the issue of effectively serving the clients' requests among multiple servers using an appropriate load balancer. Previous survey papers discussed various issues of cloud load balancing and accordingly devised various methods and techniques to address those issues with the objectives of reduction of processing time and response time along with optimization of costs. In this article, we have discussed an effective load balancing technique using the weighted Round-Robin algorithm which can process the client requests among multiple servers with minimal response time. Considering all these aspects, a cloud-based dynamic load balancer is being used to solve the problem of load balancing in the cloud infrastructure.

Analisis Mirror Server menggunakan Load Balancing pada Jaringan Area Lokal

2020 ◽  
Vol 10 (4) ◽  
pp. 173-178
Author(s):  
Alfian Nurdiansyah ◽  
Nugroho Suharto ◽  
Hudiono Hudiono
Keyword(s):  
Load Balancing ◽  
Load Balance ◽  
Round Robin ◽  
Data Set ◽  
Load Balancer

Server merupakan serbuah sistem yang memberikan layanan tertentu pada suatu jaringan komputer. Server mempunyai sistem operasi sendiri yang disebut sistem operasi jaringan. Server juga mengontrol semua akses terhadap jaringan yang ada didalamnya.  Agar membantu tugas server, dibuatlah sistem mirroring server dimana server tersebut menduplikasi sebuah data set atau tiruan persis dari sebuah server yang menyediakan berbagai informasi. Mirror server atau disebut juga sinkronisasi server merupakan duplikat dari suatu server. Untuk menambah kinerja dari server maka dibutuhkan load balancer. Load balancing adalah teknik untuk mendistribusikan internet dua jalur koneksi secara seimbang. Dengan penerapan load balancing trafik akan berjalan lebih optimal, memaksimalkan throughput dan menghindari overload pada jalur koneksi. Iptables digunakan untuk memfilter IP sehigga client mengakses server sesuai dengan zona server yang paling dekat. Sehingga load balance yang dipadukan dengan iptables dapat membuat kinerja server menjadi lebih ringan. Masalah yang sering terjadi adalah ketika banyaknya client yang mengakses sebuah server maka server akan overload dan mengakibatkan kinerja server menjadi berat karena padatnya trafik. Client yang mengakses juga mendapatkan efek dari hal tersebut yaitu akses yang lama. Dari hasil penelitian tentang perpaduan antara load balance dan iptables didapati bahwa load balance dengan algoritma round robin rata-rata delay yang didapatkan untuk server1 yaitu 0,149 detik dan 0,19122. Server2 rata-rata delay yang didapatkan 0,161 detik dan 0,012 detik.

scholarly journals Support Vector Regression based Mapreduce Throttled Load Balancer for Data Centers

2019 ◽  
Vol 9 (1) ◽  
pp. 4162-4171
Keyword(s):  
Big Data ◽  
Load Balancing ◽  
Response Time ◽  
Support Vector Regression ◽  
Virtual Machine ◽  
Data Centers ◽  
Migration Time ◽  
Support Vector ◽  
Load Balancer ◽  
Cloud User

The process of analyzing big data and other valuable information is a significant process in the cloud. Since big data processing utilizes a large number of resources for completing certain tasks. Therefore, the incoming tasks are allocated with better utilization of resources to minimize the workload across the server in the cloud. The conventional load balancing technique failed to balance the load effectively among data centers and dynamic QoS requirements of big data application. In order to improve the load balancing with maximum throughput and minimum makespan, Support Vector Regression based MapReduce Throttled Load Balancing (SVR-MTLB) technique is introduced. Initially, a large number of cloud user requests (data/file) are sent to the cloud server from different locations. After collecting the cloud user request, the SVR-MTLB technique balances the workload of the virtual machine with the help of support vector regression. The load balancer uses the index table for maintaining the virtual machines. Then, map function performs the regression analysis using optimal hyperplane and provides three resource status of the virtual machine namely overloaded, less loaded and balanced load. After finding the less loaded VM, the load balancer sends the ID of the virtual machine to the data center controller. The controller performs migration of the task from an overloaded VM to a less loaded VM at run time. This in turn assists to minimize the response time. Experimental evaluation is carried out on the factors such as throughput, makespan, migration time and response time with respect to a number of tasks. The experimental results reported that the proposed SVR-MTLB technique obtains high throughput with minimum response time, makespan as well as migration time than the state -of -the -art methods.

scholarly journals IMPLEMENTING LOAD BALANCING BY MODIFIED WEIGHTED ROUND ROBIN-RETRIEVE PACKET ALGORITHM ON THE SOFTWARE-DEFINED NETWORKING

2018 ◽  
Vol 3 (2) ◽  
Author(s):  
ZAINAL ABIDIN ◽  
Tutuk Indriyani ◽  
Danang Haryo Sulaksono
Keyword(s):  
Load Balancing ◽  
Response Time ◽  
Software Defined Networking ◽  
Round Robin ◽  
Traffic Load ◽  
Single Server ◽  
Average Response ◽  
Average Response Time ◽  
Time Limits

Client’s request for traffic problems is so huge that causes the single server difficult in handling the traffic load. Therefore, the system of load balancing is required as it is a technique to equally distribute the traffic load on the two or more connection lines so that the traffic can run optimally. Thus, the load balancing is crucial to implement by using Modified Weighted Round Robin-Retrieve Packet on the Software-Defined Networking. Based on the parameter of average response-time in time limits 0.1, 0.2, and 0.3 seconds, the scores were 0.016-0.04, 0.02-0.04, and 0.014-0.032 seconds consecutively. Based on the parameter of data transaction per second in time limits 0.1; 0.2, and 0.3 seconds, the scores respectively were 49.614-111.306, 41.678-107.032, and 37.806-102.84 data transaction/second. 

scholarly journals Analisis Perbandingan Algoritma Static Round-Robin dengan Least-Connection Terhadap Efisiensi Load Balancing pada Load Balancer Haproxy

2019 ◽  
Vol 4 (1) ◽  
pp. 70-75
Author(s):  
Hasta Triangga ◽  
Ilham Faisal ◽  
Imran Lubis
Keyword(s):  
Load Balancing ◽  
Operating Systems ◽  
Web Server ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Average Throughput ◽  
Total Delay ◽  
Average Percentage ◽  
Cpu Usage ◽  
Load Balancer

In IT networking, load balancing used to share the traffic between backend servers. The idea is to make effective and efficient load sharing. Load balancing uses scheduling algorithms in the process includes Static round-robin and Least-connection algorithm. Haproxy is a load balancer that can be used to perform the load balancing technique and run by Linux operating systems. In this research, Haproxy uses 4 Nginx web server as backend servers. Haproxy act as a reverse proxy which accessed by the client while the backend servers handle HTTP requests. The experiment involves 20 Client PCs that are used to perform HTTP requests simultaneously, using the Static round-robin algorithm and Least-connection on the haproxy load balancer alternately. When using Static round-robin algorithm, the results obtained average percentages of CPU usage successively for 1 minute; 5 minutes; and 15 minutes are; 0.1%; 0.25%; and 1.15% with average throughput produced is 14.74 kbps. Average total delay produced 64.3 kbps. The average total delay and jitter is 181.3 ms and 11.1 ms, respectively. As for the Least-connection algorithm average percentage obtained successively for 1 minute; 5 minutes; and 15 minutes are 0.1%; 0.3%; and 1.25% with the average throughput produced is 14.66 kbps. The average total delay and jitter is 350.3 ms and 24.5 ms, respectively. It means Static round-robin algorithm is more efficient than the algorithms Least-connection because it can produce a greater throughput with less CPU load and less total delay.

The Multi-Server Load Balancing Systems Research in Large-Website Construction

2015 ◽  
Vol 713-715 ◽  
pp. 2378-2381 ◽  
Author(s):  
Ming Hai Yao ◽  
Na Wang ◽  
Jin Shan Li
Keyword(s):  
Load Balancing ◽  
Response Time ◽  
Cluster Method ◽  
System Response ◽  
Oracle Database ◽  
Server Cluster ◽  
Systems Research ◽  
Cpu Utilization ◽  
System Response Time ◽  
Load Balancing Algorithm

The load balancing method based on the Linux server cluster is proposed in large-website construction. The load balancing of server cluster is achieved by SSH framework, Oracle database and Ajax technologies. The load balancing of server cluster method can’t only improve performance, scalability, availability of system and reduce the execution time of multi-tasking but also eliminates network bottlenecks and improve the flexibility and reliability of the network. In order to verify the validity of the algorithm, large number of experimental data is used in the experiment. We propose a method of load balancing algorithm is compared with the traditional non-load-balancing algorithm for CPU utilization and system response time in the experiments. The experimental results show that the load balancing technology can reduce system response time and CPU utilization of server.

scholarly journals Experimental Setup for Investigating the Efficient Load Balancing Algorithms on Virtual Cloud

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7342
Author(s):  
Bhavya Alankar ◽  
Gaurav Sharma ◽  
Harleen Kaur ◽  
Raul Valverde ◽  
Victor Chang
Keyword(s):  
Load Balancing ◽  
High Performance ◽  
Round Robin ◽  
Experimental Setup ◽  
Cloud Infrastructure ◽  
Use Of Resources ◽  
Virtualization Technology ◽  
Distribution Of Resources ◽  
Load Balancer ◽  
Performance Computing

Cloud computing has emerged as the primary choice for developers in developing applications that require high-performance computing. Virtualization technology has helped in the distribution of resources to multiple users. Increased use of cloud infrastructure has led to the challenge of developing a load balancing mechanism to provide optimized use of resources and better performance. Round robin and least connections load balancing algorithms have been developed to allocate user requests across a cluster of servers in the cloud in a time-bound manner. In this paper, we have applied the round robin and least connections approach of load balancing to HAProxy, virtual machine clusters and web servers. The experimental results are visualized and summarized using Apache Jmeter and a further comparative study of round robin and least connections is also depicted. Experimental setup and results show that the round robin algorithm performs better as compared to the least connections algorithm in all measuring parameters of load balancer in this paper.

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 E-Voting Infrastructure System for Indonesia

2019 ◽  
Vol 9 (1) ◽  
pp. 761-763
Keyword(s):  
Load Balancing ◽  
Similar Data ◽  
It Infrastructure ◽  
Digital Era ◽  
Proposed Model ◽  
Infrastructure System ◽  
Block Chain ◽  
Democratic Country

In digital era, Indonesia as democratic country needs to implement e-voting for presidential and governor election. Some countries have implement e-voting and two of them are more populated than Indonesia. E-voting can make voting process and vote distribution better. In this paper we proposed IT infrastructure for e-voting using load balancing, cryptography, and block chain. Also this proposed model can be discussed further about application and system replication to produce similar data from all servers.

Sign in / Sign up

Export Citation Format

Share Document