<?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">msi</journal-id><journal-title-group><journal-title xml:lang="ru">Современная наука и инновации</journal-title><trans-title-group xml:lang="en"><trans-title>Modern Science and Innovations</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2307-910X</issn><publisher><publisher-name>North-Caucasus Federal University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.37493/2307-910X.2022.2.3</article-id><article-id custom-type="elpub" pub-id-type="custom">msi-1369</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>TECHNICAL SCIENCES. INFORMATION, COMPUTING AND MANAGEMENT</subject></subj-group></article-categories><title-group><article-title>МЕТОД БАЛАНСИРОВКИ НАГРУЗКИ ВЫЧИСЛИТЕЛЬНОГО КЛАСТЕРА ЦЕНТРА ОБРАБОТКИ ДАННЫХ</article-title><trans-title-group xml:lang="en"><trans-title>METHOD OF LOAD BALANCING FOR COMPUTER CLUSTER OF DATA PROCESSING CENTER</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Братченко</surname><given-names>Н. Ю.</given-names></name><name name-style="western" xml:lang="en"><surname>Bratchenko</surname><given-names>N. Yu.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Братченко Наталья Юрьевна - кандидат физико-математических наук, доцент кафедры инфокоммуникаций,  доцент, институт цифрового развития, кафедра инфокоммуникаций.</p><p>Ставрополь,+7 9887405050, (8652) 95-69-97</p></bio><bio xml:lang="en"><p>Bratchenko Natalia Yurievna - candidate of physical and mathematical sciences, associate professor.</p><p>SI NCFU, Stavropol</p></bio><email xlink:type="simple">n.b.20062@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мочалов</surname><given-names>В. П.</given-names></name><name name-style="western" xml:lang="en"><surname>Mochalov</surname><given-names>V. P.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Мочалов Валерий Петрович - профессор, доктор технических наук,  профессор, профессор кафедры инфокоммуникаций, институт цифрового развития, кафедра инфокоммуникаций.</p><p>Ставрополь,+7 9624004447, (8652) 95-69-97</p></bio><bio xml:lang="en"><p>Mochalov Valeriy Petrovich - Doctor of Technical Sciences, Professor, SI NCFU.</p><p>Stavropol, +7 9624004447, (8652) 95-69-97</p></bio><email xlink:type="simple">n.b.20062@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Палканов</surname><given-names>И. С.</given-names></name><name name-style="western" xml:lang="en"><surname>Palkanov</surname><given-names>I. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Палканов Илья Сергеевич - программист, институт цифрового развития, кафедра инфокоммуникаций.</p><p>Ставрополь,+7 9289633235</p></bio><bio xml:lang="en"><p>Palkanov Ilya Sergeevich, programmer, SI NCFU.</p><p>Stavropol, +7 9289633235</p></bio><email xlink:type="simple">n.b.20062@yandex.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>North Caucasus Federal University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>14</day><month>01</month><year>2023</year></pub-date><volume>0</volume><issue>2</issue><fpage>28</fpage><lpage>39</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Братченко Н.Ю., Мочалов В.П., Палканов И.С., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Братченко Н.Ю., Мочалов В.П., Палканов И.С.</copyright-holder><copyright-holder xml:lang="en">Bratchenko N.Y., Mochalov V.P., Palkanov I.S.</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://msi.elpub.ru/jour/article/view/1369">https://msi.elpub.ru/jour/article/view/1369</self-uri><abstract><p>В статье представлено описание метода балансировки нагрузки вычислительного кластера центра обработки данных (ЦОД) в основу которого положен вероятностный подход упреждающего прогнозирования состояний пакетного трафика, сформированный на основе результатов его статистического, нелинейного и спектрального анализа. Фрактальные свойства сетевого трафика  являются обоснованием возможности предсказания, позволяют с достаточно большой вероятностью прогнозировать появление на отдельных временных интервалах всплесков и спадов его активности, выявление   периодов   возможной перегрузки серверов и сетевого оборудования и   делают возможным разработку методов эффективного планирования и распределения задач внутри ЦОД, обеспечение статистически равномерной загрузки его функциональных элементов. Cпектральный анализ временного ряда проводится по нормированным отклонениям фактических уровней от сглаженных. Отсутствие существенных пиков спектральных оценок говорит об отсутствии периодических колебаний. Показано, что суммирование циклов разного периода динамики временного ряда, основанное на использовании наиболее значимых гармониках спектра, определяет моменты возникновения последующих аномалий его развития. В основу процесса выявления существенных гармоник спектра положено исследование его спектральной плотности мощности с помощью преобразования Фурье.  Разработанный метод способен обеспечить решение задачи эффективного планирования и распределения задач вычислительного кластера ЦОД с целью оптимизации использования ресурсов, ускорения времени выполнения задач и сокращения расходов на обработку приложений.</p></abstract><trans-abstract xml:lang="en"><p>The article presents a description of the load balancing method for a computing cluster of a data processing center (DPC), which is based on a probabilistic approach to proactive forecasting of packet traffic states, formed on the basis of the results of its statistical, nonlinear and spectral analysis. The fractal properties of network traffic are the rationale for the possibility of prediction, allow with a fairly high probability to predict the appearance of bursts and drops in its activity at certain time intervals, identify periods of possible overload of servers and network equipment, and make it possible to develop methods for effective planning and distribution of tasks within the data center, ensuring a statistically uniform loading its functional elements. The spectral analysis of the time series is carried out according to the normalized deviations of the actual levels from the smoothed ones. The absence of significant peaks in the spectral estimates indicates the absence of periodic fluctuations. It is shown that the summation of cycles of different periods of the dynamics of the time series, based on the use of the most significant harmonics of the spectrum, determines the moments of occurrence of subsequent anomalies in its development. The process of identifying significant harmonics of the spectrum is based on the study of its spectral power density using the Fourier transform. The developed method is able to provide a solution to the problem of efficient planning and distribution of tasks in a data center computing cluster in order to optimize the use of resources, speed up task execution time and reduce application processing costs.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>пакетный трафик</kwd><kwd>временные ряды</kwd><kwd>фракталы</kwd><kwd>балансировка нагрузки</kwd><kwd>функция автокорреляции</kwd><kwd>гармонический анализ</kwd><kwd>нелинейная динамика</kwd></kwd-group><kwd-group xml:lang="en"><kwd>packet traffic</kwd><kwd>time series</kwd><kwd>fractals</kwd><kwd>load balancing</kwd><kwd>autocorrelation function</kwd><kwd>harmonic analysis</kwd><kwd>non-linear dynamics</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">Tsybakov B.S., Georganas N.D. Self-similar processes in communications networks // IEEE Trans. Inform. Theory, vol. 44. Sep.2018. P. 1713-1725.</mixed-citation><mixed-citation xml:lang="en">Tsybakov B.S., Georganas N.D. Self-similar processes in communications networks // IEEE Trans. Inform. Theory, vol. 44. Sep.2018. P. 1713-1725.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Tsybakov B.S., Georganas N.D. Self-similar traffic: upper bounds to buffer-overflow probability in an ATM queue // Proceedings of CCBR‘97, the Canadian Conference on Broadband Research, Ottawa. 2015. P. 137-148.</mixed-citation><mixed-citation xml:lang="en">Tsybakov B.S., Georganas N.D. Self-similar traffic: upper bounds to buffer-overflow probability in an ATM queue // Proceedings of CCBR‘97, the Canadian Conference on Broadband Research, Ottawa. 2015. P. 137-148.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Gneiting T., Schlather M. Stochastic models which separate fractal dimension and Hurst effect // NRCSE-TRS. Sep. 20, 2001. № 069.</mixed-citation><mixed-citation xml:lang="en">Gneiting T., Schlather M. Stochastic models which separate fractal dimension and Hurst effect // NRCSE-TRS. Sep. 20, 2001. № 069.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Feng W., Tinnakornsrisuphap P. The Failure of TCP in High-Performance Computational Grids // SC2000: High-Performance Network and Computing Conference, Dallas, TX. November, 2000.</mixed-citation><mixed-citation xml:lang="en">Feng W., Tinnakornsrisuphap P. The Failure of TCP in High-Performance Computational Grids // SC2000: High-Performance Network and Computing Conference, Dallas, TX. November, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Veres A., Boda М. The Chaotic Nature of TCP Congestion Control // Proceedings of IEEE INFOCOM‘2000, March 2000.</mixed-citation><mixed-citation xml:lang="en">Veres A., Boda М. The Chaotic Nature of TCP Congestion Control // Proceedings of IEEE INFOCOM‘2000, March 2000.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Veres A., Kenesi Zs., Molnar S., Vattay G. On the Propagation of Long-Range Dependence in the Internet // Proc. ACM SIGCOMM 2000. Stockholm, Sweden, Sep. 2000.</mixed-citation><mixed-citation xml:lang="en">Veres A., Kenesi Zs., Molnar S., Vattay G. On the Propagation of Long-Range Dependence in the Internet // Proc. ACM SIGCOMM 2000. Stockholm, Sweden, Sep. 2000.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Kugiumtzis D., Boudourides М. Chaotic Analysis of Internet Ping Data: Just a Random Generator? // SOEIS meeting at Bielefeld, March 27-28, 1998.</mixed-citation><mixed-citation xml:lang="en">Kugiumtzis D., Boudourides М. Chaotic Analysis of Internet Ping Data: Just a Random Generator? // SOEIS meeting at Bielefeld, March 27-28, 1998.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Park K., Willinger W. Self-Similar Network Traffic and Performance Evaluation. John Wiley &amp; Sons, 2000.</mixed-citation><mixed-citation xml:lang="en">Park K., Willinger W. Self-Similar Network Traffic and Performance Evaluation. John Wiley &amp; Sons, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Policing and Shaping Overview, QC: Cisco IOS Release 12.0 Quality of Service Solutions Configuration Guide. http://www.cisco.com.</mixed-citation><mixed-citation xml:lang="en">Policing and Shaping Overview, QC: Cisco IOS Release 12.0 Quality of Service Solutions Configuration Guide. http://www.cisco.com.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Östring S., Sirisena H. The Influence the Long-Range Dependence on Traffic Prediction // Proceedings of ICC‘01. Helsinki, June 2001.</mixed-citation><mixed-citation xml:lang="en">Östring S., Sirisena H. The Influence the Long-Range Dependence on Traffic Prediction // Proceedings of ICC‘01. Helsinki, June 2001.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Beran J. Statistical Methods for Data with Long-Range Dependence // StatisticalScience, Volume 7, Issue 4. 2019. P. 404-416.</mixed-citation><mixed-citation xml:lang="en">Beran J. Statistical Methods for Data with Long-Range Dependence // StatisticalScience, Volume 7, Issue 4. 2019. P. 404-416.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Foag J., Wild T. Traffic Prediction Algorithm for a Speculative Network Processor // 17th Intl. Symposium for High Performance Computing Systems and Applications HPCS 2003. Sherbrooke, May 2003.</mixed-citation><mixed-citation xml:lang="en">Foag J., Wild T. Traffic Prediction Algorithm for a Speculative Network Processor // 17th Intl. Symposium for High Performance Computing Systems and Applications HPCS 2003. Sherbrooke, May 2003.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Trajkovic L., Neidhardt A. Internet traffic prediction // Centre for Systems Science, Simon Fraser University, Vol. 12, Issue 1. Mar. 2000.</mixed-citation><mixed-citation xml:lang="en">Trajkovic L., Neidhardt A. Internet traffic prediction // Centre for Systems Science, Simon Fraser University, Vol. 12, Issue 1. Mar. 2000.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Koucheryavy Y., Harju J. A novel approach for self-similar traffic prediction. / Proceedings of the St. Petersburg Regional International Teletraffic Seminar, St. Petersburg, Russia, January 29. February 1. 2002. P. 172-179.</mixed-citation><mixed-citation xml:lang="en">Koucheryavy Y., Harju J. A novel approach for self-similar traffic prediction. / Proceedings of the St. Petersburg Regional International Teletraffic Seminar, St. Petersburg, Russia, January 29. February 1. 2002. P. 172-179.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">H. Kantz and T. Schreiber. Nonlinear Time Series Analysis, 2nd edition, Cambridge University Press, Cambridge, 2003. – 388 p.</mixed-citation><mixed-citation xml:lang="en">H. Kantz and T. Schreiber. Nonlinear Time Series Analysis, 2nd edition, Cambridge University Press, Cambridge, 2003. – 388 p.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Fowler H.J., Leland W.E. Local area network traffic characteristic, with implications for broadband network congestion management // IEEE Journal on Selected Areas in Communications. vol. 9. 2021. P. 1139-1149.</mixed-citation><mixed-citation xml:lang="en">Fowler H.J., Leland W.E. Local area network traffic characteristic, with implications for broadband network congestion management // IEEE Journal on Selected Areas in Communications. vol. 9. 2021. P. 1139-1149.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Zhao H., Ansari N., Shi Y.Q. A Fast Non-linear Algorithm for Video Traffic Prediction // ITCC, 2002.</mixed-citation><mixed-citation xml:lang="en">Zhao H., Ansari N., Shi Y.Q. A Fast Non-linear Algorithm for Video Traffic Prediction // ITCC, 2002.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Chen B., Peng S., Wang K. Traffic Modeling, Prediction, and Congestion Contro for High-Speed Networks: A Fuzzy AR Approach // IEEE Trans. On Fuzzy Systems Vol. 8. 2000. № 5.</mixed-citation><mixed-citation xml:lang="en">Chen B., Peng S., Wang K. Traffic Modeling, Prediction, and Congestion Contro for High-Speed Networks: A Fuzzy AR Approach // IEEE Trans. On Fuzzy Systems Vol. 8. 2000. № 5.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Moon F.C. Chaotic and Fractal Dynamics: Introduction for Applied Scientists and Engineers. New York: Wiley; 1992.</mixed-citation><mixed-citation xml:lang="en">Moon F.C. Chaotic and Fractal Dynamics: Introduction for Applied Scientists and Engineers. New York: Wiley; 1992.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Moon F. Chaotic Oscillations. Translate from English. Moscow: Mir Publ.; 1990. 312 p. (in Russian)</mixed-citation><mixed-citation xml:lang="en">Moon F. Chaotic Oscillations. Translate from English. Moscow: Mir Publ.; 1990. 312 p. (in Russian)</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>
