<?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">51117</article-id><article-id pub-id-type="edn">JWJLMV</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Mathematics</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">Queueing Systems with Renovation.   Stationary Probability Distribution</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>Bocharov</surname><given-names>P. P.</given-names></name><name xml:lang="ru"><surname>Бочаров</surname><given-names>П. П.</given-names></name></name-alternatives><email>-</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Zaryadov</surname><given-names>I. S.</given-names></name><name xml:lang="ru"><surname>Зарядов</surname><given-names>И. С.</given-names></name></name-alternatives><email>-</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples' Friendship University of Russia</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2007-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2007</year></pub-date><issue>1-2</issue><issue-title xml:lang="en">NO12 (2007)</issue-title><issue-title xml:lang="ru">№12 (2007)</issue-title><fpage>14</fpage><lpage>23</lpage><history><date date-type="received" iso-8601-date="2026-07-08"><day>08</day><month>07</month><year>2026</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2007, Bocharov P.P., Zaryadov I.S.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2007, Бочаров П.П., Зарядов И.С.</copyright-statement><copyright-year>2007</copyright-year><copyright-holder xml:lang="en">Bocharov P.P., Zaryadov I.S.</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/51117">https://journals.rudn.ru/miph/article/view/51117</self-uri><abstract xml:lang="en">The Marcovian queueing systems with renovation are revised. The matrix algorithm for computing the stationary distribution of the Markov process is described. As examples of the method the algorithms for exponential systems are given --- queueing systems $M/M/n/r$ without reservice and $M/M/n/r$ with reservice.</abstract><trans-abstract xml:lang="ru">Рассматриваются марковские системы массового обслуживания с обновлением. Для этих систем на основе доказанной в работе для обобщенного процесса размножения и гибели теоремы получены алгоритмы нахождения стационарных вероятностей состояний. В качестве примеров приведены алгоритмы расчетов для экспоненциальных системы с обновлением "--- системы $M/M/n/r$ без дообслуживанием и системы $M/M/n/r$ с дообслуживанием.</trans-abstract><kwd-group xml:lang="ru"><kwd>марковский процесс</kwd><kwd>матричное решение</kwd><kwd>стационарное распределение</kwd><kwd>обновление</kwd><kwd>дообслуживание</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Kreinin A. Queueing Systems with Renovation // Journal of Applied Math. Stochast. Analysis. - Vol. 10, No 4. - 1997. - Pp. 431-443.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Kreinin A. Inhomogeneous Random Walks: Applications in Queueing and Finance // CanQueue / Fields Institute. - Toronto: 2003.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Towsley D., Tripathi S. K. A single server priority queue with server failure and queue flushing. - 1999.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Бочаров П. П., Печинкин А. В. Теория массового обслуживания. - М.: РУДН, 1995. - С. 529.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Naoumov V. A. Matrix-multiplicative approach to quasi- birth-and-death processes analysis // Proc. First Internat. Conf. on Matrix-Analytic Methods in Stochastic Models. - Detroit: 1995.</mixed-citation></ref></ref-list></back></article>
