MATHEMATICAL MODEL FOR ANALYZING ALGORITHMS FOR DISTRIBUTING REQUESTS BETWEEN SERVERS
UDC 519.687.1
Key words: load balancing, mathematical model, simulation model, Round Robin, The Least Bandwidth Method.
For citation: Dubovik M. V., Smelov V. V. Mathematical model for analyzing algorithms for distributing requests between servers. Proceedings of BSTU, issue 3, Physics and Mathematics. Informatics, 2021, no. 1 (242), pp. 31–35 (In Russian). DOI: https://doi.org/10.52065/2520-2669-2021-242-2-31-35.
Abstract
The article is devoted to the development of a mathematical model of a software system with a microservice architecture. The model is designed to analyze the efficiency of algorithms for distributing incoming requests among several instances of stand-alone server components. Using a simulation implementation of the model, an experimental study of two load balancing algorithms was carried out: the Round Robin algorithm, which evenly distributes requests to servers, and the Least Bandwidth Method, which allows you to distribute requests across servers based on their load. Unlike the Round Robin static load balancing algorithm, The Least Bandwidth Method dynamic algorithm takes into account the current load of each server in the system. With this approach, it is possible to dynamically distribute incoming requests depending on the server load in order to speed up processing. Such algorithms give good results, especially when the execution time varies greatly from one task to another.
References
- Stuti D., Prashant M. Utilizing Round Robin Concept for Load Balancing Algorithm at Virtual Machine Level in Cloud Computing. International Journal of Computer Applications. 2014, vol. 94, no. 4, pp. 23–29.
- Vartanyan S. O., Sokol V. V., Lesnaya N. S. Methods of loading balancing in Cloud systems. Kіbernetika ta sistemniy analіz [Cybernetics and System Analysis], 2012, no. 3, pp. 101–103 (In Russian).
