<?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">Infokommunikacionnye tehnologii</journal-id><journal-title-group><journal-title xml:lang="en">Infokommunikacionnye tehnologii</journal-title><trans-title-group xml:lang="ru"><trans-title>Инфокоммуникационные технологии</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2073-3909</issn><publisher><publisher-name xml:lang="en">Povolzhskiy State University of Telecommunications and Informatics</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">635111</article-id><article-id pub-id-type="doi">10.18469/ikt.2023.21.4.03</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Communication networks and multi-services</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">Comparison of Hyperexponential And Group Poisson Traffic Models of Multiservice Communication Networks</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>Likhttsinder</surname><given-names>Boris Ya.</given-names></name><name xml:lang="ru"><surname>Лихтциндер</surname><given-names>Борис Яковлевич</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Doctor of Technical Science, Professor of Networks and Communication Systems Department</p></bio><bio xml:lang="ru"><p>д.т.н., профессор, профессор кафедры сетей и систем связи </p></bio><email>lixt@psuti.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Privalov</surname><given-names>Alexander Yu.</given-names></name><name xml:lang="ru"><surname>Привалов</surname><given-names>Александр Юрьевич</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Professor of the Chair of Applied Mathematics and Physics, Doctor of Technical Science</p></bio><bio xml:lang="ru"><p>д.т.н., профессор, профессор кафедры прикладной математики и физики </p></bio><email>privalov1967@gmail.com</email><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Povolzhskiy State University of Telecommunications and Informatics</institution></aff><aff><institution xml:lang="ru">Поволжский государственный университет телекоммуникаций и информатики</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Samara National Research University</institution></aff><aff><institution xml:lang="ru">Самарский национальный исследовательский университет имени С.П. Королева</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2024-09-11" publication-format="electronic"><day>11</day><month>09</month><year>2024</year></pub-date><volume>21</volume><issue>4</issue><issue-title xml:lang="en"/><issue-title xml:lang="ru"/><fpage>18</fpage><lpage>23</lpage><history><date date-type="received" iso-8601-date="2024-08-11"><day>11</day><month>08</month><year>2024</year></date><date date-type="accepted" iso-8601-date="2024-08-11"><day>11</day><month>08</month><year>2024</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2024, Likhttsinder B.Y., Privalov A.Y.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024, Лихтциндер Б.Я., Привалов А.Ю.</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">Likhttsinder B.Y., Privalov A.Y.</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-nd/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.eco-vector.com/2073-3909/article/view/635111">https://journals.eco-vector.com/2073-3909/article/view/635111</self-uri><abstract xml:lang="en"><p>The goal of the study was to compare hyperexponential and group Poisson flows of requests as models of burst traffic of multiservice communication networks. Various traffic models are considered for the problem of approximating the average queue created by video traffic of modern multiservice networks. Poisson and hyperexponential flows, both ordinary and group, are also considered. It is shown that group flows of both types are suitable for the task of approximating the video traffic queue. Group Poisson flows make it possible to obtain very simple analytical dependences of the average values of queues on the load factor of queuing systems and are therefore the most preferable. The inadequacy of using ordinary hyperexponential models for approximating burst flows of requests is also provided shown, since, at low values of the load factor, the dependences of the average values of queues for hyperexponential flows are practically close to zero, while the indicated dependences for burst flows have a very significant slope angle. The conclusions drawn are confirmed by the results of simulation modeling.</p></abstract><trans-abstract xml:lang="ru"><p>Целью работы было проведение сравнения гиперэкспоненциальных и групповых пуассоновских потоков заявок в качестве моделей пачечного трафика мультисервисных сетей связи. Рассматриваются различные модели трафика для задачи приближения средней очереди, создаваемой видеотрафиком современных мультисервисных сетей. Рассмотрены пуассоновский и гиперэкспоненциальный потоки, как ординарные, так и групповые. Показано, что для задачи приближения очереди видеотрафика подходят групповые потоки обоих типов. Групповые пуассоновские потоки позволяют получить весьма простые аналитические зависимости средних значений очередей от коэффициента загрузки систем массового обслуживания и поэтому являются наиболее предпочтительными. Показана неадекватность применения ординарных гиперэкспоненциальных моделей для аппроксимации пачечных потоков заявок, поскольку, при малых значениях коэффициента загрузки, зависимости средних значений очередей для гиперэкспоненциальных потоков практически близки к нулю, в то время, как указанные зависимости для пачечных потоков имеют весьма значительный угол наклона. Сделанные выводы подтверждаются результатами имитационного моделирования.</p></trans-abstract><kwd-group xml:lang="en"><kwd>video traffic</kwd><kwd>Poisson flow</kwd><kwd>hyper exponential flow</kwd><kwd>group flows</kwd></kwd-group><kwd-group xml:lang="ru"><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">Dyhnenko L.M. et al. Fundamentals of modeling complex systems: Textbook for University. Ed. by I.V. Kuzmin. Kiev: Vyshcha shkola, 1981. 359 p. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Основы моделирования сложных систем: учебное пособие для вузов / Л.М. Дыхненко [и др.]; под общей ред. И.В. Кузьмина. Киев: Выща школа, 1981. 359 с.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">Vishnevsky V.M., Dudin A.N. Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks. Avtomatika i telemekhanika, 2017, no. 8, pp. 3–59. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Вишневский В.М., Дудин А.Н. Системы массового обслуживания с коррелированными входными потоками и их применение для моделирования телекоммуникационных сетей // Автоматика и телемеханика. 2017. № 8. С. 3–59.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Neuts M.F. Versatile Markovian point process. Journal of Applied Probability, 1979, vol. 16, no. 4, pp. 764–779. DOI: https://doi.org/10.2307/3213143. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Neuts M.F. Versatile Markovian point process // Journal of Applied Probability. 1979. Vol. 16, no. 4. P. 764–779. DOI: https://doi.org/10.2307/ 3213143.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Dudin A.N., Klimenok V.I. Queuing systems with correlated flows. Minsk: BSU, 2000. 175 p. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Дудин А.Н., Клименок В.И. Системы массового обслуживания с коррелированными потоками. Минск: БГУ, 2000. 175 с.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Lichtzinder B.Ya. Traffic of multiservice access networks (interval analysis and design). Moscow: Goryachaya liniya-Telekom, 2018, 290 p. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Лихтциндер Б.Я. Трафик мультисервисных сетей доступа (интервальный анализ и проектирование). М.: Горячая линия-Телеком, 2018. 290 с.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">Likhttsinder B.Ya., Bakay Yu.O. Models of group Poisson flows in teltcommunicftions traffic control. Vestnik Samarskogo gosudarstvennogo tekhnicheskogo universiteta. Seriya: Tekhnicheskie nauki, 2020, vol. 28, no. 3, pp. 75–89.</mixed-citation><mixed-citation xml:lang="ru">Likhttsinder B.Ya., Bakay Yu.O. Models of group Poisson flows in teltcommunications traffic control // Вестник Самарского государственного технического университета. Серия: Технические науки. 2020. Т. 28, № 3. С. 75–89.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">Likhttsinde B.Ya., Kitaeva E.V., Privalov A.Yu. Queue analysis for video traffic using the generalized interval method. Information Technology and Nanotechnology (ITNT-2022): VIII International Conference. Samara, 2022, pp. 1–4. DOI: 10.1109/ITNT55410.2022.9848604</mixed-citation><mixed-citation xml:lang="ru">Likhttsinder B.Ya., Kitaeva E.V., Privalov A.Yu. Queue analysis for video traffic using the generalized interval method // Information Technology and Nanotechnology (ITNT-2022): VIII International Conference. Samara, 2022. Р. 1–4. DOI: 10.1109/ITNT55410.2022.9848604</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">Ramaswami V. The N/G/1 queue and its detailed analysis. Advances in Applied Probability, 1980, vol. 12, no. 1, pp. 222–261. DOI: https://doi.org/10.2307/1426503</mixed-citation><mixed-citation xml:lang="ru">Ramaswami V. The N/G/1 queue and its detailed analysis // Advances in Applied Probability. 1980. Vol. 12, no. 1. P. 222–261. DOI: https://doi.org/ 10.2307/1426503</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Lakatos L., Szeidl L., Telek M. Introduction to Queueing Systems with Telecommunication Applications. Springer, 2013, 388 p. DOI: https://doi.org/10.1007/978-1-4614-5317-8</mixed-citation><mixed-citation xml:lang="ru">Lakatos L., Szeidl L., Telek M. Introduction to Queueing Systems with Telecommunication Applications. Springer, 2013. 388 p. DOI: https://doi.org/10.1007/978-1-4614-5317-8</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">Singh G., Gupta U.C., Chaudhry M.L. Detailed computational analysis of queueingtime distributions of the BMAP/G/1 queue using roots. Journal of Applied Probability, 2016, vol. 53, pp. 1078–1097.</mixed-citation><mixed-citation xml:lang="ru">Singh G., Gupta U.C., Chaudhry M.L. Detailed computational analysis of queueing time distributions of the BMAP/G/1 queue using roots // Journal of Applied Probability. 2016. Vol. 53. P. 1078–1097.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">Dudin A.N., Piscopo R., Manzo R. Queue with group admission of customers. Computer and Operations Research, 2015, vol. 61, pp. 89–90.</mixed-citation><mixed-citation xml:lang="ru">Dudin A.N., Piscopo R., Manzo R. Queue with group admission of customers // Computer and Operations Research. 2015. Vol. 61. P. 89–90.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">Lichtzinder B.Ya., Moiseev V.I., Privalov A.Yu. Second moments of queues in queuing systems with group Poisson flows. Informacionnye tekhnologii i nanotekhnologii n (ITNT-2023): materialy IX Mezhdunarodnoj konferencii i molodezhnoj shkol. Samara, 2023, pp. 050192. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Лихтциндер Б.Я., Моисеев В.И., Привалов А.Ю. Вторые моменты очередей в системах массового обслуживания с групповыми пуассоновскими потоками // Информационные технологии и нанотехнологии (ИТНТ-2023): материалы IX Международной конференции и молодежной школы. Самара, 2023. P. 050192.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
