<?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">37514</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2023-31-4-332-344</article-id><article-id pub-id-type="edn">ECPYRN</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 algorithmization of construction of the transition intensity matrix in systems with a large number of same elements</article-title><trans-title-group xml:lang="ru"><trans-title>Об алгоритмизации построения матрицы интенсивностей переходов в системах с большим числом однотипных элементов</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-8247-8988</contrib-id><name-alternatives><name xml:lang="en"><surname>Matyushenko</surname><given-names>Sergey I.</given-names></name><name xml:lang="ru"><surname>Матюшенко</surname><given-names>С. И.</given-names></name></name-alternatives><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences, Assistant professor of Department of Probability Theory and Cyber Security</p></bio><email>matyushenko-si@rudn.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-7909-6396</contrib-id><name-alternatives><name xml:lang="en"><surname>Zaryadov</surname><given-names>Ivan S.</given-names></name><name xml:lang="ru"><surname>Зарядов</surname><given-names>И. С.</given-names></name></name-alternatives><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences, Assistant professor of Department of Probability Theory and Cyber Security</p></bio><email>zaryadov_is@rudn.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">RUDN University</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2023-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2023</year></pub-date><volume>31</volume><issue>4</issue><issue-title xml:lang="en">VOL 31, NO4 (2023)</issue-title><issue-title xml:lang="ru">ТОМ 31, №4 (2023)</issue-title><fpage>332</fpage><lpage>344</lpage><history><date date-type="received" iso-8601-date="2024-01-19"><day>19</day><month>01</month><year>2024</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2023, Matyushenko S.I., Zaryadov I.S.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2023, Матюшенко С.И., Зарядов И.С.</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="en">Matyushenko S.I., 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/37514">https://journals.rudn.ru/miph/article/view/37514</self-uri><abstract xml:lang="en"><p style="text-align: justify;">In this article, using the example of a multi-channel exponential queueing system with reordering of requests, we study the problem of computer construction of the state space and coefficient matrix of a system of equilibrium equations. As a result, general principles for solving problems of this type are formulated.</p></abstract><trans-abstract xml:lang="ru"><p style="text-align: justify;">В данной статье на примере многоканальной экспоненциальной системы массового обслуживания с переупорядочиванием заявок изучается задача компьютерного построения пространства состояний и матрицы коэффициентов системы уравнений равновесия. В результате сформулированы общие принципы решения задач такого типа.</p></trans-abstract><kwd-group xml:lang="en"><kwd>queuing system</kwd><kwd>dynamic construction of transition intensity matrix</kwd><kwd>systems with reordering of requests</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>система массового обслуживания</kwd><kwd>динамическое построение матрицы интенсивностей переходов</kwd><kwd>система с переупорядочиванием заявок</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>V. L. Chugreev, “Development of a multicative model of sequentially connected information elements,” Young Scientist, no. 3, pp. 147-149, 2013.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>G. P. Basharin, S. N. Klapouschak, and N. V. Mitkina, “Mathematical model of adaptive high-speed system with elastic traffic,” Bulletin of the RUDN. Mathematics series. Computer science. Physics, no. 3, pp. 31-39, 2008, in Russian.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>A. Rumyantsev and E. Morozov, “Stability criterion of a multiserver model with simultaneous service,” Operation Reseach, no. 5, pp. 31-39, 2017. DOI: 10.1007/s10479-015-1917-2.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>S. A. Grishunina, “Multiserver queueing system with constant service time and simultaneous service of a customer by random number of servers,” Theory of Probability and its Applications, vol. 64, no. 3, pp. 456-460, 2019. DOI: 10.1137/50040585X97T98960X.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>B. Sun, M. H. Lee, S. A. Dudin, and A. N. Dudin, “Analysis of multiserver queueing system with opportunistic occupation and reservation of servers,” Mathematical Problems in Engineering, no. 5, pp. 1-13, 2014. DOI: 10.1155/2014/178108.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>U. Ayestab, P. Jackod, and V. Novak, “Scheduling of multi-class multiserver queueing systems with abandonments,” Journal of Scheduling, vol. 20, pp. 129-145, 2015. DOI: 10.1007/s10951-015-0456-7.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>M. Harchol-Balter, T. Osogami, A. Scheller-wolf, and A. Wierman, “Multi-server queueing systems with multiple priority classes,” Queueing Systems, vol. 51, pp. 331-360, Dec. 2005. DOI: 10.1007/s11134-005-2898-7.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>S. Matyushenko and A. Ermolaeva, “On stationary characteristics of a multi server exponential queueing system with reordering of requests,” in 13th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), ICUMT 2021, Brno, Czech Republic, 2021, pp. 98-103.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>S. I. Matyushenko and A. V. Pechinkin, “Service system with reordering of applications,” in International Conference Distributed Computer and Communication Networks (ECN 2011), ECN 2011, Moscow, Russia, 2011.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>P. P. Bocharov and A. V. Pechenkin, Queuing theory [Teoriya massovogo obsluzhivaniya]. Moscow: RUDN, 1995, 529 pp., in Russian.</mixed-citation></ref></ref-list></back></article>
