<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Siberian Aerospace Journal</journal-id><journal-title-group><journal-title xml:lang="en">Siberian Aerospace Journal</journal-title><trans-title-group xml:lang="kk"><trans-title>Siberian Aerospace Journal</trans-title></trans-title-group><trans-title-group xml:lang="pt"><trans-title>Siberian Aerospace Journal</trans-title></trans-title-group><trans-title-group xml:lang="ru"><trans-title>Сибирский аэрокосмический журнал</trans-title></trans-title-group><trans-title-group xml:lang="zh"><trans-title>Siberian Aerospace Journal</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2712-8970</issn><issn publication-format="electronic">2782-5760</issn><publisher><publisher-name xml:lang="en">Reshetnev Siberian State University of Science and Technology</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">714127</article-id><article-id pub-id-type="doi">10.31772/2712-8970-2026-27-2-223-235</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Section 1. Computer Science, Computer Engineering and Management</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Раздел 1. Информатика, вычислительная техника и управление</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Hybrid communication systems: forming a multilevel mathematical concept of routing</article-title><trans-title-group xml:lang="ru"><trans-title>Гибридные системы связи: формирование многоуровневой математической концепции маршрутизации</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-0944-1817</contrib-id><name-alternatives><name xml:lang="en"><surname>Kuznetsov</surname><given-names>Aleksandr A.</given-names></name><name xml:lang="ru"><surname>Кузнецов</surname><given-names>Александр Алексеевич</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Dr. Sc. (Physics and Mathematics), Professor, Director of the Research and Education Center “Institute of Space Research and High Technologies”</p></bio><bio xml:lang="ru"><p>доктор физико-математических наук, профессор, директор НОЦ «Институт космических исследований и высоких технологий»</p></bio><email>alex_kuznetsov80@mail.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-6360-7382</contrib-id><name-alternatives><name xml:lang="en"><surname>Vlasov</surname><given-names>Anton Yu.</given-names></name><name xml:lang="ru"><surname>Власов</surname><given-names>Антон Юрьевич</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Cand. Sc. (Physics and Mathematics), Leading Researcher at the Scientific Laboratory “Satellite Telecommunication Systems”</p></bio><bio xml:lang="ru"><p>кандидат физико-математических наук, ведущий научный сотрудник Научной лаборатории «Спутниковые телекоммуникационные системы»</p></bio><email>vlasov@sibsau.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-4146-5763</contrib-id><name-alternatives><name xml:lang="en"><surname>Gaipov</surname><given-names>Konstantin E.</given-names></name><name xml:lang="ru"><surname>Гаипов</surname><given-names>Константин Эдуардович</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Cand. Sc. (Engineering), Associate Professor of the Department of Electronic Engineering and Telecommunications</p></bio><bio xml:lang="ru"><p>кандидат технических наук, доцент кафедры электронной техники и телекоммуникаций</p></bio><email>gaipovke@yandex.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-0405-3065</contrib-id><name-alternatives><name xml:lang="en"><surname>Safonov</surname><given-names>Konstantin V.</given-names></name><name xml:lang="ru"><surname>Сафонов</surname><given-names>Константин Владимирович</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Dr. Sc. (Physics and Mathematics), Professor, Director of Institute of Informatics and Telecommunications</p></bio><bio xml:lang="ru"><p>доктор физико-математических наук, профессор, директор Института информатики и телекоммуникаций</p></bio><email>safonovkv@rambler.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Reshetnev Siberian State University of Science and Technology</institution></aff><aff><institution xml:lang="ru">Сибирский государственный университет науки и технологий имени академика М. Ф. Решетнева</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2026-07-06" publication-format="electronic"><day>06</day><month>07</month><year>2026</year></pub-date><volume>27</volume><issue>2</issue><issue-title xml:lang="en"/><issue-title xml:lang="ru"/><fpage>223</fpage><lpage>235</lpage><history><date date-type="received" iso-8601-date="2026-07-05"><day>05</day><month>07</month><year>2026</year></date><date date-type="accepted" iso-8601-date="2026-07-05"><day>05</day><month>07</month><year>2026</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2026, Kuznetsov A.A., Vlasov A.Y., Gaipov K.E., Safonov K.V.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2026, Кузнецов А.А., Власов А.Ю., Гаипов К.Э., Сафонов К.В.</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="en">Kuznetsov A.A., Vlasov A.Y., Gaipov K.E., Safonov K.V.</copyright-holder><copyright-holder xml:lang="ru">Кузнецов А.А., Власов А.Ю., Гаипов К.Э., Сафонов К.В.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.eco-vector.com/2712-8970/article/view/714127">https://journals.eco-vector.com/2712-8970/article/view/714127</self-uri><abstract xml:lang="en"><p>This article develops mathematical routing models for hybrid communication systems that integrate ground, stratospheric, and space segments. The study addresses networks where topology, demand matrices, link capacities, loss levels, and delay characteristics vary at the same time. The paper aims to formulate a multilevel mathematical routing concept that combines three core ideas: fractional multicommodity flow, path-limited routing, and delay minimization. The study uses multicommodity flow models on directed graphs, path-based formulations with a bounded number of routes per demand, convex delay-aware objectives, and an analysis of modern approximation algorithms. The results show that fractional multicommodity flow defines the upper level for estimating throughput, fairness, and priority-aware service; path-limited formulations translate this solution into engineering policies that a routing plane can install and maintain; and delay-oriented models account for quality-of-service requirements and temporal dynamics. The paper also shows how this concept links routing with radio-resource allocation, structural adaptation of the network, and routing-information dissemination. The results support a multistage routing logic in which a fractional formulation estimates the theoretical upper bound, a path-limited model compresses this solution into an installable routing policy, and a delay-oriented stage refines the decision for hybrid-network operation. The proposed concept applies to the design and control of communication systems that link spacecraft, airborne platforms, and terrestrial infrastructure. The article concludes that this concept can provide a theoretical basis for routing in hybrid communication systems and can naturally extend to lossy transmission models, dynamic network scenarios, and integrated network-control problems.</p></abstract><trans-abstract xml:lang="ru"><p>Предметом исследования выступают математические модели маршрутизации в гибридных системах связи, объединяющих наземный, стратосферный и космический сегменты. Тема работы – построение единой концепции маршрутизации для сетей с одновременно изменяющимися топологией, матрицей требований, пропускными способностями, уровнями потерь и задержками каналов. Цель – формирование многоуровневой математической концепции маршрутизации, объединяющей три взаимосвязанные идеи: общий дробный многопродуктовый поток (multicommodity flow, MCF), ограничение числа маршрутов на одно требование и минимизацию задержки. Методологическую основу составляют модели MCF на ориентированных графах, маршрутные постановки с ограниченным числом путей, выпуклые функционалы задержки и анализ современных приближённых алгоритмов. Показано, что общий дробный MCF задаёт верхний уровень оценки достижимой пропускной способности, справедливости и приоритетного обслуживания; постановки с ограниченным числом путей обеспечивают переход к инженерно реализуемым решениям; модели минимизации задержки позволяют учитывать качество обслуживания и временную динамику гибридной сети. Предлагаемая концепция связывает маршрутизацию с задачами распределения радиоресурсов, адаптации структуры сети и распространения маршрутной информации. Полученные результаты указывают на целесообразность многоэтапной маршрутизации: сначала формируется теоретическая верхняя оценка в дробной постановке, затем она сжимается до ограниченного набора путей и после этого уточняется по критериям задержки. Область применения – проектирование и управление перспективными космическими, воздушными и наземными сегментами связи, а также разработка алгоритмов маршрутизации для систем ракетно-космического назначения. Предложенная концепция может служить теоретической основой для дальнейшего развития маршрутизации в гибридных системах связи, включая сети с потерями, динамические сети и задачи совместного управления сетью.</p></trans-abstract><kwd-group xml:lang="en"><kwd>hybrid communication systems</kwd><kwd>multicommodity flow</kwd><kwd>concurrent flow</kwd><kwd>path-limited routing</kwd><kwd>delay minimization</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>гибридные системы связи</kwd><kwd>многопродуктовый поток</kwd><kwd>конкурентный поток</kwd><kwd>маршрутизация с ограниченным числом путей</kwd><kwd>минимизация задержки</kwd></kwd-group><funding-group><award-group><funding-source><institution-wrap><institution xml:lang="en">NTI Foundation</institution></institution-wrap><institution-wrap><institution xml:lang="ru">Фонд НТИ</institution></institution-wrap></funding-source><award-id>70-2025-000804</award-id></award-group><funding-statement xml:lang="en">The study was carried out with the financial support of the NTI Foundation under Agreement No.70-2025-000804 dated May 26, 2025.</funding-statement><funding-statement xml:lang="ru">Работа выполнена при финансовой поддержке Фонда НТИ в рамках Договора №70-2025-000804 от 26.05.2025.</funding-statement></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Liu J., Shi Y., Fadlullah Z. M., Kato N. Space-Air-Ground Integrated Network: A Survey. IEEE Communications Surveys &amp; Tutorials. 2018, Vol. 20, No. 4, P. 2714–2741. DOI: 10.1109/COMST.2018.2841996</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Lu Y., Wen W., Kostromitin K. I., Ren P., Zhang H., Duan Y., Zhu H., Zhang P. UAV Ad Hoc Network Routing Algorithms in Space–Air–Ground Integrated Networks: Challenges and Directions. Drones. 2023, Vol. 7, No. 7, Art. 448. DOI: 10.3390/drones7070448</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Liu Y., Xie J., Xing C., Xie S. Topology construction and topology adjustment in flying Ad hoc networks for relay transmission. Computer Networks. 2023, Vol. 228, Art. 109753. DOI: 10.1016/j.comnet.2023.109753</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Hopps C. Analysis of an Equal-Cost Multi-Path Algorithm. RFC 2992. November 2000. Available at: https://www.rfc-editor.org/rfc/rfc2992 (accessed: 03.04.2026). DOI: 10.17487/RFC2992</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Filsfils C., Previdi S., Ginsberg L., Decraene B., Litkowski S., Shakir R. Segment Routing Architecture. RFC 8402. July 2018. Available at: https://www.rfc-editor.org/rfc/rfc8402 (accessed: 03.04.2026). DOI: 10.17487/RFC8402</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Filsfils C., Talaulikar K., Voyer D., Bogdanov A., Mattes P. Segment Routing Policy Architecture. RFC 9256. July 2022. Available at: https://www.rfc-editor.org/rfc/rfc9256 (accessed: 03.04.2026).</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Leighton T., Makedon F., Plotkin S., Stein C., Tardos É., Tragoudas S. Fast Approximation Algorithms for Multicommodity Flow Problems. Journal of Computer and System Sciences. 1995, Vol. 50, No. 2, P. 228–243. DOI: 10.1006/jcss.1995.1020</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Garg N., Könemann J. Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. SIAM Journal on Computing. 2007, Vol. 37, No. 2, P. 630–652. DOI: 10.1137/S0097539704446232</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Fleischer L. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. SIAM Journal on Discrete Mathematics. 2000, Vol. 13, No. 4, P. 505–520. DOI: 10.1137/S0895480199355754</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Karakostas G. Faster Approximation Schemes for Fractional Multicommodity Flow Problems. ACM Transactions on Algorithms. 2008, Vol. 4, No. 1, Art. 13. DOI: 10.1145/1328911.1328924</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Mądry A. Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms. Proceedings of the 42nd ACM Sympsium on Theory of Computing (STOC 2010). New York: ACM, 2010, P. 121–130.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Chen L., Ye M. High-Accuracy Multicommodity Flows via Iterative Refinement. 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics. 2024. Art. 45. DOI: 10.4230/LIPIcs.ICALP.2024.45</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Chen L., Graur A., Sidford A. Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs. arXiv:2503.24373, 2025.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Kleinrock L. Communication Nets: Stochastic Message Flow and Delay. New York: Dover Publications, 1973, 209 p.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Fratta L., Gerla M., Kleinrock L. The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks. 1973, Vol. 3, No. 2, P. 97–133.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Fratta L., Gerla M., Kleinrock L. Flow Deviation: 40 years of incremental flows for packets, waves, cars and tunnels. Computer Networks. 2014, Vol. 66, P. 18–31. DOI: 10.1016/j.comnet.2014.04.001</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Baier G., Köhler E., Skutella M. The k-Splittable Flow Problem. Algorithmica. 2005, Vol. 42, P. 231–248. DOI: 10.1007/s00453-005-1167-9</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Gamst M., Jensen P. N., Pisinger D., Plum C. E. M. Two- and Three-Index Formulations of the Minimum Cost Multicommodity k-Splittable Flow Problem. European Journal of Operational Research. 2010, Vol. 202, No. 1, P. 82–89. DOI: 10.1016/j.ejor.2009.05.014</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Gamst M., Petersen B. Comparing Branch-and-Price Algorithms for the Multi-Commodity k-Splittable Maximum Flow Problem. European Journal of Operational Research. 2012, Vol. 217, No. 2, P. 278–286. DOI: 10.1016/j.ejor.2011.10.001</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Caramia M., Sgalambro A. A Fast Heuristic Algorithm for the Maximum Concurrent k-Splittable Flow Problem. Optimization Letters. 2010, Vol. 4, No. 1, P. 37–55. DOI: 10.1007/s11590-009-0147-4</mixed-citation></ref><ref id="B21"><label>21.</label><mixed-citation>Białoń P. M. A Randomized Rounding Approach to a k-Splittable Multicommodity Flow Problem with Lower Path Flow Bounds Affording Solution Quality Guarantees. Telecommunication Systems. 2017, Vol. 64, P. 525–542. DOI: 10.1007/s11235-016-0190-2</mixed-citation></ref><ref id="B22"><label>22.</label><mixed-citation>Melchiori A., Sgalambro A. A Matheuristic Approach for the Quickest Multicommodity k-Splittable Flow Problem. Computers &amp; Operations Research. 2018, Vol. 92, P. 111–129. DOI: 10.1016/j.cor.2017.12.012</mixed-citation></ref><ref id="B23"><label>23.</label><mixed-citation>Melchiori A., Sgalambro A. A Branch and Price Algorithm to Solve the Quickest Multicommodity k-Splittable Flow Problem. European Journal of Operational Research. 2020, Vol. 282, No. 3, P. 846–857. DOI: 10.1016/j.ejor.2019.10.016</mixed-citation></ref><ref id="B24"><label>24.</label><mixed-citation>Wang Y., Kang R., Guo L., Zhang C., Deng J., Liu P., Wen M. Deadline-Constrained Multi-Commodity Flow Routing and Scheduling Optimization with Consideration of Edge Lengths and Capacities. Computers &amp; Industrial Engineering. 2024, Vol. 192, Art. 110193. DOI: 10.1016/j.cie. 2024.110193</mixed-citation></ref><ref id="B25"><label>25.</label><mixed-citation>Ouorou A., Mahey P., Vial J.-Ph. A Survey of Algorithms for Convex Multicommodity Flow Problems. Management Science. 2000, Vol. 46, No. 1, P. 126–147.</mixed-citation></ref><ref id="B26"><label>26.</label><mixed-citation>Fleischer L., Skutella M. Multicommodity Flows over Time: Efficient Algorithms and Complexity. Theoretical Computer Science. 2007, Vol. 379, No. 3, P. 387–404. DOI: 10.1016/j.tcs.2007.02.046</mixed-citation></ref><ref id="B27"><label>27.</label><mixed-citation>Wang X., Garcia-Luna-Aceves J. J. Collaborative routing, scheduling and frequency assignment for wireless Ad Hoc networks using spectrum-agile radios. Wireless Networks. 2011, Vol. 17, P. 167–181. DOI: 10.1007/s11276-010-0271-1</mixed-citation></ref><ref id="B28"><label>28.</label><mixed-citation>Clausen T., Jacquet P. Optimized Link State Routing Protocol (OLSR). RFC 3626. October 2003. Available at: https://www.rfc-editor.org/rfc/rfc3626 (accessed: 05.04.2026). DOI: 10.17487/RFC3626</mixed-citation></ref><ref id="B29"><label>29.</label><mixed-citation>Juniper Networks. multipath (Protocols BGP). Available at: https://www.juniper.net/ documentation/us/en/software/junos/cli-reference/topics/ref/statement/multipath-edit-protocols-bgp.html (accessed: 03.04.2026).</mixed-citation></ref><ref id="B30"><label>30.</label><mixed-citation>Juniper Networks. load-balance (ecmp). Available at: https://www.juniper.net/documentation/ us/en/software/junos/cli-reference/topics/ref/statement/load-balance-edit-policy-options-policy-statement-then.html (accessed: 03.04.2026).</mixed-citation></ref><ref id="B31"><label>31.</label><mixed-citation>Juniper Networks. ECMP Flow-Based Forwarding on ACX Series Routers. Available at: https://www.juniper.net/documentation/us/en/software/junos/sampling-forwarding-monitoring/topics/ concept/ecmp-flow-based-forwarding-overview-acx-series.html (accessed: 03.04.2026).</mixed-citation></ref><ref id="B32"><label>32.</label><mixed-citation>Fleischer L. K., Wayne K. D. Fast and simple approximation schemes for generalized flow. Mathematical Programming. 2002, Vol. 91, No. 2, P. 215–238. DOI: 10.1007/s101070100238</mixed-citation></ref></ref-list></back></article>
