<?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">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">43665</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2024-32-4-362-369</article-id><article-id pub-id-type="edn">DRHDFU</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Computer Science</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Информатика и вычислительная техника</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">Two-queue polling system as a model of an integrated access and backhaul network node in half-duplex mode</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/0009-0001-5885-8566</contrib-id><contrib-id contrib-id-type="scopus">58971412800</contrib-id><contrib-id contrib-id-type="researcherid">LEM-8084-2024</contrib-id><name-alternatives><name xml:lang="en"><surname>Nikolaev</surname><given-names>Dmitry I.</given-names></name><name xml:lang="ru"><surname>Николаев</surname><given-names>Д. И.</given-names></name></name-alternatives><bio xml:lang="en"><p>Master’s degree student of Department of Probability Theory and Cybersecurity</p></bio><email>nikolaev-di@rudn.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1373-4014</contrib-id><contrib-id contrib-id-type="scopus">57192573001</contrib-id><contrib-id contrib-id-type="researcherid">AAH-7080-2019</contrib-id><name-alternatives><name xml:lang="en"><surname>Beschastnyi</surname><given-names>Vitalii A.</given-names></name><name xml:lang="ru"><surname>Бесчастный</surname><given-names>В. А.</given-names></name></name-alternatives><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences, assistant professor of Department of Probability Theory and Cybersecurity</p></bio><email>beschastnyy-va@rudn.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-2655-4805</contrib-id><contrib-id contrib-id-type="scopus">35106984800</contrib-id><contrib-id contrib-id-type="researcherid">E-5620-2014</contrib-id><name-alternatives><name xml:lang="en"><surname>Gaidamaka</surname><given-names>Yuliya V.</given-names></name><name xml:lang="ru"><surname>Гайдамака</surname><given-names>Ю. В.</given-names></name></name-alternatives><bio xml:lang="en"><p>Doctor of Physical and Mathematical Sciences, full professor of Department of Probability Theory and Cybersecurity of RUDN University; Senior Researcher of Institute of Informatics Problems of Federal Research Center “Computer Science and Control” Russian Academy of Sciences</p></bio><email>gaydamaka-yuv@rudn.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">RUDN University</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Institute of Informatics Problems</institution></aff><aff><institution xml:lang="ru">Институт проблем информатики, Федеральный исследовательский центр «Информатика и управление» РАН</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2024-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2024</year></pub-date><volume>32</volume><issue>4</issue><issue-title xml:lang="en">VOL 32, NO4 (2024)</issue-title><issue-title xml:lang="ru">ТОМ 32, №4 (2024)</issue-title><fpage>362</fpage><lpage>369</lpage><history><date date-type="received" iso-8601-date="2025-04-05"><day>05</day><month>04</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2024, Nikolaev D.I., Beschastnyi V.A., Gaidamaka Y.V.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024, Николаев Д.И., Бесчастный В.А., Гайдамака Ю.В.</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">Nikolaev D.I., Beschastnyi V.A., Gaidamaka Y.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-nc/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/43665">https://journals.rudn.ru/miph/article/view/43665</self-uri><abstract xml:lang="en"><p>Integrated Access and Backhaul (IAB) technology facilitates the establishment of a compact network by utilizing repeater nodes rather than fully equipped base stations, which subsequently minimizes the expenses associated with the transition towards next-generation networks. The majority of studies focusing on IAB networks rely on simulation tools and the creation of discrete-time models. This paper introduces a mathematical model for the boundary node in an IAB network functioning in half-duplex mode. The proposed model is structured as a polling service system with a dual-queue setup, represented as a random process in continuous time, and is examined through the lens of queueing theory, integral transforms, and generating functions (GF). As a result, analytical expressions were obtained for the GF, marginal distribution, as well as the mean and variance of the number of requests in the queues, which correspond to packets pending transmission by the relay node via access and backhaul channels.</p></abstract><trans-abstract xml:lang="ru"><p>Технология интегрированного доступа и транзита (Integrated Access and Backhaul, IAB) позволяет создать компактную сеть за счёт использования узлов ретрансляторов вместо полностью оборудованных базовых станций, что впоследствии минимизирует расходы, связанные с переходом к сетям следующего поколения. Большая часть работ, посвящённых сетям IAB, опираются на инструменты имитационного моделирования и создание моделей, функционирующих в дискретном времени. В данной работе представлена математическая модель граничного узла в сети IAB с полудуплексным режимом передачи данных. Предлагаемая модель конструируется как система поллинга с двумя очередями в непрерывном времени и анализируется с помощью аппарата теории массового обслуживания, интегральных преобразований и производящих функций (ПФ). В результате получены аналитические выражения для ПФ, вероятностных распределений, а также средних и дисперсий числа заявок в очередях, которые соответствуют пакетам, ожидающим своей передачи на ретрансляционном узле по каналам доступа и транзита.</p></trans-abstract><kwd-group xml:lang="en"><kwd>polling</kwd><kwd>queuing system</kwd><kwd>integrated access and backhaul</kwd><kwd>half-duplex</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>поллинг</kwd><kwd>система массового обслуживания</kwd><kwd>интегрированный доступ и транзит</kwd><kwd>полудуплекс</kwd></kwd-group><funding-group><funding-statement xml:lang="en">The reported study was funded by RSF, project number 23-79-01140, https://rscf.ru/en/project/23-79-01140/.</funding-statement></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>3GPP: Study on Integrated Access and Backhaul. Technical report (TR) 38.874 v16.0.0 (2018)</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>3GPP: Integrated Access and Backhaul (IAB) radio transmission and reception. Technical Specification (TS) 38.174 v17.2.0 (2022)</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Polese, M., Giordani, M., Zugno, T., Roy, A., Goyal, S., Castor, D. &amp; Zorzi, M. Integrated Access and Backhaul in 5G mmWave Networks: Potential and Challenges. IEEE Communications Magazine 58, 62-68. doi:10.1109/MCOM.001.1900346 (Mar. 2020).</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Sadovaya, Y., Molchanov, D., Mao, W., Orhan, O., Yeh, S.-p., Nikopour, H., Talwur, S. &amp; Andreev, S. Integrated access and backhaul in millimeter-wave cellular: Benefits and challenges. IEEE Communications Magazine 60, 81-86 (2022).</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Gomez-Cuba, F. &amp; Zorzi, M. Optimal link scheduling in millimeter wave multi-hop networks with MU-MIMO radios. IEEE Transactions on Wireless Communications 19, 1839-1854 (2020).</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Alghafari, H. &amp; Sayad Haghighi, M. Decentralized Joint Resource Allocation and Path Selection in Multi-hop Integrated Access Backhaul 5G Networks. Computer Networks, 108837. doi:10.1016/j.comnet.2022.108837 (Feb. 2022).</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Madapatha, C. et al. On topology optimization and routing in integrated access and backhaul networks: A genetic algorithm based approach. IEEE Open Journal of the Communications Society 2, 2273-2291 (2021).</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Tafintsev, N., Moltchanov, D., Yeh, S.-p., Nikopour, H., Mao, W., Orhan, O., Talwar, S., Valkama, M. &amp; Andreev, S. Joint Path Selection and Resource Allocation in Multi-Hop mmWave-based IAB Systems in ICC 2023 - IEEE International Conference on Communications (2023), 4194-4199. doi:10.1109/ICC45041.2023.10279180.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Jayasinghe, P., Tölli, A., Kaleva, J. &amp; Latva-Aho, M. Traffic Aware Beamformer Design for Flexible TDD-Based Integrated Access and Backhaul. IEEE Access 8, 205534-205549. doi:10.1109/ACCESS. 2020.3037814 (2020).</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Yarkina, N., Moltchanov, D. &amp; Koucheryavy, Y. Counter Waves Link Activation Policy for Latency Control in In-Band IAB Systems. IEEE Communications Letters 27, 3108-3112. doi:10. 1109/LCOMM.2023.3313233 (2023).</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Neely, M. Stochastic Network Optimization with Application to Communication and Queueing Systems doi:10.2200/S00271ED1V01Y201006CNT007 (2010).</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Tassiulas, L. &amp; Ephremides, A. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control 37, 1936-1948. doi:10.1109/9.182479 (1992).</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Silard, M., Fabian, P., Papadopoulos, G. Z. &amp; Savelli, P. Frequency Reuse in IAB-based 5G Networks using Graph Coloring Methods in 2022 Global Information Infrastructure and Networking Symposium (GIIS) (Argostoli, Greece, 2022), 104-110. doi:10.1109/GIIS56506.2022.9937005.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Nikolaev, D. &amp; Gaidamaka, Y. Leaf Node Polling Model Analysis in an Integrated Access and Backhaul Network in Information Technologies and Mathematical Modelling. Queueing Theory and Applications (eds Dudin, A., Nazarov, A. &amp; Moiseev, A.) (Springer Nature Switzerland, Cham, 2024), 106-117. doi:10.1007/978-3-031-65385-8_8.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Feoktistov, V., Nikolaev, D., Gaidamaka, Y. &amp; Samouylov, K. Analysis of Probabilistic Characteristics in the Integrated Access and Backhaul System in Distributed Computer and Communication Networks: Control, Computation, Communications (eds Vishnevskiy, V. M., Samouylov, K. E. &amp; Kozyrev, D. V.) (Springer Nature Switzerland, Cham, 2024), 277-290. doi:10.1007/978-3-031-50482-2_22.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Khayrov, E. &amp; Koucheryavy, Y. Packet Level Performance of 5G NR System Under Blockage and Micromobility Impairments. IEEE Access 11, 90383-90395. doi:10.1109/ACCESS.2023.3307021 (2023).</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Salimzyanov, R. &amp; Moiseev, A. Local balance equation for the probability distribution of the number of customers in the IAB network in SUITMM, Omsk (2023), 284-289.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Rykov, V. On analysis of periodic polling systems. Autom. Remote Control 70, 997-1018. doi:10.1134/S0005117909060071 (2009).</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Takagi, H. Analysis of polling systems p. 175. 175 pp. (MIT Press, 1986).</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Takagi, H. &amp; Kleinrock, L. A tutorial on the analysis of polling systems p. 172. 172 pp. (UCLA Computer Science Department, 1985).</mixed-citation></ref><ref id="B21"><label>21.</label><mixed-citation>Takagi, H. Mean message waiting times in symmetric multiqueue systems with cyclic service. Performance Evaluation 5, 271-277 (1985).</mixed-citation></ref><ref id="B22"><label>22.</label><mixed-citation>Zaripova, E. Metody analiza pokazateley effektivnosti telekommunikatsionnoy seti serverov protokola ustanovleniya sessiy [Methods of analyzing the efficiency indicators of the telecommunication network of session establishment protocol servers] p. 18. PhD thesis (RUDN, Moscow, 2015), 18.</mixed-citation></ref><ref id="B23"><label>23.</label><mixed-citation>Ge, J., Bao, L., Ding, H. &amp; Ding, X. Performance Analysis of the First-order Characteristics of Two-level Priority Polling System Based on Parallel Gated and Exhaustive Services Mode in 2021 IEEE 4th International Conference on Electronic Information and Communication Technology (ICEICT) (2021), 10-13. doi:10.1109/ICEICT53123.2021.9531122.</mixed-citation></ref><ref id="B24"><label>24.</label><mixed-citation>Vishnevsky, V. &amp; Semenova, O. Sistemy pollinga: Teoriya i primenenie v shirokopolosnykh besprovodnykh setyakh [Polling systems. Theory and applications for broadband wireless networks] p. 312. 312 pp. (Tekhnosfera, Moscow, 2012).</mixed-citation></ref></ref-list></back></article>
