<?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">intechngu</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник НГУ. Серия: Информационные технологии</journal-title><trans-title-group xml:lang="en"><trans-title>Vestnik NSU. Series: Information Technologies</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-7900</issn><issn pub-type="epub">2410-0420</issn><publisher><publisher-name>НГУ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.25205/1818-7900-2025-23-3-23-31</article-id><article-id custom-type="elpub" pub-id-type="custom">intechngu-323</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></article-categories><title-group><article-title>Анализ методов балансировки сетевого трафика в высоконагруженных сетях</article-title><trans-title-group xml:lang="en"><trans-title>Analysis of Network Traffic Load Balancing Techniques in High-Load Networks</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>Krasovskaya</surname><given-names>N. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Красовская Надежда Валерьевна, студентка магистратуры</p><p>Новосибирск</p></bio><bio xml:lang="en"><p>Nadezhda V. Krasovskaya, Master’s Student</p><p>Novosibirsk</p></bio><email xlink:type="simple">n.krasovskaya@g.nsu.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>Novosibirsk State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>10</day><month>11</month><year>2025</year></pub-date><volume>23</volume><issue>3</issue><fpage>23</fpage><lpage>31</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">Krasovskaya N.V.</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://intechngu.elpub.ru/jour/article/view/323">https://intechngu.elpub.ru/jour/article/view/323</self-uri><abstract><p>В статье проводится комплексный анализ методов балансировки сетевого трафика в высоконагруженных сетях. Рассматриваются фундаментальные принципы распределения нагрузки, включая требования к сохранению целостности TCP-сессий и особенности идентификации сетевых потоков. Детально исследуются современные алгоритмы балансировки: от классического ECMP до перспективных решений на основе согласованного хеширования, HRW и Maglev. Особое внимание уделяется выбору оптимальных хеш-функций для идентификации сетевых потоков и сравнительному анализу характеристик различных методов. Представленные результаты позволяют выработать рекомендации по выбору стратегии балансировки для различных сценариев эксплуатации высоконагруженных сетевых инфраструктур.</p></abstract><trans-abstract xml:lang="en"><p>This article provides a comprehensive analysis of network traffic balancing methods in high-load networks. It examines fundamental load distribution principles, including requirements for maintaining TCP session integrity and specific aspects of network flow identification. The study offers a detailed investigation of modern load balancing algorithms – from classical ECMP to advanced solutions based on consistent hashing, HRW, and Maglev. Particular attention is given to the selection of optimal hash functions for network flow identification and comparative analysis of different methods’ characteristics. The presented results enable the development of recommendations for choosing balancing strategies in various operational scenarios of high-load network infrastructures.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>балансировка сетевого трафика</kwd><kwd>высоконагруженные сети</kwd><kwd>согласованное хеширование</kwd><kwd>распределение потоков</kwd><kwd>Maglev</kwd></kwd-group><kwd-group xml:lang="en"><kwd>network load balancing</kwd><kwd>high-load networks</kwd><kwd>consistent hashing</kwd><kwd>flow distribution</kwd><kwd>Maglev</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">Yasin W., Ibrahim H., Abdul Hamid N. A. W., Udzir N. I. Performance Analysis of Transport Control Protocol Flavours in the Existence of Packet Reordering Phenomena // Digital Enterprise and Information Systems, 2011. Р. 569–579. DOI: 10.1007/978-3-642-22603-8_50.</mixed-citation><mixed-citation xml:lang="en">Yasin W., Ibrahim H., Abdul Hamid N. A. W., Udzir N. I. Performance Analysis of Transport Control Protocol Flavours in the Existence of Packet Reordering Phenomena. Digital Enterprise and Information Systems, 2011, рp. 569–579. DOI: 10.1007/978-3-642-22603-8_50.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Олифер В. Г., Олифер Н. А. Компьютерные сети, принципы, технологии, протоколы: учебник для вузов. 3-е изд. СПб.: Питер, 2007.</mixed-citation><mixed-citation xml:lang="en">Olifer V. G., Olifer N. A. Computer Networks: Principles, Technologies and Protocols, 3rd Edition, Saint Petersburg, Piter publ., 2007.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Hopps C. Analysis of an Equal-Cost Multi-Path Algorithm, RFC Editor, Nov. 2000. DOI 10.17487/rfc2992.</mixed-citation><mixed-citation xml:lang="en">Hopps C. Analysis of an Equal-Cost Multi-Path Algorithm. RFC Editor, Nov. 2000. DOI: 10.17487/rfc2992.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Ларин Д. В., Гетьман А. И. Средства захвата и обработки высокоскоростного сетевого трафика // Тр. ИСП РАН. 2021. № 4. С. 49–68. DOI 10.15514/ispras-2021-33(4)-4.</mixed-citation><mixed-citation xml:lang="en">Larin D. V., Getman A. I. High-speed network traffic capturing and processing tools. Proceedings of the Institute for System Programming of the RAS, 2021, vol. 33, no. 4, рp. 49–68. DOI: 10.15514/ispras-2021-33(4)-4. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Karger D., Lehman E., Leighton T., Panigrahy R., Levine M., Lewin D. Consistent hashing and random trees // Proceedings of the twenty-ninth annual ACM symposium on Theory of computing – STOC ’97, 1997. Р. 654–663, DOI 10.1145/258533.258660.</mixed-citation><mixed-citation xml:lang="en">Karger D., Lehman E., Leighton T., Panigrahy R., Levine M., Lewin D. Consistent hashing and random trees. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing – STOC ’97, 1997, рp. 654–663. DOI: 10.1145/258533.258660.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Thaler D. G., Ravishankar C. V. Using name-based mappings to increase hit rates // IEEE/ ACM Transactions on Networking. 1998. Vol. 6. No. 1. P. 1–14. DOI 10.1109/90.663936.</mixed-citation><mixed-citation xml:lang="en">Thaler D. G., Ravishankar C. V. Using name-based mappings to increase hit rates. IEEE/ACM Transactions on Networking, 1998, vol. 6, no. 1, p. 1–14. DOI: 10.1109/90.663936.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Eisenbud D. E., Yi C., Contavalli C., Smith C., Kononov R., Mann-Hielscher E. et al. Maglev: a fast and reliable software network load balancer // Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation (NSDI’16). 2016. Usenix Association. Р. 523–535.</mixed-citation><mixed-citation xml:lang="en">Eisenbud D. E., Yi C., Contavalli C., Smith C., Kononov R., Mann-Hielscher E., et al. Maglev: a fast and reliable software network load balancer. Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation (NSDI’16), 2016, Usenix Association, рp. 523–535.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Appleby A. Murmurhash3 // Github. URL: https://github.com/aappleby/smhasher/wiki/MurmurHash (date of access: 17.04.2025).</mixed-citation><mixed-citation xml:lang="en">Appleby A. Murmurhash3. Github. URL: https://github.com/aappleby/smhasher/wiki/Murmur-Hash (date of access: 17.04.2025).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Suparn P., Mamta R. Evaluation and Categorization of Hashing Algorithms Based on Their Applications // IAENG International Journal of Applied Mathematics. 2025. No 55. P. 540–552.</mixed-citation><mixed-citation xml:lang="en">Suparn P., Mamta R. Evaluation and Categorization of Hashing Algorithms Based on Their Applications. IAENG International Journal of Applied Mathematics, 2025, no. 55, рp. 540–552.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Akoto-Adjepong V., Asante M., Okyere-Gyamfi S. An Enhanced Non-Cryptographic Hash Function // International Journal of Computer Applications. 2020. Vol. 176. No. 15. P. 10–17. DOI 10.5120/ijca2020920014.</mixed-citation><mixed-citation xml:lang="en">Akoto-Adjepong V., Asante M., Okyere-Gyamfi S. An Enhanced Non-Cryptographic Hash Function. International Journal of Computer Applications, 2020, vol. 176, no. 15, рp. 10–17, DOI: 10.5120/ijca2020920014.</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>
