Comparative Analysis of Load Balancing with Shortest Delay and Least Connection Methods on Software Defined Network

Closed

Heru Nurwarsito, Handy Kurniawan Ponco Widagdo

2023 ACM International Conference Proceeding Series Conference paper Cited by 4 Quartile

Abstract

Software-Defined Network (SDN) is an essential component of network management, and load balancing is necessary to ensure proper network functionality. This research compares the performance of two load-balancing algorithms, Shortest Delay and Least Connection, which have not been previously compared. The research uses Mininet and RYU simulators as controllers and Flask as a web server. HTTPERF tools are used to test the algorithms with three parameters: CPU Usage, Throughput, and Response Time. The tests are conducted with 600, 900, and 1,500 connections for 150 seconds. The results show that the Shortest Delay algorithm has lower CPU Usage for all connection tests and lower Response Time for low and medium connection tests. However, the Least Connection algorithm is superior for high connection tests due to its lower Response Time. This research provides valuable insights into the performance of these two load-balancing algorithms on SDN. © 2023 ACM.

Affiliations

Department of Informatics Engineering, University of Brawijaya, Malang, Indonesia

Research at a Glance

Premium content — register to unlock

Research at a Glance

Register to unlock

Topics & SDG Alignment

Premium content — register to unlock

Topics & SDG Alignment

Register to unlock

Collaboration

Premium content — register to unlock

Collaboration

Register to unlock

Author Profile (Selected)

Premium content — register to unlock

Author Profile (Selected)

Register to unlock

References Overview

Premium content — register to unlock

References Overview

Register to unlock

Journal & Source

Premium content — register to unlock

Journal & Source

Register to unlock

Metadata & Integrity

Premium content — register to unlock

Metadata & Integrity

Register to unlock