<?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">18370</article-id><article-id pub-id-type="doi">10.22363/2312-9735-2018-26-2-167-175</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Modeling and Simulation</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">Analysis of Queueing Systems with an Infinite Number of Servers and a Small Parameter</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>Vasilyev</surname><given-names>S A</given-names></name><name xml:lang="ru"><surname>Васильев</surname><given-names>Сергей Анатольевич</given-names></name></name-alternatives><bio xml:lang="en">Candidate of Physical and Mathematical Sciences, assistant professor of Department of Applied Probability and Informatics of Peoples’ Friendship University of Russia (RUDN University)</bio><bio xml:lang="ru"><p>кандидат физико-математических наук, доцент кафедры прикладной информатики и теории вероятностей РУДН</p></bio><email>vasilyev_sa@rudn.university</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Tsareva</surname><given-names>G O</given-names></name><name xml:lang="ru"><surname>Царева</surname><given-names>Галина Олеговна</given-names></name></name-alternatives><bio xml:lang="en">PhD student of Department of Applied Probability and Informatics of Peoples’ Friendship University of Russia (RUDN University)</bio><bio xml:lang="ru"><p>аспирант кафедры прикладной информатики и теории вероятностей РУДН</p></bio><email>gotsareva@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples’ Friendship University of Russia (RUDN University)</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2018-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2018</year></pub-date><volume>26</volume><issue>2</issue><issue-title xml:lang="en">VOL 26, NO2 (2018)</issue-title><issue-title xml:lang="ru">ТОМ 26, №2 (2018)</issue-title><fpage>167</fpage><lpage>175</lpage><history><date date-type="received" iso-8601-date="2018-04-21"><day>21</day><month>04</month><year>2018</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2018, Vasilyev S.A., Tsareva G.O.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2018, Васильев С.А., Царева Г.О.</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="en">Vasilyev S.A., Tsareva G.O.</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/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/18370">https://journals.rudn.ru/miph/article/view/18370</self-uri><abstract xml:lang="en">In this paper we consider the dynamics of large-scale queueing systems with an infinite number of servers. We assume that there is a Poisson input flow of requests with intensity . We suppose that each incoming request selects two any servers randomly and at the next step of an algorithm is sending this request to the server with the shorter queue instantly. A share () of the servers that have the queues lengths with not less than  can be described using a system of ordinary differential equations of infinite order. We investigate this system of ordinary differential equations of infinite order with a small real parameter. A small real parameter allows us to describe the processes of rapid changes in large-scale queueing systems. We use the simulation methods for this large-scale queueing systems analysis. The numerical simulation show that the solution of the singularly perturbed systems of differential equations have an area of rapid change of the solutions, which is usually located in the initial point of the problem. This area of rapid function change is called the area of the mathematical boundary layer. The thickness of the boundary layer depends on the value of a small parameter, and when the small parameter decreases, the thickness of the boundary layer decreases. The paper presents the numerical examples of the existence of steady state conditions for evolutions () and quasi-periodic conditions with boundary layers for evolutions ().</abstract><trans-abstract xml:lang="ru"><p>В данной работе рассматривается динамика крупномасштабных систем массового обслуживания с бесконечным числом обслуживающих приборов. Предполагается, что имеется входящий пуассоновский поток заявок с интенсивностью . Также предполагается, что каждая заявка, попав в систему, выбирает два произвольных прибора случайным образом и выбирает для обслуживания прибор с более короткой очередью. Доля () приборов с длиной очереди не менее чем можно описать с помощью системы обыкновенных дифференциальных уравнений бесконечного порядка. Предполагается, что эта система обыкновенных дифференциальных уравнений бесконечного порядка с малым вещественным параметром, который позволяет описать процессы быстрых изменений в системах массового обслуживания. В этой работе используются методы численного моделирования для анализа такого класса систем массового обслуживания. Численный анализ показал, что решение рассматриваемых сингулярно-возмущенных систем дифференциальных уравнения имеют область быстрого изменения решений, которая находится в начальной области интегрирования задачи. Эта зона быстрого изменения решений называется областью пограничного слоя. Толщина пограничного слоя зависит от величины малого параметра, и когда малый параметр уменьшается, то толщина пограничного слоя также уменьшается. В работе приведены численные примеры существования стационарных состояний для эволюции решений (), а также решения с пограничными слоями.</p></trans-abstract><kwd-group xml:lang="en"><kwd>countable Markov chains</kwd><kwd>large-scale queueing systems</kwd><kwd>singular perturbed systems of differential equations</kwd><kwd>differential equations of infinite order</kwd><kwd>small parameter</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>счётные марковские цепи</kwd><kwd>крупномасштабные системы массового обслуживания</kwd><kwd>сингулярные возмущённые системы дифференциальных уравнений</kwd><kwd>дифференциальные уравнения бесконечного порядка</kwd><kwd>малый параметр</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">N. D. Vvedenskaya, R. L. Dobrushin, F. I. Karpelevich, Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach, Probl. Peredachi Inf. 32 (1) (1996) 20-34, in Russian.</mixed-citation><mixed-citation xml:lang="ru">Введенская Н. Д., Добрушин Р. Л., Карпелевич Ф. И. Система обслуживания с выбором наименьшей из двух очередей – асимптотический подход // Проблемы передачи информации. — 1996. — Т. 32, № 1. — С. 20–34.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">N. D. Vvedenskaya, Yu. M. Suhov, Dobrushin’s Mean-Field Approximation for a Queue with Dynamic Routing, no. 3, 1997.</mixed-citation><mixed-citation xml:lang="ru">Vvedenskaya N. D., Suhov Yu. M. Dobrushin’s Mean-Field Approximation for a Queue with Dynamic Routing. 3. — 1997. — Pp. 493–526.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">N. D. Vvedenskaya, Large Queueing System where Messages are Transmitted via Several Routes, Vol. 34, 1998, in Russian.</mixed-citation><mixed-citation xml:lang="ru">Введенская Н. Д. Большая система обслуживания с передачей сообщения по нескольким путям. — 1998. — Т. 34, С. 98–108.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">L. G. Afanassieva, G. Fayolle, S. Yu. Popov, Models for Transportation Networks, Journal of Mathematical Sciences 84 (3) (1997) 1092-1103.</mixed-citation><mixed-citation xml:lang="ru">Afanassieva L. G., Fayolle G., Popov S. Yu. Models for Transportation Networks // Journal of Mathematical Sciences. — 1997. — Vol. 84, No 3. — Pp. 1092–1103.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">D. V. Khmelev, V. I. Oseledets, Mean-Field Approximation for Stochastic Transportation Network and Stability of Dynamical System (Preprint No. 434), University of Bremen, Bremen, 1999.</mixed-citation><mixed-citation xml:lang="ru">Khmelev D. V., Oseledets V. I. Mean-Field Approximation for Stochastic Transportation Network and Stability of Dynamical System (Preprint No. 434). — Bremen: University of Bremen, 1999.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">D. V. Khmelev, Limit Theorems for Nonsymmetric Transportation Networks, Vol. 7, 2001.</mixed-citation><mixed-citation xml:lang="ru">Khmelev D. V. Limit Theorems for Nonsymmetric Transportation Networks. — 2001. — Vol. 7, Pp. 1259–1266.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">V. V. Scherbakov, Time Scales Hierarchy in Large Closed Jackson Networks (Preprint No. 4), French-Russian A. M. Liapunov Institute of Moscow State University, Moscow, 1997.</mixed-citation><mixed-citation xml:lang="ru">Scherbakov V. V. Time Scales Hierarchy in Large Closed Jackson Networks (Preprint No. 4). — Moscow: French–Russian A. M. Liapunov Institute of Moscow State University, 1997.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">V. I. Oseledets, D. V. Khmelev, Global Stability of Infinite Systems of Nonlinear Differential Equations, and Nonhomogeneous Countable Markov Chains, Vol. 36, 2000.</mixed-citation><mixed-citation xml:lang="ru">Oseledets V. I., Khmelev D. V. Global Stability of Infinite Systems of Nonlinear Differential Equations, and Nonhomogeneous Countable Markov Chains. — 2000. — Vol. 36, Pp. 60–76.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">E. A. Chernavskaya, Limit Theorems for an Infinite-Server Queuing System, Vol. 99, 2015.</mixed-citation><mixed-citation xml:lang="ru">Chernavskaya E. A. Limit Theorems for an Infinite-Server Queuing System. — 2015. — Vol. 99.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">E. A. Chernavskaya, Limit Theorems for Queueing Systems with Infinite Number of Servers and Group Arrival of Requests, Vol. 71, 2016.</mixed-citation><mixed-citation xml:lang="ru">Chernavskaya E. A. Limit Theorems for Queueing Systems with Infinite Number of Servers and Group Arrival of Requests. — 2016. — Vol. 71, Pp. 257–260.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">Yu. Gaidamaka, E. Sopin, M. Talanova, Approach to the Analysis of Probability Measures of Cloud Computing Systems with Dynamic Scaling, Vol. 601, 2016.</mixed-citation><mixed-citation xml:lang="ru">Gaidamaka Yu., Sopin E., Talanova M. Approach to the Analysis of Probability Measures of Cloud Computing Systems with Dynamic Scaling. — 2016. — Vol. 601, Pp. 121—131.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">A. V. Korolkova, E. G. Eferina, E. B. Laneev, I. A. Gudkova, L. A. Sevastianov, D. S. Kulyabov, Stochastization of One-Step Processes in the Occupations Number Representation, 2016.</mixed-citation><mixed-citation xml:lang="ru">Stochastization of One-Step Processes in the Occupations Number Representation / V. Korolkova, E. G. Eferina, E. B. Laneev et al. — 2016. — Pp. 698–704.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">K. Samouylov, V. Naumov, E. Sopin, I. Gudkova, S. Shorgin, Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server, Vol. 9845, Springer Verlag, 2016.</mixed-citation><mixed-citation xml:lang="ru">Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server / K. Samouylov, V. Naumov, E. Sopin et al. — Springer Verlag, 2016. — Vol. 9845, Pp. 284—297.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">G. O. Bolotova, S. A. Vasilyev, D. N. Udin, Systems of Differential Equations of Infinite Order with Small Parameter and Countable Markov Chains, Vol. 678, Springer Verlag, 2016.</mixed-citation><mixed-citation xml:lang="ru">Bolotova G. O., Vasilyev S. A., Udin D. N. Systems of Differential Equations of Infinite Order with Small Parameter and Countable Markov Chains. — Springer Verlag, 2016. — Vol. 678, Pp. 565–576.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
