<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">tuzsut</journal-id><journal-title-group><journal-title xml:lang="ru">Труды учебных заведений связи</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of Telecommunication Universities</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1813-324X</issn><issn pub-type="epub">2712-8830</issn><publisher><publisher-name>СПбГУТ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.31854/1813-324X-2021-7-4-10-17</article-id><article-id custom-type="elpub" pub-id-type="custom">tuzsut-207</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ЭЛЕКТРОНИКА, ФОТОНИКА, ПРИБОРОСТРОЕНИЕ И СВЯЗЬ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>ELECTRONICS, PHOTONICS, INSTRUMENTATION AND COMMUNICATIONS</subject></subj-group></article-categories><title-group><article-title>Применение EM-алгоритма для аппроксимации гиперэкспонентами плотностей вероятностей коррелированного трафика</article-title><trans-title-group xml:lang="en"><trans-title>Application of EM-Algorithm for Approximation of Correlated Traffic Probabilities Density by Hyperexponents</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-2986-8252</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Буранова</surname><given-names>М. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Buranova</surname><given-names>M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>кандидат технических наук, доцент, доцент кафедры информационной безопасности Поволжского государственного университета телекоммуникаций и информатики</p><p>Самара, 443010, Российская Федерация</p></bio><bio xml:lang="en"><p>Samara, 443010, Russian Federation</p></bio><email xlink:type="simple">buranova-ma@psuti.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-1388-4867</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Карташевский</surname><given-names>И. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Kartashevskiy</surname><given-names>I</given-names></name></name-alternatives><bio xml:lang="ru"><p>доктор технических наук, профессор кафедры программного обеспечения и управления в технических системах Поволжского государственного университета телекоммуникаций и информатики</p><p>Самара, 443010, Российская Федерация</p></bio><bio xml:lang="en"><p>Samara, 443010, Russian Federation</p></bio><email xlink:type="simple">ivk@psuti.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Поволжский государственный университет телекоммуникаций и информатики<country>Россия</country></aff><aff xml:lang="en">Povolzhskiy State University of Telecommunications and Informatics<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2021</year></pub-date><pub-date pub-type="epub"><day>28</day><month>12</month><year>2021</year></pub-date><volume>7</volume><issue>4</issue><fpage>10</fpage><lpage>17</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Буранова М.А., Карташевский И.В., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Буранова М.А., Карташевский И.В.</copyright-holder><copyright-holder xml:lang="en">Buranova M., Kartashevskiy I.</copyright-holder><license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://tuzs.sut.ru/jour/article/view/207">https://tuzs.sut.ru/jour/article/view/207</self-uri><abstract><p>Точная оценка параметров качества обслуживания в современных инфокоммуникационных сетях является весьма важной задачей. В работе предложено использование гиперэкспоненциальных распределений для решения задачи аппроксимации произвольной плотности вероятностей в системе G/G/1 для случая, когда предполагается аппроксимация системой типа H2/H2/1. Для определения параметров плотности вероятностей гиперэкспоненциального распределения предлагается использовать EM-алгоритм, который дает достаточно простые варианты использования для некоррелированных потоков. В данной работе предложен вариант реализации алгоритма ЕМ для определения параметров гиперэкспоненциального распределения при наличии корреляционных свойств анализируемого потока.</p></abstract><trans-abstract xml:lang="en"><p>An accurate assessment of the quality of service parameters in modern information communication networks is a very important task. This paper proposes the use of hyperexponential distributions to solve the problem of approxi-mating an arbitrary probability density in the G/G/1 system for the case when the approximation by a system of the type H2/H2/1 is assumed. To determine the parameters of the probability density of the hyperexponential distribu-tion, it is proposed to use EM- algorithm that provides fairly simple use cases for uncorrelated flows. In this paper, we propose a variant of the EM algorithm implementation for determining the parameters of the hyperexponential distribution in the presence of correlation properties of the analyzed flow.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>EM-алгоритм</kwd><kwd>распределения случайных величин</kwd><kwd>корреляция</kwd><kwd>аппроксимация</kwd><kwd>QoS.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>EM-algorithm</kwd><kwd>distributions of random variables</kwd><kwd>correlation</kwd><kwd>approximation</kwd><kwd>QoS</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Kleinrock L. Queueing Systems. Vol. I. Theory. John Wiley &amp; Sons, 1975. 432 p.</mixed-citation><mixed-citation xml:lang="en">Kleinrock L.  Queueing Systems. Vol. I. Theory. John Wiley &amp; Sons; 1975. 432 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Шелухин О.И., Тенякшев A.M., Осин А.В. Фрактальные процессы в телекоммуникациях. М.: Радиотехника, 2003. 480 с.</mixed-citation><mixed-citation xml:lang="en">Sheluhin O.I., Tenyakshev A.M., Osin A.V. Fractal Processes in Telecommunications. Moscow: Radiotehnika Publ.; 2003. 480 p. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Буранова М.А. Исследование статистических характеристик самоподобного телекоммуникационного трафика // Инфокоммуникационные технологии. 2012. Т. 10. № 4. С. 35‒41.</mixed-citation><mixed-citation xml:lang="en">Buranova M.A. Research of statistical characteristics of the self-similar telecommunication traffic. Infokommunikacionnie tehnologii. 2012;10(4):35‒40. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Kartashevskiy V., Kireeva N., Buranova M., Chupakhina L. Study of queuing system G/G/1 with an arbitrary distribution of time parameter system // Proceedings of the 2nd International Scientific-Practical Conference Problems of Infocommunications Science and Technology (PIC S&amp;T, Kharkiv, Ukraine, 13‒15 October 2015). IEEE, 2015. DOI:10.1109/INFOCOMMST.2015.7357297</mixed-citation><mixed-citation xml:lang="en">Kartashevskiy V., Kireeva N., Buranova M., Chupakhina L. Study of queuing system G/G/1 with an arbitrary distribution of time parameter system. Proceedings of the 2nd International Scientific-Practical Conference Problems of Infocommunications Science and Technology, PIC S&amp;T, 13‒15 October 2015, Kharkiv, Ukraine. IEEE; 2015. DOI:10.1109/INFOCOMMST.2015.7357297</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Kartashevskiy V., Buranova M. Analysis of Packet Jitter in Multiservice Network // Proceedings of the 5th International Scientific-Practical Conference Problems of Infocommunications Science and Technology (PIC S&amp;T, Kharkiv, Ukraine, 9‒12 October 2018). IEEE, 2015. PP. 797‒802. DOI:10.1109/INFOCOMMST.2018.8632085.</mixed-citation><mixed-citation xml:lang="en">Kartashevskiy V., Buranova M. Analysis of Packet Jitter in Multiservice Network // Proceedings of the 5th International Scientific-Practical Conference Problems of Infocommunications Science and Technology, PIC S&amp;T, 9‒12 October 2018, Kharkiv, Ukraine. IEEE; 2018. p.797‒802. DOI:10.1109/INFOCOMMST.2018.8632085</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Буранова М.А., Карташевский В.Г., Латыпов Р.Т. Оценка джиттера в системе G/M/1 на основе использования гиперэкспоненциальных распределений // Инфокоммуникационные технологии. 2020. Т. 18. № 1. С. 13‒20. DOI:10.18469/ikt.2020.18.1.02</mixed-citation><mixed-citation xml:lang="en">Buranova M.A., Kartashevskiy V.G., Latypov R.T. Estimation of jitter in the G/M/1 system based on the use of hyperexponential distributions. Infokommunikacionnie tehnologii. 2020;18(1):13‒20. (in Russ.) DOI:10.18469/ikt.2020.18.1.02</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Kartashevskiy I., Buranova M. Calculation of Packet Jitter for Correlated Traffic // Proceedings of the 19th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2019) and Proceedings of the 12th Conference on Internet of Things and Smart Spaces (ruSMART, 2019, St. Petersburg, Russia, 26‒28 August 2019). Lecture Notes in Computer Science. Computer Communication Networks and Telecommunications. Vol. 11660. PP. 610‒620. Cham: Springer, 2019. DOI:10.1007/978-3-030-30859-9_53.</mixed-citation><mixed-citation xml:lang="en">Kartashevskiy I., Buranova M. Calculation of Packet Jitter for Correlated Traffic. Proceedings of the 19th International Conference on Next Generation Wired/Wireless Networking, NEW2AN 2019, and Proceedings of the 12th Conference on Internet of Things and Smart Spaces, ruSMART 2019, 26‒28 August 2019, St. Petersburg, Russia. Lecture Notes in Computer Science. Computer Communication Networks and Telecommunications. vol.11660. p.610‒620. Cham: Springer; 2019. DOI:10.1007/978-3-030-30859-9_53</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Vishnevskii V.M., Dudin A.N. Queueing Systems with Correlated Arrival Flows and Their Applications to Modeling Telecommunication Networks // Automation and Remote Control. 2017. Vol. 78(8). PP. 1361–1403. DOI:10.1134/S000511791708001X</mixed-citation><mixed-citation xml:lang="en">Vishnevskii V.M., Dudin A.N. Queueing Systems with Correlated Arrival Flows and Their Applications to Modeling Telecommunication Networks. Automation and Remote Control. 2017;78(8):1361–1403. DOI:10.1134/S000511791708001X</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Balcioĝlu B., Jagerman D.L., Altiok T. Approximate mean waiting time in a GI/D/1 queue with autocorrelated times to failures // IIE Transactions. 2007. Vol. 39. Iss. 10. PP. 985‒996. DOI:10.1080/07408170701275343</mixed-citation><mixed-citation xml:lang="en">Balcioĝlu B., Jagerman D.L., Altiok T. Approximate mean waiting time in a GI/D/1 queue with autocorrelated times to failures. IIE Transactions. 2007;39(10):985‒996. DOI:10.1080/07408170701275343</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Бузов А.Л., Букашкин С.А. Специальная радиосвязь. Развитие и модернизация оборудования и объектов. М.: Радиотехника, 2017. 448 с.</mixed-citation><mixed-citation xml:lang="en">Buzov A.L., Bukashkin S.A. Special Radio Communication. Development and Modernization of Equipment and Facilities. Moscow: Radiotekhnika Publ.; 2017. 448 p. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Balcıoglu B., Jagerman D.L., Altıok T. Merging and splitting autocorrelated arrival processes and impact on queueing performance // Performance Evaluation. 2008. Vol. 65. Iss. 9. PP. 653‒669. DOI:10.1016/j.peva.2008.02.003</mixed-citation><mixed-citation xml:lang="en">Balcıoglu B., Jagerman D.L., Altıok T. Merging and splitting autocorrelated arrival processes and impact on queueing performance. Performance Evaluation. 2008;65(9):653‒669. DOI:10.1016/j.peva.2008.02.003</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Keilson J., Machihara F. Hyperexponential waiting time structure in hyperexponential "H" _"N" 〖"/H" 〗_"K" /1 system // Journal of the Operation Society of Japan. 1985. Vol. 28(3). PP. 242‒250.</mixed-citation><mixed-citation xml:lang="en">Keilson J., Machihara F. Hyperexponential waiting time structure in hyperexponential "H" _"N"   〖"/H" 〗_"K" /1 system. Journal of the Operation Society of Japan. 1985;28(3):242‒250.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Feldmann A., Whitt W. Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network Performance Models // Performance Evaluation. 1998. Vol. 31. Iss. 3-4. PP. 245‒279. DOI:10.1016/S0166-5316(97)00003-5</mixed-citation><mixed-citation xml:lang="en">Feldmann A., Whitt W. Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network Performance Models. Performance Evaluation. 1998;31(3-4):245‒279. DOI:10.1016/S0166-5316(97)00003-5</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Buranova M., Ergasheva D., Kartashevskiy V. Using the EM-algorithm to approximate the Distribution of a Mixture by Hyperexponents // Proceedings of the International Conference on Engineering and Telecommunication (EnT, Dolgoprudny, Russia, 20‒21 November 2019). IEEE, 2019. DOI:10.1109/EnT47717.2019.9030551</mixed-citation><mixed-citation xml:lang="en">Buranova M., Ergasheva D., Kartashevskiy V. Using the EM-algorithm to approximate the Distribution of a Mixture by Hyperexponents. Proceedings of the International Conference on Engineering and Telecommunication, EnT, 20‒21 November 2019, Dolgoprudny, Russia. IEEE; 2019. DOI:10.1109/EnT47717.2019.9030551</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Baird S.R. Estimating mixtures of exponential distributions using maximum likelihood and the EM algorithm to improve simulation of telecommunication networks. University of British Columbia, 2002. URL: https://open.library.ubc.ca/collections/ubctheses/831/items/1.0090805 (дата обращения 18.10.2021)</mixed-citation><mixed-citation xml:lang="en">Baird S.R. Estimating mixtures of exponential distributions using maximum likelihood and the EM algorithm to improve simulation of telecommunication networks. University of British Columbia; 2002. Available from: https://open.library.ubc.ca/collections/ubctheses/831/items/1.0090805 [Accessed 18th October 2021]</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Королев В.Ю. ЕМ-алгоритм, его модификации и их применение к задаче разделения смесей вероятностных распределений. Теоретический обзор. М.: ИПИ РАН, 2007. 94 с.</mixed-citation><mixed-citation xml:lang="en">Korolyov V.Yu. The EM-Algorithm, its Modifications, and Their Application to the Problem of Separating Mixtures of Probability Distributions. Theoretical Review. Moscow: Institute of Informatics Problems of the Russian Academy of Sciences Publ.; 2007. 94 p. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Воронцов К.В. Математические методы обучения по прецедентам (теория обучения машин) URL: http://www.machinelearning.ru/wiki/images/6/6d/Voron-ML-1.pdf (дата обращения 18.10.2021)</mixed-citation><mixed-citation xml:lang="en">Voroncov K.V. Mathematical Teaching Methods on Precedents. (in Russ.) Available from: http://www.machinelearning.ru/wiki/images/6/6d/Voron-ML-1.pdf [Accessed 18th October 2021]</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Ip E.H. A Stochastic EM Estimator in the Presence of Missing Data: Theory and Practice. PhD Dissertation. Stanford University, 1994. 127 p.</mixed-citation><mixed-citation xml:lang="en">Ip E.H. A Stochastic EM Estimator in the Presence of Missing Data: Theory and Practice. PhD Dissertation. Stanford University; 1994. 127 p.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Kullback S., Leibler R.A. On information and sufficiency // The Annals of Mathematical Statistics. 1951. Vol. 22. PP. 79‒86.</mixed-citation><mixed-citation xml:lang="en">Kullback S., Leibler R.A. On information and sufficiency. The Annals of Mathematical Statistics. 1951;22:79‒86.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Быков В.В. Цифровое моделирование в статистической радиотехнике. М.: Советское радио, 1971. 328 с.</mixed-citation><mixed-citation xml:lang="en">Bykov V.V. Digital Modeling in Statistical Radio Engineering. Moscow: Soviet radio Publ.; 1971. 328 p. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Карташевский И.В., Сапрыкин А.В. Анализ времени ожидания заявки в очереди для системы массового обслуживания общего вида // T-Comm: Телекоммуникации и транспорт. 2018. Т. 12. № 2. С. 4‒10. DOI:10.24411/2072-8735-2018-10024</mixed-citation><mixed-citation xml:lang="en">Kartashevskiy I.V., Saprykin A.V. Waiting time analysis for the request in general queuing system. T-Comm. 2018;12(2):4‒10. (in Russ.) DOI:10.24411/2072-8735-2018-10024</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
