<?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">45253</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2025-33-2-144-156</article-id><article-id pub-id-type="edn">BMHYOY</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">Asymptotic analysis of multiserver retrial queueing system with \(\pi\)-defeat of negative arrivals under heavy load</article-title><trans-title-group xml:lang="ru"><trans-title>Асимптотический анализ многолинейной RQ-системы с \(\pi\)-поражением в условии большой загрузки</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-8708-124X</contrib-id><contrib-id contrib-id-type="scopus">58304893200</contrib-id><contrib-id contrib-id-type="researcherid">MTF-1866-2025</contrib-id><name-alternatives><name xml:lang="en"><surname>Meloshnikova</surname><given-names>Natalya P.</given-names></name><name xml:lang="ru"><surname>Мелошникова</surname><given-names>Н. П.</given-names></name></name-alternatives><bio xml:lang="en"><p>PhD-student, Junior researcher of Laboratory of queueing theory and teletraffic theory</p></bio><email>meloshnikovana@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-8933-5322</contrib-id><contrib-id contrib-id-type="scopus">56439120600</contrib-id><contrib-id contrib-id-type="researcherid">E-3161-2017</contrib-id><name-alternatives><name xml:lang="en"><surname>Fedorova</surname><given-names>Ekaterina A.</given-names></name><name xml:lang="ru"><surname>Фёдорова</surname><given-names>Е. А.</given-names></name></name-alternatives><bio xml:lang="en"><p>PhD in Physical and Mathematical Sciences, Associate Professor of Department of Probability Theory and Mathematical Statistic</p></bio><email>ekat_fedorova@mail.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">National Research Tomsk State University</institution></aff><aff><institution xml:lang="ru">Национальный исследовательский Томский государственный университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-07-15" publication-format="electronic"><day>15</day><month>07</month><year>2025</year></pub-date><volume>33</volume><issue>2</issue><issue-title xml:lang="en">VOL 33, NO2 (2025)</issue-title><issue-title xml:lang="ru">ТОМ 33, №2 (2025)</issue-title><fpage>144</fpage><lpage>156</lpage><history><date date-type="received" iso-8601-date="2025-07-25"><day>25</day><month>07</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Meloshnikova N.P., Fedorova E.A.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Мелошникова Н.П., Фёдорова Е.А.</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Meloshnikova N.P., Fedorova E.A.</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/45253">https://journals.rudn.ru/miph/article/view/45253</self-uri><abstract xml:lang="en"><p>The paper studies a multiserver retrial queuing system with <span class="math inline">\(\pi\)</span>-defeat as a mathematical model of cloud services. The arrival processes of “positive” calls are Poisson. The system has a finite number of servers and the service time for calls at the servers is exponentially distributed. When all servers are busy, calls entering the system transfer to an orbit, where they experience a random delay. After the delay, calls from the orbit attempt to access the service unit according to a multiple access policy. The system also receives a stream of negative calls. Negative calls do not require the service. An negative call “deletes” a random number of calls is the service unit. For the considered model, the Kolmogorov equations are written in the steady state. The method of asymptotic analysis under a heavy load condition is applied for deriving the stationary probability distribution of the number of calls in the orbit. The results of the numerical analysis are presented.</p></abstract><trans-abstract xml:lang="ru"><p>В работе исследуется многолинейная RQ-система с <span class="math inline">\(\pi\)</span>-поражением как математическая модель облачных сервисов. На вход системы поступает простейший поток «положительных» заявок. В системе конечное число обслуживающих приборов, время обслуживания заявок на приборах распределено по экспоненциальному закону. Когда все приборы заняты, заявки поступающие в систему переходят на орбиту, где осуществляют случайную задержку. После осуществления задержки, заявки с орбиты обращаются к блоку обслуживания согласно политике множественного доступа. Также в систему поступает поток так называемых «отрицательных» заявок. Отрицательная заявка не нуждается в обслуживании: при поступлении она удаляет случайное число обслуживаемых заявок. Для рассматриваемой модели записаны уравнения Колмогорова в стационарном режиме. Предлагается метод асимптотического анализа в условии большой загрузки для нахождения стационарного распределения вероятностей числа заявок на орбите. Представлены результаты численного анализа.</p></trans-abstract><kwd-group xml:lang="en"><kwd>mathematical modelling</kwd><kwd>retrial queueing system</kwd><kwd>negative calls</kwd><kwd>asymptotic analysis</kwd><kwd>heavy load</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>математическое моделирование</kwd><kwd>система массового обслуживания с повторными вызовами</kwd><kwd>отрицательные заявки</kwd><kwd>асимптотический анализ</kwd><kwd>большая загрузка</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Kavis, M. J. Architecting the Cloud: Design Decisions for Cloud Computing Service Models 224 pp. (Wiley; 1st edition, 2014).</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Boccardi, F., Heath, R. W., Lozano, A., Marzetta, T. L. &amp; Popovski, P. Five disruptive technology directions for 5G. IEEE Communications Magazine 52, 74-80 (May 2014).</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Ferrus, R., Sallent, O., Pérez-Romero, J. &amp; Agustí, R. Management of Network Slicing in 5G Radio Access Networks. Functional Framework and Information Models (2018).</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Wu, J., Wang, M., Chan, Y. C., Wong, E. W. M. &amp; Kim, T. Performance Evaluation of 5G mmWave Networks with Physical-Layer and Capacity-Limited Blockingm. IEEE 21st International Conference on High Performance Switching and Routing (HPSR), 1-6 (May 2020).</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Artalejo, J. R. &amp; Gomez-Corral, A. Retrial Queueing Systems 318 pp. (Springer Berlin, 2008).</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Falin, G. &amp; Templeton, J. Retrial Queues 320 pp. (Taylor &amp; Francis, 1997).</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Phung-Duc, T. Retrial Queueing Models: A Survey on Theory and Applications. Stochastic Operations Research in Business and Industry, 1-26 (May 2017).</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Gelenbe, E. Product-form queueing networks with negative and positive customers. Journal of Applied Probability 7, 656-663 (1991).</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Gelenbe, E., Glynn, P. &amp; Sigman, K. Queues with Negative Arrivals. J. Appl. Probab 28, 245-250 (1991).</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Gelenbe, E. G-networks with signals and batch removal. Probability in the Engineering and Informational Sciences Vоl. 7, 335-343 (1993).</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Do, T. Bibliography on G-networks, negative customers and applications. Mathematical and Computer Modelling, 205-212 (2011).</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Caglayan, M. G-networks and their applications to machine learning, energy packet networks and routing: introduction to the special issue. Probability in the Engineering and Informational Sciences 31, 381-395 (2017).</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Bocharov, P. &amp; Vishnevsky, V. G-networks: development of the theory of multiplicative networks. Russian. Automation and Telemechanics Vol. 5, 70-74 (2003).</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Shin, Y. Multi-server retrial queue with negative customers and disasters. Queueing Syst, 223-337 (2007).</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Pechinkin, A. &amp; Razumchik, R. A Method for Calculating Stationary Queue Distribution in a Queuing System with Flows of Ordinary and Negative Claims and a Bunker for Superseded Claims. J. Commun. Technol. Electron. 57, 882-891 (2012).</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Matalytski, M. &amp; Naumenko, V. Analysis of the queueing network with a random bounded waiting time of positive and negative customers at a non-stationary regime. Journal of Applied Mathematics and Computational Mechanics 16, 97-108 (2017).</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Liu, T., Hsu, H. &amp; Chang, F. Multi-Server Two-Way Communication Retrial Queue Subject to Disaster and Synchronous Working Vacation. Algorithms 18, 24 (May 2025).</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Melikov, A., Poladova, L., Edayapurath, S. &amp; Sztrik, J. Single-Server Queuing-Inventory Systems with Negative Customers and Catastrophes in the Warehouse. Mathematics 11 (2023).</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Lisovskaya, E., Fedorova, E., Salimzyanov, R. &amp; Moiseeva, S. Resource Retrial Queue with Two Orbits and Negative Customers. Mathematics 10, 321 (May 2022).</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Meloshnikova, N. &amp; Fedorova, E. Asymptotic Analysis of a multiserver RQ-system with disasters in a service block under heavy load Russian. in Information and telecommunication technologies and mathematical modeling of high-tech systems: Proceedings of the All-Russian conference with international participation (RUDN, Moscow, Russian Federation, April 7-11, 2025), (in print).</mixed-citation></ref><ref id="B21"><label>21.</label><mixed-citation>Meloshnikova, N. Study Retrial Queue M|M|N with negative calls under heavy load Russian. in Proceedings of Tomsk State University. Physics and Mathematics Series: Mathematical and Software Support of Information, Technical, and Economic Systems: Materials of the IX International Scientific Conference. 307 (Tomsk State University Publishing House, Tomsk, Russian Federation, May 26-28, 2021), 165-168.</mixed-citation></ref></ref-list></back></article>
