<?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-2022-19-2-56-67</article-id><article-id custom-type="elpub" pub-id-type="custom">inform-1201</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>A retrial queueing system with processor sharing and impatient customers</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-3903-6444</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Клименок</surname><given-names>В. И.</given-names></name><name name-style="western" xml:lang="en"><surname>Klimenok</surname><given-names>V. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Клименок Валентина Ивановна, доктор физико-математических наук, профессор, главный научный сотрудник научно-исследовательской лаборатории прикладного вероятностного анализа</p><p>пр. Независимости, 4, Минск, 220030, Беларусь</p></bio><bio xml:lang="en"><p>Valentina I. Klimenok, D. Sc., Prof., Chief Scientific Researcher of Laboratory of Applied Probability</p><p>av. Nezavisimosti, 4, Minsk, 220030, Belarus</p></bio><email xlink:type="simple">klimenok@bsu.by</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>Belorussian State University</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>18</day><month>03</month><year>2022</year></pub-date><volume>19</volume><issue>2</issue><fpage>56</fpage><lpage>67</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Клименок В.И., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Клименок В.И.</copyright-holder><copyright-holder xml:lang="en">Klimenok V.I.</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/1201">https://inf.grid.by/jour/article/view/1201</self-uri><abstract><sec><title>Цели</title><p>Цели. Рассматривается задача построения и исследования математической модели стохастической системы с разделением процессора, повторными вызовами и нетерпеливостью запросов. Данная система формализована в виде системы массового обслуживания, построен процесс функционирования системы, найдено условие существования стационарного распределения и предложены алгоритмы вычисления стационарного распределения и стационарных характеристик производительности системы.</p></sec><sec><title>Методы</title><p>Методы. Используются методы теории вероятностей, теории массового обслуживания и теории матриц.</p></sec><sec><title>Результаты</title><p>Результаты. Функционирование системы описано в терминах многомерной цепи Маркова. Показано, что эта цепь имеет стационарное распределение, совпадающее с эргодическим, при любых приемлемых значениях параметров, описывающих входной поток, время обслуживания, процесс повторных вызовов и процесс ухода запросов из системы вследствие нетерпеливости.</p></sec><sec><title>Заключение</title><p>Заключение. Исследован стационарный режим функционирования системы массового обслуживания с повторными вызовами, разделением процессора и двумя типами запросов, поступающих в систему в соответствии с маркированным марковским потоком. Пропускная способность канала делится между запросами двух типов в некоторой пропорции, а число запросов каждого из типов, одновременно находящихся на приборе, ограничено. Запросы одного из типов, заставшие все отведенные для них каналы занятыми, с некоторой вероятностью уходят из системы необслуженными и с дополнительной вероятностью идут на орбиту бесконечного объема, откуда делают попытки попасть на обслуживание через случайные промежутки времени. Запросы второго типа, заставшие все отведенные для них каналы занятыми, теряются. Запросы, находящиеся на орбите, проявляют нетерпеливость: каждый из них может покинуть орбиту навсегда по истечении экспоненциально распределенного времени при условии, что он не попадет на обслуживание за это время. Времена обслуживания запросов распределены по фазовому закону с разными параметрами. Функционирование системы описано в терминах многомерной цепи Маркова. Доказано, что при любых значениях параметров системы эта цепь имеет стационарное распределение. Предложены алгоритмы вычисления стационарного распределения и ряда характеристик производительности системы. Результаты исследования могут быть использованы для моделирования работы соты фиксированной емкости в беспроводной сотовой сети связи и других реальных систем, функционирующих в режиме разделения процессора.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. The problem of constructing and investigating a mathematical model of a stochastic system with processor sharing, repeated calls, and customer impatience is considered. This system is formalized in the form of a queueing system. The operation of the queue is described in terms of multi-dimensional Markov chain. A condition for the existence of a stationary distribution is found, and algorithms for calculating the stationary distribution and stationary performance characteristics of the system are proposed.</p></sec><sec><title>Methods</title><p>Methods. Methods of probability theory, queueing theory and matrix theory are used.</p></sec><sec><title>Results</title><p>Results. The steady state operation of a queueing system with repeated calls, processor sharing and two types of customers arriving in a marked Markovian arrival process is studied. The channel bandwidth is divided between two types of customers in a certain proportion, and the number of customers of each type simultaneously located on the server is limited. Customers of one of the types that have made all the channels assigned to them busy leave the system unserved with some probability and, with an additional probability, go to the orbit of infinite size, from where they make attempts to get service at random time intervals. Customers of the second type, which caused all the channels assigned to them to be busy, are lost. Customers in orbit show impatience: each of them can leave orbit forever if the time of its stay in orbit exceeds some random time distributed according to an exponential law. Service times of customers of different types are distributed according to the phase law with different parameters. The operation of the system is described in terms of a multi-dimensional Markov chain. It is proved that for any values of the system parameters this chain has a stationary distribution. Algorithms for calculating the stationary distribution and a number of performance measures of the system are proposed. The results of the study can be used to simulate the operation of a fixed capacity cell in a wireless cellular communication network and other real systems operating in the processor sharing mode.</p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>система массового обслуживания</kwd><kwd>неоднородный входной поток</kwd><kwd>повторные вызовы</kwd><kwd>ограниченное разделение процессора</kwd><kwd>стационарное распределение</kwd><kwd>характеристики производительности</kwd></kwd-group><kwd-group xml:lang="en"><kwd>queueing system</kwd><kwd>heterogeneous input</kwd><kwd>repeated calls</kwd><kwd>limited processor sharing</kwd><kwd>stationary distribution</kwd><kwd>performance measures</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">Ghosh A., Banik A. D. An algorithmic analysis of the / /1 generalized processor-sharing queue. Computers and Operations Research, 2017, vol. 79, pp. 1–11.</mixed-citation><mixed-citation xml:lang="en">Ghosh A., Banik A. D. An algorithmic analysis of the / /1 generalized processor-sharing queue. Computers and Operations Research, 2017, vol. 79, pp. 1–11.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Telek M., van Houdt B. Response time distribution of a class of limited processor sharing queues. Performance Evaluation Review, 2018, vol. 45, no. 3, pp. 143–155. https://doi.org/10.1145/3199524.3199548</mixed-citation><mixed-citation xml:lang="en">Telek M., van Houdt B. Response time distribution of a class of limited processor sharing queues. Performance Evaluation Review, 2018, vol. 45, no. 3, pp. 143–155. https://doi.org/10.1145/3199524.3199548</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Yashkov S., Yashkova A. Processor sharing: a survey of the mathematical theory. Automation and Remote Control, 2007, vol. 68, pp. 662–731.</mixed-citation><mixed-citation xml:lang="en">Yashkov S., Yashkova A. Processor sharing: a survey of the mathematical theory. Automation and Remote Control, 2007, vol. 68, pp. 662–731.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Zhen Q., Knessl C. On sojourn times in the finite capacity / /1 queue with processor sharing. Operations Research Letters, 2009, vol. 37, pp. 447–450.</mixed-citation><mixed-citation xml:lang="en">Zhen Q., Knessl C. On sojourn times in the finite capacity / /1 queue with processor sharing. Operations Research Letters, 2009, vol. 37, pp. 447–450.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Masuyama H., Takine T. Sojourn time distribution in a / /1 processor-sharing queue. Operations Research Letters, 2003, vol. 31, pp. 406–412.</mixed-citation><mixed-citation xml:lang="en">Masuyama H., Takine T. Sojourn time distribution in a / /1 processor-sharing queue. Operations Research Letters, 2003, vol. 31, pp. 406–412.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Dudin S., Dudin A., Dudina O., Samouylov K. Analysis of a retrial queue with limited processor sharing operating in the random environment. Lecture Notes in Computer Science, 2017, vol. 10372, pp. 38–49.</mixed-citation><mixed-citation xml:lang="en">Dudin S., Dudin A., Dudina O., Samouylov K. Analysis of a retrial queue with limited processor sharing operating in the random environment. Lecture Notes in Computer Science, 2017, vol. 10372, pp. 38–49.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Dudin A., Dudin S., Dudina O., Samouylov K. Analysis of queuing model with limited processor sharing discipline and customers impatience. Operations Research Perspectives, 2018, vol. 5, pp. 245–255.</mixed-citation><mixed-citation xml:lang="en">Dudin A., Dudin S., Dudina O., Samouylov K. Analysis of queuing model with limited processor sharing discipline and customers impatience. Operations Research Perspectives, 2018, vol. 5, pp. 245–255.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Klimenok V., Dudin A. A retrial queueing system with processor sharing. Communications in Computer and Information Science, 2021, vol. 1391, pp. 46–60.</mixed-citation><mixed-citation xml:lang="en">Klimenok V., Dudin A. A retrial queueing system with processor sharing. Communications in Computer and Information Science, 2021, vol. 1391, pp. 46–60.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">He Q. M. Queues with marked customers. Advances in Applied Probability, 1996, vol. 28, pp. 567–587.</mixed-citation><mixed-citation xml:lang="en">He Q. M. Queues with marked customers. Advances in Applied Probability, 1996, vol. 28, pp. 567–587.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Dudin A. N., Klimenok V. I., Vishnevsky V. M. The Theory of Queuing Systems with Correlated Flows. Springer, 2020, 410 p.</mixed-citation><mixed-citation xml:lang="en">Dudin A. N., Klimenok V. I., Vishnevsky V. M. The Theory of Queuing Systems with Correlated Flows. Springer, 2020, 410 p.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Neuts M. F. Matrix-Geometric Solutions in Stochastic Models. Baltimore, the Johns Hopkins University Press, 1981, 352 p.</mixed-citation><mixed-citation xml:lang="en">Neuts M. F. Matrix-Geometric Solutions in Stochastic Models. Baltimore, the Johns Hopkins University Press, 1981, 352 p.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Graham A. Kronecker Products and Matrix Calculus with Applications. Cichester, Ellis Horwood, 1981, 130 p.</mixed-citation><mixed-citation xml:lang="en">Graham A. Kronecker Products and Matrix Calculus with Applications. Cichester, Ellis Horwood, 1981, 130 p.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Ramaswami V. Independent Markov processes in parallel. Communications in Statistics. Stochastic Models, 1985, vol. 1, pp. 419–432.</mixed-citation><mixed-citation xml:lang="en">Ramaswami V. Independent Markov processes in parallel. Communications in Statistics. Stochastic Models, 1985, vol. 1, pp. 419–432.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Ramaswami V., Lucantoni D. M. Algorithms for the multi-server queue with phase-type service. Communications in Statistics. Stochastic Models, 1985, vol. 1, pp. 393–417.</mixed-citation><mixed-citation xml:lang="en">Ramaswami V., Lucantoni D. M. Algorithms for the multi-server queue with phase-type service. Communications in Statistics. Stochastic Models, 1985, vol. 1, pp. 393–417.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Dudina O., Kim C. S., Dudin S. Retrial queueing system with Markovian arrival flow and phase type service time distribution. Computers and Industrial Engineering, 2013, vol. 66, pp. 360–373.</mixed-citation><mixed-citation xml:lang="en">Dudina O., Kim C. S., Dudin S. Retrial queueing system with Markovian arrival flow and phase type service time distribution. Computers and Industrial Engineering, 2013, vol. 66, pp. 360–373.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Klimenok, V. I., Dudin A. N. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems, 2006, vol. 54, pp. 245–259.</mixed-citation><mixed-citation xml:lang="en">Klimenok, V. I., Dudin A. N. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems, 2006, vol. 54, pp. 245–259.</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>
