Web Server Load Balancing Mechanism with Least Connection Algorithm and Multi-Agent System
DOI:
https://doi.org/10.21512/commit.v17i2.8872Keywords:
Web Server, Load Balancing Mechanism, Least Connection Algorithm, Multi-Agent SystemAbstract
Demands for information over the Internet massively increase through the continuous expansion of website applications. Therefore, generating powerful and efficient server architecture for web servers is a must to satisfy Internet users and avoid the overloaded system. The research focuses on developing a new mechanism for load balancing to distribute incoming HTTP requests in website applications by combining the Least Connection algorithm and Multi-Agent System (LC-MAS). The proposed mechanism distributes the request based on load condition and the fewest number of active connections. The research applies virtualization technology to build servers on this proposed mechanism. The architecture is built inside a physical server with Proxmox as virtualization management and Linux Debian 7.11 as an operating system. Then, the research is tested in two scenarios (LCMAS and LC) using 500, 1,000, and 1,500 requests. The performance of this proposed mechanism is measured through the values of average response time, throughput, and error percentage. The results show that the proposed mechanism (LC-MAS) distributes the workload more equally than LC, with an average response time for 1,500 requests of 1338.8 milliseconds, 20.07% error, and 125 transactions per second. The LC-MAS makes the website application performance much better when the request increases. The LC-MAS helps in the utilization of system resources and improves system robustness.
Plum Analytics
References
D. Arnaldy and T. S. Hati, “Performance analysis of reverse proxy and web application firewall with telegram bot as attack notification on web server,” in 2020 3rd International Conference on Computer and Informatics Engineering (IC2IE). Yogyakarta, Indonesia: IEEE, Sept. 15–16, 2020, pp. 455–459.
M. R. M. Bella, M. Data, and W. Yahya, “Web server load balancing based on memory utilization using Docker swarm,” in 2018 International Conference on Sustainable Information Engineering and Technology (SIET). Malang, Indonesia: IEEE, Nov. 10–12, 2018, pp. 220–223.
N. K. C. Das, M. S. George, and P. Jaya, “Incorporating weighted round robin in honeybee algorithm for enhanced load balancing in cloud environment,” in 2017 International Conference on Communication and Signal Processing (ICCSP). Chennai, India: IEEE, April 6–8, 2017, pp. 0384–0389.
L. H. Pramono, R. C. Buwono, and Y. G. Waskito, “Round-Robin algorithm in HAProxy and Nginx load balancing performance evaluation: A review,” in 2018 International Seminar on Research of Information Technology and Intelligent Systems (ISRITI). Yogyakarta, Indonesia: IEEE, Nov. 21–22, 2018, pp. 367–372.
P. Geetha and C. R. R. Robin, “A comparativestudy of load-cloud balancing algorithms in cloud environments,” in 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS). Chennai, India: IEEE, Aug. 1–2, 2017, pp. 806–810.
K. S. Chaudhury, S. Pattnaik, H. S. Moharana, and S. Pradhan, “Static load balancing algorithms in cloud computing: Challenges and solutions,” in Soft Computing and Signal Processing: Proceedings of 2nd ICSCSP 2019. Hyderabad, India: Springer, June 21–22, 2020, pp. 259–265.
S. Jain and A. K. Saxena, “A survey of load balancing challenges in cloud environment,” in 2016 International Conference System Modeling & Advancement in Research Trends (SMART). Moradabad, India: IEEE, Nov. 25–27, 2016, pp. 291–293.
M. Afriansyah, M. Somantri, and M. A. Riyadi, “Model of load balancing using reliable algorithm with multi-agent system,” in IOP Conference Series: Materials Science and Engineering, vol. 190, no. 1. IOP Publishing, 2017, pp. 1–8.
M. E. Mustafa, “Load balancing algorithms Round-Robin (RR), leastconnection, and least loaded efficiency,” Computer Science & Telecommunications, vol. 51, no. 1, pp. 25–29, 2017.
S. Ajitha, “Methodology for load balancing in multi-agent system using SPE approach,” in Security issues and privacy concerns in Industry 4.0 applications. Wiley Online Library, 2021, ch. 11, pp. 207–227.
S. K. Saeid and T. A. Yahiya, “Load balancing evaluation tools for a private cloud: A comparative study,” ARO-The Scientific Journal of Koya University, vol. 6, no. 2, pp. 13–19, 2018.
I. K. A. and Y. Rosmansyah, “Web server farm design using Personal Computer (PC) desktop,” in 2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE). Bali, Indonesia: IEEE, July 24–26, 2018, pp. 106–111.
J. M. Faustina, B. Pavithra, S. Suchitra, and P. Subbulakshmi, “Load balancing in cloud environment using self-governing agent,” in 2019 3rd International Conference on Electronics, Communication and Aerospace Technology (ICECA). Coimbatore, India: IEEE, June 12–14, 2019, pp. 480–483.
L. Zhu, J. Cui, and G. Xiong, “Improved dynamic load balancing algorithm based on leastconnection scheduling,” in 2018 IEEE 4th Information Technology and Mechatronics Engineering Conference (ITOEC). Chongqing, China: IEEE, Dec. 14–16, 2018, pp. 1858–1862.
J. Cao, Y. Sun, X. Wang, and S. K. Das, “Scalable load balancing on distributed web servers using mobile agents,” Journal of Parallel and Distributed Computing, vol. 63, no. 10, pp. 996–1005, 2003.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 Afiyah Rifkha Rahmika, Zulkifli Tahir, Ady Wahyudi Paundu, Zahir Zainuddin
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
USER RIGHTS
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows: Creative Commons Attribution-Share Alike (CC BY-SA)