<?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">24702</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2020-28-3-205-215</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</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">On the rate of convergence for a class of Markovian queues with group services</article-title><trans-title-group xml:lang="ru"><trans-title>О скорости сходимости одного класса марковских цепей с групповым обслуживанием требований</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Kryukova</surname><given-names>Anastasia L.</given-names></name><name xml:lang="ru"><surname>Крюкова</surname><given-names>А. Л.</given-names></name></name-alternatives><bio xml:lang="en"><p>Lecturer of Department of Applied Mathematics</p></bio><email>kryukovaforstudents@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Vologda State University</institution></aff><aff><institution xml:lang="ru">Вологодский государственный университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2020-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2020</year></pub-date><volume>28</volume><issue>3</issue><issue-title xml:lang="en">VOL 28, NO3 (2020)</issue-title><issue-title xml:lang="ru">ТОМ 28, №3 (2020)</issue-title><fpage>205</fpage><lpage>215</lpage><history><date date-type="received" iso-8601-date="2020-09-28"><day>28</day><month>09</month><year>2020</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2020, Kryukova A.L.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2020, Крюкова А.Л.</copyright-statement><copyright-year>2020</copyright-year><copyright-holder xml:lang="en">Kryukova A.L.</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/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/24702">https://journals.rudn.ru/miph/article/view/24702</self-uri><abstract xml:lang="en"><p>There are many queuing systems that accept single arrivals, accumulate them and service only as a group. Examples of such systems exist in various areas of human life, from traffic of transport to processing requests on a computer network. Therefore, our study is actual. In this paper some class of finite Markovian queueing models with single arrivals and group services are studied. We considered the forward Kolmogorov system for corresponding class of Markov chains. The method of obtaining bounds of convergence on the rate via the notion of the logarithmic norm of a linear operator function is not applicable here. This approach gives sharp bounds for the situation of essentially non-negative matrix of the corresponding system, but in our case it does not hold. Here we use the method of ‘differential inequalities’ to obtaining bounds on the rate of convergence to the limiting characteristics for the class of finite Markovian queueing models. We obtain bounds on the rate of convergence and compute the limiting characteristics for a specific non-stationary model too. Note the results can be successfully applied for modeling complex biological systems with possible single births and deaths of a group of particles.</p></abstract><trans-abstract xml:lang="ru"><p>Существует множество систем массового обслуживания, которые принимают единичные требования, накапливают их и обслуживают только как группу. Примеры таких систем можно найти в различных областях человеческой жизни от трафика транспортных перевозок до обработки запросов в компьютерных сетях. Этим обуславливается актуальность нашего исследования. В этой статье изучается некоторый класс конечных марковских моделей массового обслуживания с одиночным прибытием и групповым обслуживанием. Рассмотрена прямая система Колмогорова для соответствующего класса цепей Маркова. Метод определения границ сходимости, основанный на понятии логарифмической нормы, здесь не применим. Такой подход даёт точные оценки для моделей, для которых матрица соответствующей системы существенно неотрицательна, но в нашем случае это не так. Здесь мы использовали новый метод «дифференциальных неравенств» для получение оценки скорости сходимости для этого класса конечных марковских моделей. Кроме того, мы получили оценки скорости сходимости и вычислили предельные характеристики и для соответствующей нестационарной модели. Заметим, что результаты могут быть успешно применены для моделирования сложных биологических систем, в которых возможны рождения новых особей только по одной и гибель групп.</p></trans-abstract><kwd-group xml:lang="en"><kwd>queuing system</kwd><kwd>Markovian queues</kwd><kwd>forward Kolmogorov system</kwd><kwd>rate of convergence</kwd><kwd>limiting characteristics</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>система массового обслуживания</kwd><kwd>марковский процесс</kwd><kwd>прямая система Колмогорова</kwd><kwd>скорость сходимости</kwd><kwd>предельные характеристики</kwd></kwd-group><funding-group><funding-statement xml:lang="en">This research was supported by Russian Science Foundation under grant 19-11-00020.</funding-statement></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>R. Nelson, D. Towsley, and A. N. Tantawi, “Performance analysis of parallel processing systems,” IEEE Transactions on Software Engineering, vol. 14, no. 4, pp. 532–540, 1988. DOI: 10.1109/32.4676.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>J. Li and L. Zhang, “MX /M /c Queue with catastrophes and statedependent control at idle time,” Frontiers of Mathematics in China, vol. 12, no. 6, pp. 1427–1439, 2017. DOI: 10.1007/s11464-017-0674-8.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>A. Zeifman, R. Razumchik, Y. Satin, K. Kiseleva, A. Korotysheva, and V. Korolev, “Bounds on the rate of convergence for one class of inhomogeneous Markovian queueing models with possible batch arrivals and services,” International Journal of Applied Mathematics and Computer Science, vol. 28, pp. 141–154, 2018. DOI: 10.2478/amcs-2018-0011.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>A. Zeifman, A. Sipin, V. Korolev, G. Shilova, K. Kiseleva, A. Korotysheva, and Y. Satin, “On Sharp Bounds on the Rate of Convergence for Finite Continuous-time Markovian Queueing Models,” in Computer Aided Systems Theory — EUROCAST 2017. EUROCAST 2017. Lecture Notes in Computer Science, R. Moreno-Díaz, F. Pichler, and A. Quesada-Arencibia, Eds., vol. 10672, 2018, pp. 20–28. DOI: 10.1007/978-3-319-74727-9_3.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>A. Zeifman, Y. Satin, A. Kryukova, R. Razumchik, K. Kiseleva, and G. Shilova, “On the Three Methods for Bounding the Rate of Convergence for some Continuous-time Markov Chains,” International Journal of Applied Mathematics and Computer Science, vol. 30, pp. 251–266, 2020. DOI: 10.34768/amcs-2020-0020.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Y. Satin, A. Zeifman, and A. Kryukova, “On the Rate of Convergence and Limiting Characteristics for a Nonstationary Queueing Model,” Mathematics, vol. 7, no. 678, pp. 1–11, 2019. DOI: 10.3390/math7080678.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>B. Almasi, J. Roszik, and J. Sztrik, “Homogeneous finite-source retrial queues with server subject to breakdowns and repairs,” Mathematical and Computer Modelling, vol. 42, no. 5, pp. 673–682, 2005. DOI: 10. 1016/j.mcm.2004.02.046.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>A. Brugno, C. D’Apice, A. Dudin, and R. Manzo, “Analysis of an MAP /PH/1 queue with flexible group service,” International Journal of Applied Mathematics and Computer Science, vol. 27, no. 1, pp. 119–131, 2017. DOI: 10.1515/amcs-2017-0009.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>A. Di Crescenzo, V. Giorno, B. K. Kumar, and A. Nobile, “A Time-Non-Homogeneous Double-Ended Queue with Failures and Repairs and Its Continuous Approximation,” Mathematics, vol. 6, no. 5, p. 81, 2018. DOI: 10.3390/math6050081.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>A. N. V. Giorno and S. Spina, “On some time non-homogeneous queueing systems with catastrophes,” Applied Mathematics and Computation, vol. 245, pp. 220–234, 2014. DOI: 10.1016/j.amc.2014.07.076.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>B. Granovsky and A. Zeifman, “Nonstationary Queues: Estimation of the Rate of Convergence,” Queueing Systems, vol. 46, pp. 363–388, 2004. DOI: 10.1023/B:QUES.0000027991.19758.b4.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>H. LI, Q. Zhao, and Z. Yang, “Reliability Modeling of Fault Tolerant Control Systems,” International Journal of Applied Mathematics and Computer Science, vol. 17, no. 4, pp. 491–504, 2007. DOI: 10.2478/v10006-007-0041-0.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>A. Moiseev and A. Nazarov, “Queueing network MAP − (GI/∞)K with high-rate arrivals,” European Journal of Operational Research, vol. 254, no. 1, pp. 161–168, 2016. DOI: 10.1016/j.ejor.2016.04.011.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>J. Schwarz, G. Selinka, and R. Stolletz, “Performance analysis of time-dependent queueing systems: Survey and classification,” Omega, vol. 63, pp. 170–189, 2016. DOI: 10.1016/j.omega.2015.10.013.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>N. Vvedenskaya, A. Logachov, Y. Suhov, and A. Yambartsev, “A Local Large Deviation Principle for Inhomogeneous Birth-Death Processes,” Problems of Information Transmission, vol. 54, no. 3, pp. 263–280, 2018. DOI: 10.1134/S0032946018030067.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>A. Zeifman, S. Leorato, E. Orsingher, Y. Satin, and G. Shilova, “Some universal limits for nonhomogeneous birth and death processes,” Queueing Systems, vol. 52, no. 2, pp. 139–151, 2006. DOI: 10.1007/s11134-006-4353-9.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>A. Zeifman, V. Korolev, Y. Satin, A. Korotysheva, and V. Bening, “Perturbation Bounds and Truncations for a Class of Markovian Queues,” Queueing Systems, vol. 76, no. 2, pp. 205–221, 2014. DOI: 10.1007/s11134-013-9388-0.</mixed-citation></ref></ref-list></back></article>
