<?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 custom-type="elpub" pub-id-type="custom">inform-870</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>Stationary characteristics of unreliable queueing system with a batch 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>Klimenok</surname><given-names>V. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>доктор физикоматематических наук, профессор, главный научный сотрудник научно-исследовательской лаборатории прикладного вероятностного анализа</p></bio><bio xml:lang="en"><p>Dr. Sci. (Phys.-Math.), Professor, Chief Researcher of the Research Laboratory of Applied Probabilistic Analysis</p></bio><email xlink:type="simple">vklimenok@yandex.ru</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>2019</year></pub-date><pub-date pub-type="epub"><day>21</day><month>06</month><year>2019</year></pub-date><volume>16</volume><issue>3</issue><fpage>69</fpage><lpage>78</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Клименок В.И., 2019</copyright-statement><copyright-year>2019</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/870">https://inf.grid.by/jour/article/view/870</self-uri><abstract><p>Ненадежные системы массового обслуживания представляют значительный интерес как в математическом плане, так и для приложений. В основном рассматриваются системы со стационарными пуассоновскими потоками заявок и поломок и экспоненциально распределенными временами обслуживания и ремонтов. Это обстоятельство значительно упрощает математический анализ соответствующих моделей, но редко выполняется в реальных системах, особенно в телекоммуникационных сетях. Целью исследования является анализ стационарного поведения многолинейной ненадежной системы массового обслуживания с групповым марковским потоком заявок, который учитывает корреляцию и взрывной характер реального трафика. Процессы обслуживания и ремонтов описываются фазовыми распределениями, что позволяет учесть не только средние времена обслуживания и ремонтов, но и дисперсию этих времен. В результате процесс функционирования системы представляется многомерной цепью Маркова. Условие эргодичности этой цепи задается в простом алгоритмическом виде. Предлагается алгоритм вычисления стационарного распределения. Получены формулы для ключевых характеристик производительности системы в терминах стационарного распределения цепи Маркова, описывающей динамику системы. Приведенные результаты могут использоваться для принятия экспертных решений при анализе производительности и проектировании телекоммуникационных сетей различного назначения.</p></abstract><trans-abstract xml:lang="en"><p>Unreliable queuing systems are of considerable interest both in mathematical terms and for applications. Systems with stationary Poisson flows of customers and breakdowns and exponentially distributed service and repair times are mainly considered. This circumstance greatly simplifies the mathematical analysis of the corresponding models but rarely occurs in real systems, especially in telecommunications networks. The purpose of this study is to analyze the stationary behavior of a multi-server unreliable queueing system with a batch Markovian arrival process, which takes into account the correlation and bursty nature of real traffic. The service and repair processes are described by phase type distributions which makes it possible to take into account not only the average service and repair times but also the variance of these times. As a result of the research, the operation of the system is described by a multi-dimensional Markov chain. The condition of ergodicity of this chain is presented in a simple algorithmic form. An algorithm for calculating the stationary distribution is proposed. Formulas for the key performance characteristics of the system are obtained in terms of the stationary distribution of the Markov chain describing the system dynamics. The results can be used to make expert decisions in analyzing the performance and design of various telecommunication networks.</p><p> </p></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>queuing system</kwd><kwd>unreliable servers</kwd><kwd>batch Markovian arrival process</kwd><kwd>phase type distribution</kwd><kwd>stationary distribution</kwd><kwd>performance characteristics</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование выполнено в рамках совместного проекта Белорусского республиканского фонда фундаментальных исследований (грант № Ф18Р-136) и Российского фонда фундаментальных исследований (грант № 18-57-00002).</funding-statement><funding-statement xml:lang="en">This work has been financially supported by the joint grant of Belarusian Republican Foundation for Fundamental Research (no. F18R-136) and Russian Foundation for Fundamental Research (no. 18-57-00002).</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Reliability-based measures for a retrial system with mixed standby components / C. C. Kuoa [et al.] // Applied Mathematical Modelling. – 2014. – Vol. 38. – P. 4640–4651.</mixed-citation><mixed-citation xml:lang="en">Kuoa C. C., Sheub S. H., Ke J. C., Zhang Z. G. Reliability-based measures for a retrial system with mixed standby components. Applied Mathematical Modelling, 2014, vol. 38, pp. 4640–4651.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Modeling of multi-server repair problem with switching failure and reboot delay and related profit analysis / Y. L. Hsu [et al.] // Computers and Industrial Engineering. – 2014. – Vol. 69. – P. 21–28.</mixed-citation><mixed-citation xml:lang="en">Hsu Y. L., Ke J. C., Liu T. H., Wu C. H. Modeling of multi-server repair problem with switching failure and reboot delay and related profit analysis. Computers and Industrial Engineering, 2014, vol. 69, pp. 21–28.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Wu, C. H. Multi-server machine repair problems under a ( , synchronous single vacation policy / C. H. Wu, J. C. Ke // Applied Mathematical Modelling. – 2014. – Vol. 38. – P. 2180–2189.</mixed-citation><mixed-citation xml:lang="en">Wu C. H., Ke J. C. Multi-server machine repair problems under a ( , synchronous single vacation policy. Applied Mathematical Modelling, 2014, vol. 38, pp. 2180–2189.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Klimenok, V. I. A / / queue with negative customers and partial protection of service / V. I. Klimenok, A. N. Dudin // Communications in Statistics – Simulation and Computation. – 2012. – Vol. 41. – P. 1062–1082.</mixed-citation><mixed-citation xml:lang="en">Klimenok V. I., Dudin A. N. A / / queue with negative customers and partial protection of service. Communications in Statistics – Simulation and Computation, 2012, vol. 41, pp. 1062–1082.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Priority retrial queueing model operating in random environment with varying number and reservation of servers / A. Dudin [et al.] // Applied Mathematics and Computations. – 2015. – Vol. 269. – P. 674–690.</mixed-citation><mixed-citation xml:lang="en">Dudin A., Kim C. S., Dudin S., Dudina O. Priority retrial queueing model operating in random environment with varying number and reservation of servers. Applied Mathematics and Computations, 2015, vol. 269, pp. 674–690.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Lucantoni, D. New results on the single server queue with a batch Markovian arrival process / D. Lucantoni // Communications in Statistics. Stochastic Models. – 1991. – Vol. 7. – P. 1–46.</mixed-citation><mixed-citation xml:lang="en">Lucantoni D. New results on the single server queue with a batch Markovian arrival process. Communications in Statistics. Stochastic Models, 1991, vol. 7, pp. 1–46.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Neuts, M. F. Matrix-Geometric Solutions in Stochastic Models / M. F. Neuts. – Baltimore : The Johns Hopkins University Press, 1981. – 352 р.</mixed-citation><mixed-citation xml:lang="en">Neuts M. F. Matrix-Geometric Solutions in Stochastic Models. Baltimore, The Johns Hopkins University Press, 1981, 352 р.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Graham, A. Kronecker Products and Matrix Calculus with Applications / A. Graham. – Cichester : Ellis Horwood, 1981. – 130 р.</mixed-citation><mixed-citation xml:lang="en">Graham A. Kronecker Products and Matrix Calculus with Applications. Cichester, Ellis Horwood, 1981, 130 р.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Klimenok, V. I. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory / V. I. Klimenok, A. N. Dudin // Queueing Systems. – 2006. – Vol. 54. – P. 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>
