<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">infojournal</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика и образование</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics and education</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">0234-0453</issn><issn pub-type="epub">2658-7769</issn><publisher><publisher-name>Publishing House Education and Informatics</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.32517/0234-0453-2025-40-2-79-87</article-id><article-id custom-type="elpub" pub-id-type="custom">infojournal-1266</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАТИЗАЦИЯ ОБРАЗОВАНИЯ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATIZATION OF EDUCATION</subject></subj-group></article-categories><title-group><article-title>Анализ современных подходов к балансировке нагрузки серверных кластеров в образовательных информационных системах и соответствующих алгоритмов</article-title><trans-title-group xml:lang="en"><trans-title>Analysis of modern approaches to load balancing of server clusters in educational information systems and corresponding algorithm</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0003-7946-9302</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Сущеня</surname><given-names>Р. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Suschenya</surname><given-names>R. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Сущеня Роман Валерьевич, аспирант кафедры управления информацией в технических системах, факультет информационных технологий; разработчик,</p><p>г. Москва.</p></bio><bio xml:lang="en"><p>Roman V. Suschenya, Postgraduate Student at the Department of Information Control in Technical Systems, Faculty of Information Technologies; Software Developer,</p><p>Moscow</p></bio><email xlink:type="simple">newromeones@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0006-9112-8182</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Петров</surname><given-names>В. Е.</given-names></name><name name-style="western" xml:lang="en"><surname>Petrov</surname><given-names>V. E.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Петров Валерий Евгеньевич, канд. тех. наук, доцент, доцент кафедры управления информацией в технических системах, факультет информационных технологий,</p><p>г. Москва.</p></bio><bio xml:lang="en"><p>Valery E. Petrov, Candidate of Sciences (Engineering), Docent, Associate Professor at the Department of Information Control in Technical Systems, Faculty of Information Technologies,</p><p>Moscow.</p></bio><email xlink:type="simple">v.petrov@stankin.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Московский государственный технологический университет «Станкин»; Фирма «1С»<country>Россия</country></aff><aff xml:lang="en">Moscow State Technological University “STANKIN”; 1C Company<country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru">Московский государственный технологический университет «Станкин»<country>Россия</country></aff><aff xml:lang="en">Moscow State Technological University “STANKIN”<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>22</day><month>07</month><year>2025</year></pub-date><volume>40</volume><issue>2</issue><fpage>79</fpage><lpage>87</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Сущеня Р.В., Петров В.Е., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Сущеня Р.В., Петров В.Е.</copyright-holder><copyright-holder xml:lang="en">Suschenya R.V., Petrov V.E.</copyright-holder><license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://info.infojournal.ru/jour/article/view/1266">https://info.infojournal.ru/jour/article/view/1266</self-uri><abstract><p>Системы управления обучением (англ. Learning Management System, LMS) играют ключевую роль в образовательном процессе, предоставляя студентам разнообразные виды образовательного контента, а преподавателям — инструменты для контроля знаний обучающихся и оценки прогресса. Однако с увеличением числа студентов возрастает и нагрузка на каналы передачи данных, что может привести к снижению качества обучения. Чтобы решить эту проблему, требуется комплексно подойти к проблеме балансировки нагрузки кластера серверов образовательных платформ.</p><p>В статье рассмотрены основные существующие алгоритмы балансировки, даны их комплексное сравнение и оценка применимости к образовательным платформам. Особое внимание уделено сетям доставки контента (англ. Content Delivery Network, CDN) и их важной роли в этом процессе. Проанализированы современные тенденции интеграции балансировщика с облачными технологиями, выделена особая важность интеллектуального управления кешированием и оркестрации контейнеров как одного из основных способов увеличения скорости работы LMS и их отказоустойчивости. Предложена архитектура кластеров серверов «1С:Предприятие 8» с практическими схемами построения масштабируемых инфраструктур для онлайн-обучения.</p></abstract><trans-abstract xml:lang="en"><p>Learning Management Systems (LMS) play a critical role in the educational process, providing students with a variety of educational content, and teachers with tools for monitoring students’ knowledge and assessing progress. However, as the number of students increases, the load on data transmission channels also increases, potentially leading to a decline in the quality of education. To solve this problem, a comprehensive approach to load balancing within server clusters of educational platforms is required.</p><p>The article reviews the main existing load balancing algorithms, provides a comparative analysis, and assesses their applicability to educational platforms. Particular attention is paid to Content Delivery Networks (CDN) and their critical role in the process. Modern trends in integrating load balancers with cloud technologies are analyzed, emphasizing the importance of intelligent cache management and container orchestration as key methods for increasing the performance and fault tolerance of LMS platforms. A server cluster architecture based on 1C:Enterprise 8 is proposed, along with practical schemes for building scalable infrastructures for online learning.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>кластеры серверов</kwd><kwd>балансировка нагрузки</kwd><kwd>LMS</kwd><kwd>CDN</kwd><kwd>алгоритмы распределения</kwd><kwd>отказоустойчивость образовательных систем</kwd><kwd>облачная оркестрация</kwd><kwd>«1С:Предприятие 8»</kwd></kwd-group><kwd-group xml:lang="en"><kwd>server clusters</kwd><kwd>load balancing</kwd><kwd>LMS</kwd><kwd>CDN</kwd><kwd>distribution algorithms</kwd><kwd>fault tolerance of educational systems</kwd><kwd>cloud orchestration</kwd><kwd>1C:Enterprise 8</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Nagelli A., Yadav N. K. Efficiency unveiled: Comparative analysis of load balancing algorithms in cloud environments. International Journal of Information Technology and Management. 2024;18(2):142–147. DOI: 10.29070/pb64mp50.</mixed-citation><mixed-citation xml:lang="en">Nagelli A., Yadav N. K. Efficiency unveiled: Comparative analysis of load balancing algorithms in cloud environments. International Journal of Information Technology and Management. 2024;18(2):142–147. DOI: 10.29070/pb64mp50.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Пономаренко Д. Н. Обзор алгоритмов балансировки нагрузки в облачных вычислительных системах. Молодой ученый. 2024;(12(511)):21–30. EDN: WGCGDY.</mixed-citation><mixed-citation xml:lang="en">Ponomarenko D. N. Review of load balancing algorithms in cloud computing systems. Molodoj uchenyj. 2024;(12(511)):21–30. (In Russian.) EDN: WGCGDY.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Harjanti T. W., Setiyani H., Trianto J. Load balancing analysis using round-robin and least-connection algorithms for server service response time. Applied Technology and Computing Science Journal. 2022;5(2):40–49. DOI: 10.33086/atcsj.v5i2.3743.</mixed-citation><mixed-citation xml:lang="en">Harjanti T. W., Setiyani H., Trianto J. Load balancing analysis using round-robin and least-connection algorithms for server service response time. Applied Technology and Computing Science Journal. 2022;5(2):40–49. DOI: 10.33086/atcsj.v5i2.3743.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Katangur A., Akkaladevi S., Vivekanandhan S. Priority weighted round robin algorithm for load balancing in the cloud. 2022 IEEE 7th Int. Conf. on Smart Cloud (SmartCloud). IEEE; 2022:230–235. DOI: 10.1109/SmartCloud55982.2022.00044.</mixed-citation><mixed-citation xml:lang="en">Katangur A., Akkaladevi S., Vivekanandhan S. Priority weighted round robin algorithm for load balancing in the cloud. 2022 IEEE 7th Int. Conf. on Smart Cloud (SmartCloud). IEEE; 2022:230–235. DOI: 10.1109/SmartCloud55982.2022.00044.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Baihaqi M. R., Negara R. M., Tulloh R. Analysis of load balancing performance using round robin and IP hash algorithm on P4. 2022 5th Int. Seminar on Research of Information Technology and Intelligent Systems (ISRITI). IEEE; 2022:93–98. DOI: 10.1109/ISRITI56927.2022.10052975.</mixed-citation><mixed-citation xml:lang="en">Baihaqi M. R., Negara R. M., Tulloh R. Analysis of load balancing performance using round robin and IP hash algorithm on P4. 2022 5th Int. Seminar on Research of Information Technology and Intelligent Systems (ISRITI). IEEE; 2022:93–98. DOI: 10.1109/ISRITI56927.2022.10052975.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Kashani M. H., Mahdipour E. Load balancing algorithms in fog computing. IEEE Transactions on Services Computing. 2022;16(2):1505–1521. DOI: 10.1109/TSC.2022.3174475.</mixed-citation><mixed-citation xml:lang="en">Kashani M. H., Mahdipour E. Load balancing algorithms in fog computing. IEEE Transactions on Services Computing. 2022;16(2):1505–1521. DOI: 10.1109/TSC.2022.3174475.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Malathi K., Anandan R., Vijay J. F. Cloud environment task scheduling optimization of modified genetic algorithm. Journal of Internet Services and Information Security (JISIS). 2023;13(1):34–43. DOI: 10.58346/JISIS.2023.I1.004.</mixed-citation><mixed-citation xml:lang="en">Malathi K., Anandan R., Vijay J. F. Cloud environment task scheduling optimization of modified genetic algorithm. Journal of Internet Services and Information Security (JISIS). 2023;13(1):34–43. DOI: 10.58346/JISIS.2023.I1.004.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Gad A. G. Particle swarm optimization algorithm and its applications: a systematic review. Archives of computational methods in engineering. 2022;29(5):2531–2561. DOI: 10.1007/s11831-021-09694-4.</mixed-citation><mixed-citation xml:lang="en">Gad A. G. Particle swarm optimization algorithm and its applications: a systematic review. Archives of computational methods in engineering. 2022;29(5):2531–2561. DOI: 10.1007/s11831-021-09694-4.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang Y., Kong X. A particle swarm optimization algorithm with empirical balance strategy. Chaos, Solitons &amp; Fractals: X. 2023;10(11):100089. DOI: 10.1016/j.csfx.2022.100089.</mixed-citation><mixed-citation xml:lang="en">Zhang Y., Kong X. A particle swarm optimization algorithm with empirical balance strategy. Chaos, Solitons &amp; Fractals: X. 2023;10(11):100089. DOI: 10.1016/j.csfx.2022.100089.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Abualigah L., Sheikhan A., Ikotun A. M., Zitar R. A., Alsoud A. R., Al-Shourbaji I., Hussien A. G., Jia H. Particle swarm optimization algorithm: Review and applications. Elsevier BV; 2024:1–14. DOI: 10.1016/b978-0-443-13925-3.00019-4.</mixed-citation><mixed-citation xml:lang="en">Abualigah L., Sheikhan A., Ikotun A. M., Zitar R. A., Alsoud A. R., Al-Shourbaji I., Hussien A. G., Jia H. Particle swarm optimization algorithm: Review and applications. Elsevier BV; 2024:1–14. DOI: 10.1016/b978-0-443-13925-3.00019-4.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Zheng H., Guo J., Zhou Q., Chen Y. Application of improved ant colony algorithm in load balancing of software-defined networks. The Journal of Supercomputing. 2023;79(7):7438–7460. DOI: 10.1007/s11227-022-04957-8.</mixed-citation><mixed-citation xml:lang="en">Zheng H., Guo J., Zhou Q., Chen Y. Application of improved ant colony algorithm in load balancing of software-defined networks. The Journal of Supercomputing. 2023;79(7):7438–7460. DOI: 10.1007/s11227-022-04957-8.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Deng X., Zeng S., Chang le, Wang Y., Wu X., Liang J., Ou J., Fan C. An ant colony optimization-based routing algorithm for load balancing in LEO satellite networks. Wireless Communications and Mobile Computing. 2022;2022(1):3032997. DOI: 10.1155/2022/3032997.</mixed-citation><mixed-citation xml:lang="en">Deng X., Zeng S., Chang le, Wang Y., Wu X., Liang J., Ou J., Fan C. An ant colony optimization-based routing algorithm for load balancing in LEO satellite networks. Wireless Communications and Mobile Computing. 2022;2022(1):3032997. DOI: 10.1155/2022/3032997.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Gures E., Shayea I., Ergen M., Bin Azmi M., El-Saleh A. Machine learning-based load balancing algorithms in future heterogeneous networks: A survey. IEEE Access. 2022;10(2):37689–37717. DOI: 10.1109/ACCESS.2022.3161511.</mixed-citation><mixed-citation xml:lang="en">Gures E., Shayea I., Ergen M., Bin Azmi M., El-Saleh A. Machine learning-based load balancing algorithms in future heterogeneous networks: A survey. IEEE Access. 2022;10(2):37689–37717. DOI: 10.1109/ACCESS.2022.3161511.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Taghizadeh M., Ahmadi M. A heuristic task scheduling algorithm for vehicular fog computing. 2024 8th Int. Conf. on Smart Cities, Internet of Things and Applications (SCIoT). IEEE; 2024:168–173. DOI: 10.1109/SCIoT62588.2024.10570144.</mixed-citation><mixed-citation xml:lang="en">Taghizadeh M., Ahmadi M. A heuristic task scheduling algorithm for vehicular fog computing. 2024 8th Int. Conf. on Smart Cities, Internet of Things and Applications (SCIoT). IEEE; 2024:168–173. DOI: 10.1109/SCIoT62588.2024.10570144.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Zeedan M., Attiya G., El-Fishawy N. Enhanced load balancing based on hybrid artificial bee colony with enhanced β-hill climbing in cloud. Mansoura Engineering Journal. 2023;48(3):11. DOI: 10.58491/2735-4202.3098.</mixed-citation><mixed-citation xml:lang="en">Zeedan M., Attiya G., El-Fishawy N. Enhanced load balancing based on hybrid artificial bee colony with enhanced β-hill climbing in cloud. Mansoura Engineering Journal. 2023;48(3):11. DOI: 10.58491/2735-4202.3098.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Rahman F., Titouna C., Naït-Abdesselam F. Scalable blockchain system for load balancing DNS servers using heuristic sharding. 2023 Fifth Int. Conf. on Blockchain Computing and Applications (BCCA). IEEE; 2023:420–425. DOI: 10.1109/BCCA58897.2023.10338848.</mixed-citation><mixed-citation xml:lang="en">Rahman F., Titouna C., Naït-Abdesselam F. Scalable blockchain system for load balancing DNS servers using heuristic sharding. 2023 Fifth Int. Conf. on Blockchain Computing and Applications (BCCA). IEEE; 2023:420–425. DOI: 10.1109/BCCA58897.2023.10338848.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Singh I. T., Singh T. R., Sinam T. Server load balancing with round robin technique in SDN. 2022 Int. Conf. on Decision Aid Sciences and Applications (DASA). IEEE; 2022:503–505. DOI: 10.1109/DASA54658.2022.9765287.</mixed-citation><mixed-citation xml:lang="en">Singh I. T., Singh T. R., Sinam T. Server load balancing with round robin technique in SDN. 2022 Int. Conf. on Decision Aid Sciences and Applications (DASA). IEEE; 2022:503–505. DOI: 10.1109/DASA54658.2022.9765287.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang P., li J., Tang Y., Wang H., Cao T. A novel, efficient, green and real-time load balancing algorithm for 5G network measurement report collecting clusters. Journal of Circuits, Systems and Computers. 2022;31(18):2250313. DOI: 10.1142/S0218126622503133.</mixed-citation><mixed-citation xml:lang="en">Zhang P., li J., Tang Y., Wang H., Cao T. A novel, efficient, green and real-time load balancing algorithm for 5G network measurement report collecting clusters. Journal of Circuits, Systems and Computers. 2022;31(18):2250313. DOI: 10.1142/S0218126622503133.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Papagianni C., Leivadeas A., Papavassiliou S. A cloud-oriented content delivery network paradigm: Modeling and assessment. IEEE Transactions on Dependable and Secure Computing. 2013;10(5):287–300. DOI: 10.1109/TDSC.2013.12.</mixed-citation><mixed-citation xml:lang="en">Papagianni C., Leivadeas A., Papavassiliou S. A cloud-oriented content delivery network paradigm: Modeling and assessment. IEEE Transactions on Dependable and Secure Computing. 2013;10(5):287–300. DOI: 10.1109/TDSC.2013.12.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Triukose S., Wen Zh., Rabinovich M. Measurement of the commercial content delivery network. Proc. 20th Int. Conf. on World Wide Web (WWW’11). New York, NY, USA, Association for Computing Machinery; 2011:467–476. DOI: 10.1145/1963405.1963472.</mixed-citation><mixed-citation xml:lang="en">Triukose S., Wen Zh., Rabinovich M. Measurement of the commercial content delivery network. Proc. 20th Int. Conf. on World Wide Web (WWW’11). New York, NY, USA, Association for Computing Machinery; 2011:467–476. DOI: 10.1145/1963405.1963472.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
