EXACT BOUNDARIES FOR THE EFFICIENCY OF THE ALGORITHMS FOR DISTRIBUTING REQUESTS BETWEEN SERVERS

UDC 519.687.1

  • Dubovik Marina Vladimirovna – Master’s degree student, the Department of Information Systems and Technologies. Belarusian State Technological University (13a, Sverdlova str., 220006, Minsk, Republic of Belarus). E-mail: dubovik@belstu.by

  • Smelov Vladimir Vladislavovich – PhD (Engineering), Associate Professor, Head of the Department of Information Systems and Technologies. Belarusian State Technological University (13a, Sverdlova str., 220006, Minsk, Republic of Belarus). E-mail: smw@belstu.by

  • Timonovich Georgy Leonidovich – PhD (Engineering), Associate Professor, the Department of Information Systems and Technologies. Belarusian State Technological University (13a, Sverdlova str., 220006, Minsk, Republic of Belarus). E-mail: tgl@hmti.ac.by

DOI: https://doi.org/10.52065/2520-6141-2021-248-2-80-86

Key words: load balancing algorithms, load balancing, efficiency evaluation, precise efficiency boundaries, requests distribution plan.

For citation: Dubovik M. V., Smelov V. V., Timonovich G. L. Exact boundaries of the efficiency of the algorithms for distributing requests between servers. Proceedings of BSTU, issue 3, Physics and Mathematics. Informatics, 2021, no. 2 (248), pp. 80–86 (In Russian). DOI: https://doi.org/10.52065/2520-6141-2021-248-2-80-86.

Abstract

The article is devoted to evaluating the efficiency of algorithms for dispatching http requests between servers. To evaluate the efficiency, it is proposed to find the theoretical maximum and minimum efficiency by constructing the exact upper and exact lower bounds for the efficiency of algorithms for distributing requests between servers. The main problem is plotting an accurate upper bound. In general, the calculation of the boundaries can be reduced to the construction and analysis of a set of rational plans for the distribution of requests from clients between the servers, the evaluation of the efficiency of the algorithms for the distribution of requests, and then finding of the efficiency extremum functions at each moment of time. The proposed method for calculating the exact boundaries of efficiency assumes that the configuration of the software system, the sequence of requests in time and their complexity are known. The algorithm used by the method for calculating the boundaries has exponential time complexity and is difficult to solve for real configurations of software systems. Thus, this method for evaluating the efficiency of algorithms for dispatching http requests is unsuitable for use in engineering problems.

Download

References

  1. Dubovik M. V., Smelov V. V. Mathematical model for analyzing algorithms for distributing requests between servers. Trudy BGTU [Proceedings of BSTU], issue 3, Physics and Mathematics. Informatics, 2021, no. 1 (242), pp. 31–35 (In Russian).
  2. 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.
14.09.2021