<?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">43667</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2024-32-4-380-394</article-id><article-id pub-id-type="edn">DDNAPR</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 diffusion analysis of RQ system M/M/1 with unreliable server</article-title><trans-title-group xml:lang="ru"><trans-title>Асимптотически диффузионный анализ RQ системы с ненадёжным прибором</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-9044-5211</contrib-id><contrib-id contrib-id-type="scopus">57802914700</contrib-id><contrib-id contrib-id-type="researcherid">AAD-2035-2019</contrib-id><name-alternatives><name xml:lang="en"><surname>Voronina</surname><given-names>Nataliya M.</given-names></name><name xml:lang="ru"><surname>Воронина</surname><given-names>Н. М.</given-names></name></name-alternatives><bio xml:lang="en"><p>Senior Lecturer of Department of Information Technology of School of Information Technology and Robotics Engineering</p></bio><email>vnm@tpu.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-8888-9291</contrib-id><contrib-id contrib-id-type="scopus">6603581666</contrib-id><contrib-id contrib-id-type="researcherid">F-5512-2017</contrib-id><name-alternatives><name xml:lang="en"><surname>Rozhkova</surname><given-names>Svetlana V.</given-names></name><name xml:lang="ru"><surname>Рожкова</surname><given-names>С. В.</given-names></name></name-alternatives><bio xml:lang="en"><p>Doctor of Physics and Mathematics Sciences, Professor of Department of Mathematics and Mathematical Physics of School of Nuclear Technology Engineering, National Research Tomsk Polytechnic University, Professor of Department of Probability Theory and Mathematical Statistics Institute of Applied Mathematics and Computer Science, National Research Tomsk State University</p></bio><email>rozhkova@tpu.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">National Research Tomsk Polytechnic University</institution></aff><aff><institution xml:lang="ru">Национальный исследовательский Томский политехнический университет</institution></aff></aff-alternatives><aff-alternatives id="aff2"><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="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>380</fpage><lpage>394</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, Voronina N.M., Rozhkova S.V.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024, Воронина Н.М., Рожкова С.В.</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">Voronina N.M., Rozhkova S.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/43667">https://journals.rudn.ru/miph/article/view/43667</self-uri><abstract xml:lang="en"><p>The paper considers a single-line retrial queueing system with an unreliable server. Queuing systems are called unreliable if their servers may fail from time to time and require restoration (repair), only after which they can resume servicing customers. The input of the system is a simple Poisson flow of customers. The service time and uptime of the server are distributed exponentially. An incoming customer try to get service. The server can be free, busy or under repair. The customer is serviced immediately if the server is free. If it is busy or under repair, the customer goes into orbit. And after a random time it tries to get service again. The study is carried out by the method of asymptotically diffusion analysis under the condition of a large delay of requests in orbit. In this work, the transfer coefficient and diffusion coefficient were found and a diffusion approximation</p></abstract><trans-abstract xml:lang="ru"><p>В работе рассматривается однолинейная RQ-система массового обслуживания с ненадёжным прибором. Системы массового обслуживания называются ненадёжными, если их приборы могут время от времени выходить из строя и требовать восстановления (ремонта), только после которого они могут возобновить обслуживание запросов. Исследование проводится методом асимптотически диффузионного анализа в условии большой задержки заявок на орбите. Найдены стационарное распределение состояний прибора, коэффициент переноса и коэффициент диффузии. Построена диффузионная аппроксимация. Доказано, что точность диффузионной аппроксимации превышает точность гауссовской аппроксимации.</p></trans-abstract><kwd-group xml:lang="en"><kwd>retrial queuing system</kwd><kwd>asymptotic diffusion method</kwd><kwd>unreliable device</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>RQ система</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>Gross, D., Shortle, J. F., Thompson, J. M. &amp; Harris, C. M. Fundamentals of queueing theory (John wiley &amp; sons, 2011).</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>G.Gosztony. Repeated call attempts and their effect on trafic engineering. Budavox Telecommunication Review 2, 16-26 (1976).</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Cohen, J. Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecommunication Rev. 18, 49 (1957).</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Hanczewski, S., Stasiak, M., Weissenberg, J. &amp; Zwierzykowski, P. Queuing model of the access system in the packet network in Computer Networks (2016), 283-293.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Falin, G. I. &amp; Templeton, J. G. C. Retrial Queues 320 pp. doi:10.1201/9780203740767 (Chapman &amp; Hall, London, 1997).</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Artalejo, J. R. &amp; Gómez-Corral, A. Retrial Queueing Systems doi:10.1007/978-3-540-78725-9 (Springer Berlin Heidelberg, 2008).</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Dimitriou, I. A queueing model with two classes of retrial customers and paired services. Annals of Operations Research 238, 123-143. doi:10.1007/s10479-015-2059-2 (2016).</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Wang, J., Cao, J. &amp; Li, Q. Reliability analysis of the retrial queue with server breakdowns and repairs. Queueing Systems 38, 363-380 (2001).</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Kumar, M. S. &amp; Arumuganathan, R. An MX/G/1 retrial queue with two-phase service subject to active server breakdowns and two types of repair. International Journal of Operational Research 8, 261-291 (2010).</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Kim, C., Klimenok, V. I. &amp; Orlovsky, D. S. The BMAP/PH/N retrial queue with Markovian flow of breakdowns. European Journal of Operational Research 189, 1057-1072 (2008).</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Lakaour, L., Aissani, D., Adel-Aissanou, K., Barkaoui, K. &amp; Ziani, S. An unreliable single server retrial queue with collisions and transmission errors. Communications in Statistics-Theory and Methods 51, 1085-1109 (2022).</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Danilyuk, E. Y., Janos, S., et al. Asymptotic analysis of retrial queueing system M/M/1 with impatient customers, collisions and unreliable server. Journal of Siberian Federal University. Mathematics &amp; Physics 13, 218-230. doi:10.17516/1997-1397-2020-13-2-218-230 (2020).</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Tóth, Á. &amp; Sztrik, J. Simulation of Finite-Source Retrial Queuing Systems With Collisions, Non-Reliable Server and Impatient Customers in the Orbit. in ICAI (2020), 408-419.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Kuki, A., Bérczes, T., Sztrik, J. &amp; Kvach, A. Numerical Analysis of Retrial Queueing Systems with Conflict of Customers and an Unreliable Server. Journal of Mathematical Sciences 237, 673-683. doi:10.1007/s10958-019-04193-1 (2019).</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Nazarov, A. A., Paul, S. V. &amp; Lizyura, O. D. Two-way communication retrial queue with unreliable server and multiple types of outgoing calls. Discrete and Continuous Models and Applied Computational Science 28, 49-61. doi:10.22363/2658-4670-2020-28-1-49-61 (2020).</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Dudin, A., Dudina, O., Dudin, S. &amp; Samouylov, K. Analysis of Single-Server Multi-Class Queue with Unreliable Service, Batch Correlated Arrivals, Customers Impatience, and Dynamical Change of Priorities. Mathematics 9, 1257. doi:10.3390/math9111257 (2021).</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Chakravarthy, S. R., OZKAR, S. &amp; SHRUTI, S. Analysis of M/M/C retrial queue with thresholds, PH distribution of retrial times and unreliable servers. Journal of applied mathematics &amp; informatics 39, 173-196 (2021).</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Falin, G. An M/G/1 retrial queue with an unreliable server and general repair times. Performance Evaluation 67, 569-582 (2010).</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Dudin, A., Klimenok, V. &amp; Vishnevsky, V. Analysis of unreliable single server queueing system with hot back-up server in Optimization in the Natural Sciences: 30th Euro Mini-Conference, EmC-ONS 2014, Aveiro, Portugal, February 5-9, 2014. Revised Selected Papers 30 (2015), 149-161.</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Nazarov, A. A., Paul, S. V., Lizyura, O. D., et al. Two-way communication retrial queue with unreliable server and multiple types of outgoing calls. Discrete and Continuous Models and Applied Computational Science. doi:10.22363/2658-4670-2020-28-1-49-61 (2020).</mixed-citation></ref><ref id="B21"><label>21.</label><mixed-citation>Voronina, N. M., Fedorova, E. A. &amp; Rozhkova, S. V. Asymptotic analysis of the RQ-system M/M/1 with an unreliable server. Mathematical and software for information technical and economic systems, 304-309. doi:10.1007/978-3-031-09331-9_28 (2020).</mixed-citation></ref></ref-list></back></article>
