<?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">vdgtu</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Дагестанского государственного технического университета. Технические науки</journal-title><trans-title-group xml:lang="en"><trans-title>Herald of Dagestan State Technical University. Technical Sciences</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2073-6185</issn><issn pub-type="epub">2542-095X</issn><publisher><publisher-name>Daghestan State Technical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.21822/2073-6185-2026-53-1-186-192</article-id><article-id custom-type="elpub" pub-id-type="custom">vdgtu-2020</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>INFORMATION TECHNOLOGY AND TELECOMMUNICATIONS</subject></subj-group></article-categories><title-group><article-title>Математическая модель микросервисной системы на основе байесовской сети для задачи оптимизации конфигурации с учётом каскадных зависимостей</article-title><trans-title-group xml:lang="en"><trans-title>Mathematical model of a microservice system based on a Bayesian network for the task of optimizing configuration taking into account cascading dependencies</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-6110-1227</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>Chetvertukhin</surname><given-names>V. R.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Четвертухин Виктор Романович, аспирант, кафедра программного обеспечения вычислительной техники и автоматизированных систем,</p><p>308012, г. Белгород, ул. Костюкова, 46</p></bio><bio xml:lang="en"><p>Viktor R. Chetvertukhin, Graduate Student, Department of Computer Engineering and Automated Systems Software; </p><p>46 Kostyukova St., Belgorod 308012</p></bio><email xlink:type="simple">victor.chet@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белгородский государственный технологический университет имени В. Г. Шухова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>V. G. Shukhov Belgorod State Technological University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>30</day><month>04</month><year>2026</year></pub-date><volume>53</volume><issue>1</issue><fpage>186</fpage><lpage>192</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Четвертухин В.Р., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Четвертухин В.Р.</copyright-holder><copyright-holder xml:lang="en">Chetvertukhin V.R.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" 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://vestnik.dgtu.ru/jour/article/view/2020">https://vestnik.dgtu.ru/jour/article/view/2020</self-uri><abstract><sec><title>Цель</title><p>Цель. Целью работы является разработка математической модели микросервисной системы для оптимизации конфигурации этой системы.</p></sec><sec><title>Метод</title><p>Метод. Для моделирования использовались методы теории графов, теории вероятностей и теории принятия решений, такие вероятностно-графические модели, как байесовские сети, сочетающие элементы этих теорий.</p></sec><sec><title>Результат</title><p>Результат. Описана математическая модель микросервисной системы на основе байесовской сети; предложен модифицированный алгоритм вывода в этой сети и алгоритм оптимизации конфигурации с учётом каскадов. Оценена временная сложность вывода оптимальной конфигурации. Проведён эксперимент применения предложенных алгоритмов на модельной системе из 15 микросервисов, который показал, что конфигурация, выбираемая с помощью предложенной модели и алгоритмов, имеет наименьший процент времени, когда микросервисная система находилась в состоянии нарушения параметров соглашения об уровне обслуживания (Service Level Agreement, SLA).</p></sec><sec><title>Вывод</title><p>Вывод. Предложенная модель и алгоритмы могут помочь в выборе более оптимальной конфигурации благодаря учёту каскадных эффектов и одновременному учёту дискретных и непрерывных параметров. Для дополнительных выводов необходимо провести эксперимент по интеграции модели с существующими системами оркестрации.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objective</title><p>Objective. The aim of the work is to develop a mathematical model of a microservice system to optimize the configuration of this system.</p></sec><sec><title>Method</title><p>Method. Methods of graph theory, probability theory, and decision theory were used for modeling, namely probabilistic graphical models such as Bayesian networks that combine elements of all these theories.</p></sec><sec><title>Result</title><p>Result. A mathematical model of a microservice system based on a Bayesian network is described. A modified inference algorithm for this network and a configuration optimization algorithm taking cascades into account are proposed. The time complexity of inferring the optimal configuration is estimated. An experiment applying the proposed algorithms to a model system of 15 microservices was conducted, demonstrating that the configuration selected using the proposed model and algorithms has the lowest percentage of time the microservice system was in a state of service level agreement violation.</p></sec><sec><title>Conclusion</title><p>Conclusion. The model and algorithms will help in selecting the optimal configuration by taking into account cascading effects, discrete and continuous parameters. Further conclusions should be drawn by integrating the model with existing orchestration systems.</p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>микросервисная архитектура</kwd><kwd>байесовские сети</kwd><kwd>каскадные зависимости</kwd><kwd>вероятностный вывод</kwd><kwd>оптимизация конфигурации</kwd></kwd-group><kwd-group xml:lang="en"><kwd>microservice architecture</kwd><kwd>Bayesian networks</kwd><kwd>cascade dependencies</kwd><kwd>probabilistic inference</kwd><kwd>configuration optimization</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">Ньюмен С. Создание микросервисов. 2-е изд. – СПб.: Питер, 2023 – 624 с.</mixed-citation><mixed-citation xml:lang="en">Newman S. Creation of microservices. 2nd ed. – St. Petersburg: Peter, 2023 – 624 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Кендалл Д. Стохастические процессы, встречающиеся в теории очередей, и их анализ методом вложенных цепей Маркова // Математика. 1959. Т. 3. № 6. С. 97-112.</mixed-citation><mixed-citation xml:lang="en">Kendall D. Stochastic processes occurring in queue theory and their analysis by the nested Markov chain method. Matematika. 1959; 3(6):97-112.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Цыпкин Я.З. Основы теории автоматических систем. М.: Наука, 1977. 560 с.</mixed-citation><mixed-citation xml:lang="en">Tsypkin Ya.Z. Fundamentals of the theory of automatic systems. Moscow: Nauka, 1977. 560 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Abraham I., Alvisi L., Halpern J. Distributed computing meets game theory: combining insights from two fields // ACM SIGACT News. 2011. Vol. 42. No. 2. P. 69-76.</mixed-citation><mixed-citation xml:lang="en">Abraham I., Alvisi L., Halpern J. Distributed computing and game Theory: Combining knowledge from two fields. ACM SIGACT News. 2011;42(2): 69-76.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Mao H., Alizadeh M., Menache I., Kandula S. Resource management with deep reinforcement learning // Proceedings of the 15th ACM Workshop on Hot Topics in Networks. 2016. P. 50-56.</mixed-citation><mixed-citation xml:lang="en">Mao H., Alizadeh M., Menache I., Kandula S. Resource management through deep reinforcement learning. Proceedings of the 15th ACM Seminar on current topics in networks. 2016:50-56.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Taran V.N. Bayesian networks for modeling complex systems. Proceedings of 2017 IEEE 2nd International Conference on Control in Technical Systems, CTS St. Petersburg, 25–27 October 2017. St. Petersburg, 2017; 240-243. DOI 10.1109/CTSYS.2017.8109535. EDN XXUEQX.</mixed-citation><mixed-citation xml:lang="en">Taran V.N. Bayesian networks for modeling complex systems. Proceedings of 2017 IEEE 2nd International Conference on Control in Technical Systems, CTS St. Petersburg, 25–27 October 2017. St. Petersburg, 2017; 240-243. DOI 10.1109/CTSYS.2017.8109535. EDN XXUEQX.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Koller D., Friedman N. Probabilistic Graphical Models: Principles and Techniques. MITPress, 2009:1266.</mixed-citation><mixed-citation xml:lang="en">Koller D., Friedman N. Probabilistic graphical models: principles and methods. Publishing House of the Massachusetts Institute of Technology, 2009;1266 p.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Pearl J. Probabilistic reasoning in intelligent systems: networks of plausible inference. CA: Morgan Kaufmann, 1988.</mixed-citation><mixed-citation xml:lang="en">Pearl J. Probabilistic reasoning in intelligent systems: plausible conclusion networks. California: Morgan Kaufman, 1988.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Ильин В. А., Позняк Э. Г. Основы математического анализа. Часть I. - М., 1998. - С. 248-251.</mixed-citation><mixed-citation xml:lang="en">Ilyin V.A., Poznyak E.G. Fundamentals of mathematical analysis. Part I., Moscow, 1998, pp. 248-251.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Амосов А.А., Дубинский Ю.А., Копченова Н.П. Вычислительные методы для инженеров. М.:Мир, 1998.</mixed-citation><mixed-citation xml:lang="en">Amosov A.A., Dubinsky Yu.A., Kopchenova N.P. Computational Methods for Engineers, Moscow: Mir, 1998.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Kubernetes Documentation. Horizontal Pod Autoscaler [Электронный ресурс]. URL: https://kubernetes.io/docs/tasks/run-application/horizontal-pod-autoscale/ (дата обращения 26.07.2025).</mixed-citation><mixed-citation xml:lang="en">Kubernetes documentation. Horizontal module of automatic scaling [Electronic resource]. URL: https://kubernetes.io/docs/tasks/run-application/horizontal-pod-autoscale / (publication date 07/26/2025).</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Xu B, Li H, Pang W, et al. Bayesian network approach to fault diagnosis of a hydroelectric generation system. Energy Sci Eng. 2019;7:1669–1677. https ://doi.org/10.1002/ese3.383.</mixed-citation><mixed-citation xml:lang="en">Xu B., Li H., Pang U. et al. Bayesian network approach to fault diagnosis of hydroelectric power plants. Energy Science, 2019;7:1669-1677. https ://doi.org/10.1002/ese3.383.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Guoqiang L., Zengru D., Ying F. Cascading failures in complex networks with community structure. International Journal of Modern Physics C(IJMPC), World Scientific Publishing Co.Pte. Ltd., 2014;25(5):1-10.</mixed-citation><mixed-citation xml:lang="en">Guoqiang L., Zengru D., Ying F. Cascading failures in complex networks with a community structure. International Journal of Modern Physics C(IJMPC), World Scientific Publishing Co.Pte.Ltd.2014;25(5)1-10.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">https://doi.org/10.1145/3190507. Tao Chen, Rami Bahsoon, and Xin Yao. 2018. A Survey and Taxonomy of Self-Aware and Self-Adaptive Cloud Autoscaling Systems. ACM Comput.Surv.51,3,Article 61.June 2018:40.</mixed-citation><mixed-citation xml:lang="en">https://doi.org/10.1145/3190507. Tao Chen, Rami Bahsoon, and Xin Yao. 2018. A Survey and Taxonomy of Self-Aware and Self-Adaptive Cloud Autoscaling Systems. ACM Comput.Surv.51,3,Article 61.June 2018:40.</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>
