<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.37661/1816-0301-2020-17-1-29-38</article-id><article-id custom-type="elpub" pub-id-type="custom">inform-944</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИЧЕСКОЕ МОДЕЛИРОВАНИЕ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICAL MODELING</subject></subj-group></article-categories><title-group><article-title>Анализ системы обслуживания с повторными  вызовами, неоднородными приборами  и марковским процессом поступления</article-title><trans-title-group xml:lang="en"><trans-title>Analysis of retrial queue with heterogeneous servers  and Markovian arrival process</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Лю</surname><given-names>Мэй</given-names></name><name name-style="western" xml:lang="en"><surname>Liu</surname><given-names>Mei</given-names></name></name-alternatives><bio xml:lang="ru"><p>Лю Мэй, аспирантка кафедры теории вероятностей и математической статистики факультета прикладной математики и информатики</p></bio><bio xml:lang="en"><p>Liu Mei, Postgraduate Student of Department of Probability Theory and Mathematical Statistics of   Faculty of Applied Mathematics and сomputer Science</p></bio><email xlink:type="simple">liumei19910101@126.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет</institution></aff><aff xml:lang="en"><institution>Belarusian State University</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>26</day><month>02</month><year>2020</year></pub-date><volume>17</volume><issue>1</issue><fpage>29</fpage><lpage>38</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Лю М., 2020</copyright-statement><copyright-year>2020</copyright-year><copyright-holder xml:lang="ru">Лю М.</copyright-holder><copyright-holder xml:lang="en">Liu M.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://inf.grid.by/jour/article/view/944">https://inf.grid.by/jour/article/view/944</self-uri><abstract><p>Анализируется многолинейная система массового обслуживания с повторными попытками и разнородными приборами. Запросы поступают в систему в соответствии с марковским процессом прибытия. Прибывающие первичные запросы и запросы, которые повторяют попытки попасть на обслуживание с орбиты, занимают свободный прибор с самой высокой скоростью обслуживания, если таковой имеется. В противном случае, если все приборы заняты,  запросы переходят на орбиту  бесконечной емкости, с которой осуществляют повторные попытки попасть на обслуживание. Общая интенсивность потока повторных попыток бесконечно возрастает с увеличением числа запросов на орбите. Время обслуживания запроса имеет экспоненциальное распределение с интенсивностью, зависящей от номера прибора. Поведение системы описывается многомерной цепью Маркова с непрерывным временем, которая принадлежит классу асимптотически квазитеплицевых цепей Маркова. Это позволяет вывести простое и прозрачное условие эргодичности и вычислить стационарное распределение вероятностей состояний цепи. Представленные численные результаты иллюстрируют динамику некоторых показателей эффективности системы и важность учета корреляции в процессе поступления запросов.</p></abstract><trans-abstract xml:lang="en"><p>Multi-server retrial queueing system with heterogeneous servers is analyzed. Requests arrive to the system according to the Markovian arrival process. Arriving primary requests and requests retrying from orbit occupy an available server with the highest service rate, if there is any available server. Otherwise, the requests move to the orbit having an infinite capacity. The total retrial rate infinitely increases when the number of requests in orbit increases. Service periods have exponential distribution. Behavior of the system is described by multi-dimensional continuous-time Markov chain which belongs to the class of asymptotically quasi-toeplitz Markov chains. This allows to derive simple and transparent ergodicity condition and compute the stationary probabilities distribution of chain states. Presented numerical results illustrate the dynamics of some system effectiveness indicators and the importance of considering of correlation in the requests arrival process.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>система массового обслуживания</kwd><kwd>разнородные приборы</kwd><kwd>марковский процесс прибытия</kwd><kwd>повторные вызовы</kwd><kwd>асимптотически квазитеплицевая цепь Маркова</kwd></kwd-group><kwd-group xml:lang="en"><kwd>retrial queue</kwd><kwd>heterogeneous servers</kwd><kwd>markovian arrival process</kwd><kwd>retrials</kwd><kwd>asymptotically quasi-toeplitz Markov chain</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Artalejo J. R., Gomez-Corral A. Retrial Queueing Systems: a Computational Approach. Springer, Berlin – Heidelberg, 2008, 318 р.</mixed-citation><mixed-citation xml:lang="en">Artalejo J. R., Gomez-Corral A. Retrial Queueing Systems: a Computational Approach. Springer, Berlin – Heidelberg, 2008, 318 р.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Falin G. I., Templeton J. G. C. Retrial Queues. Chapman &amp; Hall, London, 1997, 328 р.</mixed-citation><mixed-citation xml:lang="en">Falin G. I., Templeton J. G. C. Retrial Queues. Chapman &amp; Hall, London, 1997, 328 р.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Breuer L., Dudin A. N., Klimenok V. I. A retrial system. Queueing Systems, 2002, vol. 40, pp. 433–457.</mixed-citation><mixed-citation xml:lang="en">Breuer L., Dudin A. N., Klimenok V. I. A retrial system. Queueing Systems, 2002, vol. 40, pp. 433–457.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Lucantoni D. New results on the single server queue with a batch Markovian arrival process. Communication in Statistics-Stochastic Models, 1991, vol. 7, pp. 1–46.</mixed-citation><mixed-citation xml:lang="en">Lucantoni D. New results on the single server queue with a batch Markovian arrival process. Communication in Statistics-Stochastic Models, 1991, vol. 7, pp. 1–46.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Chakravarthy S. R. The batch Markovian arrival process: a review and future work. In Krishnamoorthy A., Raju N., Ramaswami V. (eds.). Advances in Probability Theory and Stochastic Processes, Notable Publications Inc., New Jersey, 2001, pp. 21–29.</mixed-citation><mixed-citation xml:lang="en">Chakravarthy S. R. The batch Markovian arrival process: a review and future work. In Krishnamoorthy A., Raju N., Ramaswami V. (eds.). Advances in Probability Theory and Stochastic Processes, Notable Publications Inc., New Jersey, 2001, pp. 21–29.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Vishnevskii V. M., Dudin A. N. Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks. Automation and Remote Control, 2017, vol. 78, pp. 1361–1403.</mixed-citation><mixed-citation xml:lang="en">Vishnevskii V. M., Dudin A. N. Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks. Automation and Remote Control, 2017, vol. 78, pp. 1361–1403.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Neuts M. Matrix-Geometric Solutions in Stochastic Models. The Johns Hopkins University Press, Baltimore, 1981, 352 р.</mixed-citation><mixed-citation xml:lang="en">Neuts M. Matrix-Geometric Solutions in Stochastic Models. The Johns Hopkins University Press, Baltimore, 1981, 352 р.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Efrosinin D. V. Controlled Queueing Systems with Heterogeneous Servers. Trier University, Germany, 2004, 229 р.</mixed-citation><mixed-citation xml:lang="en">Efrosinin D. V. Controlled Queueing Systems with Heterogeneous Servers. Trier University, Germany, 2004, 229 р.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Lin W., Kumar P. R. Optimal control of a queueing system with two heterogeneous servers. IEEE Transactions on Automatic Control, 1984, vol. 29, pp. 696–703.</mixed-citation><mixed-citation xml:lang="en">Lin W., Kumar P. R. Optimal control of a queueing system with two heterogeneous servers. IEEE Transactions on Automatic Control, 1984, vol. 29, pp. 696–703.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Luh H. P., Viniotis I. Optimality of Threshold Policies for Heterogeneous Server Systems. Raleign, North Carolina State University, 1990.</mixed-citation><mixed-citation xml:lang="en">Luh H. P., Viniotis I. Optimality of Threshold Policies for Heterogeneous Server Systems. Raleign, North Carolina State University, 1990.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Nobel R., Tijms H. C. Optimal control of a queueing system with heterogeneous servers. IEEE Transactions on Automatic Control, 2000, vol. 45, no. 4, pp. 780–784.</mixed-citation><mixed-citation xml:lang="en">Nobel R., Tijms H. C. Optimal control of a queueing system with heterogeneous servers. IEEE Transactions on Automatic Control, 2000, vol. 45, no. 4, pp. 780–784.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Rosberg Z., Makowski A. M. Optimal routing to parallel heterogeneous servers-small arrival rates. Transactions on Automatic Control, 1990, vol. 35, no. 7, pp. 789–796.</mixed-citation><mixed-citation xml:lang="en">Rosberg Z., Makowski A. M. Optimal routing to parallel heterogeneous servers-small arrival rates. Transactions on Automatic Control, 1990, vol. 35, no. 7, pp. 789–796.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Rykov V. V. Monotone control of queueing systems with heterogeneous servers. Queueing Systems, 2001, vol. 37, pp. 391–403.</mixed-citation><mixed-citation xml:lang="en">Rykov V. V. Monotone control of queueing systems with heterogeneous servers. Queueing Systems, 2001, vol. 37, pp. 391–403.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Rykov V. V., Efrosinin D. V. Numerical analysis of optimal control polices for queueing systems with heterogeneous servers. Information Processes, 2002, vol. 2, no. 2, pp. 252–256.</mixed-citation><mixed-citation xml:lang="en">Rykov V. V., Efrosinin D. V. Numerical analysis of optimal control polices for queueing systems with heterogeneous servers. Information Processes, 2002, vol. 2, no. 2, pp. 252–256.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Efrosinin D., Breuer L. Threshold policies for controlled retrial queues with heterogeneous servers. Annals of Operations Research, 2006, vol. 41, no. 1, pp. 139–162.</mixed-citation><mixed-citation xml:lang="en">Efrosinin D., Breuer L. Threshold policies for controlled retrial queues with heterogeneous servers. Annals of Operations Research, 2006, vol. 41, no. 1, pp. 139–162.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Falin G. Stability of the multiserver queue with addressed retrials. Annals of Operations Research, 2012, vol. 196, no. 1, рр. 241–246.</mixed-citation><mixed-citation xml:lang="en">Falin G. Stability of the multiserver queue with addressed retrials. Annals of Operations Research, 2012, vol. 196, no. 1, рр. 241–246.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Mushko V. V. Multiserver queue with addressed retrials. Annals of Operations Research, 2006, vol. 141, pp. 283–301.</mixed-citation><mixed-citation xml:lang="en">Mushko V. V. Multiserver queue with addressed retrials. Annals of Operations Research, 2006, vol. 141, pp. 283–301.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Klimenok V., Dudin A. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems, 2006, vol. 54, no. 4, pp. 245–259.</mixed-citation><mixed-citation xml:lang="en">Klimenok V., Dudin A. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems, 2006, vol. 54, no. 4, pp. 245–259.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Dudin S., Dudina O. Retrial multi-server queueing system with PHF service time distribution as a model of a channel with unreliable transmission of information. Applied Mathematical Modelling, 2019, vol. 65, pp. 676–695.</mixed-citation><mixed-citation xml:lang="en">Dudin S., Dudina O. Retrial multi-server queueing system with PHF service time distribution as a model of a channel with unreliable transmission of information. Applied Mathematical Modelling, 2019, vol. 65, pp. 676–695.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
