<?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">26870</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2021-29-2-158-172</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">To analysis of a two-buffer queuing system with cross-type service and additional penalties</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-0002-1594-427X</contrib-id><name-alternatives><name xml:lang="en"><surname>Kochetkova</surname><given-names>Irina A.</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 Applied Probabil- ity and Informatics of Peoples’ Friendship University of Russia (RUDN University); Senior Researcher of Institute of Informatics Problems of Federal Research Center “Computer Science and Control” Russian Academy of Sciences</p></bio><email>gudkova-ia@rudn.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-6453-814X</contrib-id><name-alternatives><name xml:lang="en"><surname>Vlaskina</surname><given-names>Anastasia S.</given-names></name><name xml:lang="ru"><surname>Власкина</surname><given-names>А. С.</given-names></name></name-alternatives><bio xml:lang="en"><p>PHD student of Department of Applied Probability and Informatics</p></bio><email>vlaskina.anastasia@yandex.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-0902-6640</contrib-id><name-alternatives><name xml:lang="en"><surname>Efrosinin</surname><given-names>Dmitriy V.</given-names></name><name xml:lang="ru"><surname>Ефросинин</surname><given-names>Д. В.</given-names></name></name-alternatives><bio xml:lang="en"><p>Doctor of Science in physics and mathematics, associate professor of Johannes Kepler Universitaet Linz; associate professor of Peoples’ Friendship University of Russia (RUDN University)</p></bio><email>dmitry.efrosinin@jku.at</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff3"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-2362-3270</contrib-id><name-alternatives><name xml:lang="en"><surname>Khakimov</surname><given-names>Abdukodir A.</given-names></name><name xml:lang="ru"><surname>Хакимов</surname><given-names>А. А.</given-names></name></name-alternatives><bio xml:lang="en"><p>Junior researcher of Department of Applied Probability and Informatics</p></bio><email>khakimov-aa@rudn.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-4305-7050</contrib-id><name-alternatives><name xml:lang="en"><surname>Burtseva</surname><given-names>Sofiya A.</given-names></name><name xml:lang="ru"><surname>Бурцева</surname><given-names>С. А.</given-names></name></name-alternatives><bio xml:lang="en"><p>Master student of Department of Applied Probability and Informatics</p></bio><email>sofiya_burceva@inbox.ru</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><aff-alternatives id="aff2"><aff><institution xml:lang="en">Institute of Informatics Problems, FRC CSC RAS</institution></aff><aff><institution xml:lang="ru">Федеральный исследовательский центр «Информатика и управление» РАН</institution></aff></aff-alternatives><aff-alternatives id="aff3"><aff><institution xml:lang="en">Johannes Kepler Universität Linz</institution></aff><aff><institution xml:lang="ru">Линцский университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2021-06-28" publication-format="electronic"><day>28</day><month>06</month><year>2021</year></pub-date><volume>29</volume><issue>2</issue><issue-title xml:lang="en">VOL 29, NO2 (2021)</issue-title><issue-title xml:lang="ru">ТОМ 29, №2 (2021)</issue-title><fpage>158</fpage><lpage>172</lpage><history><date date-type="received" iso-8601-date="2021-06-28"><day>28</day><month>06</month><year>2021</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2021, Kochetkova I.A., Vlaskina A.S., Efrosinin D.V., Khakimov A.A., Burtseva S.A.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2021, Кочеткова И.А., Власкина А.С., Ефросинин Д.В., Хакимов А.А., Бурцева С.А.</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="en">Kochetkova I.A., Vlaskina A.S., Efrosinin D.V., Khakimov A.A., Burtseva S.A.</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/26870">https://journals.rudn.ru/miph/article/view/26870</self-uri><abstract xml:lang="en"><p style="text-align: justify;">The concept of cloud computing was created to better preserve user privacy and data storage security. However, the resources allocated for processing this data must be optimally allocated. The problem of optimal resource management in the loud computing environment is described in many scientific publications. To solve the problems of optimality of the distribution of resources of systems, you can use the construction and analysis of QS. We conduct an analysis of two-buffer queuing system with cross-type service and additional penalties, based on the literature reviewed in the article. This allows us to assess how suitable the model presented in the article is for application to cloud computing. For a given system different options for selecting applications from queues are possible, queue numbers, therefore, the intensities of transitions between the states of the system will change. For this, the system has a choice policy that allows the system to decide how to behave depending on its state. There are four components of such selection management models, which is a stationary policy for selecting a queue number to service a ticket on a vacated virtual machine each time immediately before service ends. A simulation model was built for numerical analysis. The results obtained indicate that requests are practically not delayed in the queue of the presented QS, and therefore the policy for a given model can be considered optimal. Although Poisson flow is the simplest for simulation, it is quite acceptable for performance evaluation. In the future, it is planned to conduct several more experiments for different values of the intensity of requests and various types of incoming flows.</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>cloud computing</kwd><kwd>Poisson flow</kwd><kwd>parallel queues</kwd><kwd>optimal policy</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><mixed-citation>M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, and M. Zaharia, “A view of cloud computing,” Communications of the ACM, vol. 4, no. 53, pp. 50-58, 2010. DOI: 10.1145/1721654.1721672.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>N. Taleb and E. A. Mohamed, “Cloud computing trends: a literature review,” Academic Journal of Interdisciplinary Studies, vol. 1, no. 9, pp. 91-104, 2020. DOI: 10.36941/ajis-2020-0008.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>I. Baldini, P. Castro, K. Chang, P. Cheng, S. Fink, V. Ishakian, and P. Suter, “Serverless computing: current trends and open problems,” Research Advances in Cloud Computing, pp. 1-20, 2017. DOI: 10.1007/978-981-10-5026-8_1.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>V. Sontakke and R. B. Dayanand, “Optimization of Hadoop MapReduce Model in cloud Computing Environment,” Proceedings of the 2nd International Conference on Smart Systems and Inventive Technology, ICSSIT 8987823, 2019, pp. 510-515. DOI: 10.1109/ICSSIT46314.2019.8987823.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>A. Yashwanth Reddy and R. P. Singh, “Design and development of multi tenancy in cloud: security issues,” International Journal of Scientific and Technology Research, vol. 3, no. 9, pp. 694-697, 2020.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>B. Kalyani and K. Rao, “Assessment of physical server reliability in multi cloud computing system,” AIP Conference Proceedings 1952,020045, 2018. DOI: 10.1063/1.5032007.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Y. Li, Y. Xu, and J. Chen, “Research on spam pages identification in search service based on cloud computing,” Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), vol. 1, no. 40, pp. 249-253, 2012.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>A. Madankan, A. Delavarkhalafi, S. M. Karbassi, and F. Adibnia, “Resource allocation in cloud computing via optimal control to queuing system,” Bulletin of the South Ural State University, Series: Mathematical Modelling, Programming and Computer Software, vol. 4, no. 12, pp. 67-81, 2019. DOI: 10.14529/mmp190405.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>C. N. Khac, K. B. Thanh, H. H. Dac, S. N. Hong, V. P. Tran, and H. T. Cong, “An Open Jackson Network Model for Heterogeneous Infrastructure as a Service on Cloud Computing,” International Journal of Computer Networks and Communications, vol. 1, no. 11, pp. 63-80, 2019. DOI: 10.5121/ijcnc.2019.11104.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Z. Cheng, H. Li, Q. Huang, Y. Cheng, and G. Chen, “Research on elastic resource management for multi-queue under cloud computing environment,” Journal of Physics: Conference Series, vol. 9, no. 898, 2017. DOI: 10.1088/1742-6596/898/9/092003.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>L. Jing, C. Yidong, and M. Yan, “Modeling Message Queueing Services with Reliability Guarantee in Cloud Computing Environment Using Colored Petri Net,” Mathematical Problems in Engineering, 2015. DOI: 10.1155/2015/383846.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>S. Kannan and S. Ramakrishnan, “Performance Analysis of Cloud Computing in Healthcare System Using Tandem Queues,” International Journal of Intelligent Engineering and Systems, vol. 4, no. 10, pp. 256-264, 2017. DOI: 10.22266/ijies2017.0831.27.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>D. Efrosinin, I. Gudkova, and N. Stepanova, “Algorithmic analysis of a two-class multi-server heterogeneous queuing system with a controllable cross-connectivity,” Lecture Notes in Computer Science, vol. 12023, 2020. DOI: 10.1007/978-3-030-62885-7_1.</mixed-citation></ref></ref-list></back></article>
