<?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">43407</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2024-32-3-260-270</article-id><article-id pub-id-type="edn">EUVTRK</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Computer Science</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">Distribution of the peak age of information in a two-node transmission group modeled by a system with a group flow and a phase-type service time</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-6368-9680</contrib-id><name-alternatives><name xml:lang="en"><surname>Samouylov</surname><given-names>Konstantin E.</given-names></name><name xml:lang="ru"><surname>Самуйлов</surname><given-names>К. Е.</given-names></name></name-alternatives><bio xml:lang="en"><p>Professor, Doctor of Technical Sciences, Head of the Department of Probability Theory and Cyber Security</p></bio><email>samuylov-ke@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="2024-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2024</year></pub-date><volume>32</volume><issue>3</issue><issue-title xml:lang="en">VOL 32, NO3 (2024)</issue-title><issue-title xml:lang="ru">ТОМ 32, №3 (2024)</issue-title><fpage>260</fpage><lpage>270</lpage><history><date date-type="received" iso-8601-date="2025-03-25"><day>25</day><month>03</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2024, Matyushenko S.I., Samouylov K.E.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024, Матюшенко С.И., Самуйлов К.Е.</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">Matyushenko S.I., Samouylov K.E.</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/43407">https://journals.rudn.ru/miph/article/view/43407</self-uri><abstract xml:lang="en"><p>This article continues the cycle of works by the authors devoted to the problem of the age of information (AoI), a metric used in information systems for monitoring and managing remote sources of information from the control center. The theoretical analysis of information transmission systems requires a quantitative assessment of the “freshness” of information delivered to the control center. The process of transferring information from peripheral sources to the center is usually modeled using queuing systems. In this paper, a queuing system with phase-type distributions is used to estimate the maximum value of the information age, called the peak age. This takes into account the special requirement of the transmission protocol, which consists in the fact that information enters the system in groups of random size. For this case, an expression is obtained for the Laplace-Stieltjes transformation of the stationary distribution function of the peak age of information and its average value. Based on the results of analytical modeling, a numerical study of the dependence of the average value of the peak age of information on the system load was carried out. The correctness of the expressions obtained was verified by comparing the analytical results with the results of simulation modeling.</p></abstract><trans-abstract xml:lang="ru"><p>Данная статья продолжает цикл работ авторов, посвященных проблеме возраста информации (AoI) - метрики, используемой в информационных системах для мониторинга и управления удаленными источниками информации со стороны центра управления. Теоретический анализ систем передачи информации требует количественной оценки «свежести» информации, доставляемой в центр управления. Процесс передачи информации от периферийных источников к центру обычно моделируется с помощью систем массового обслуживания. В данной работе для оценки максимального значения возраста информации, называемого пиковым возрастом, используется система массового обслуживания с распределениями фазового типа. При этом учитывается специальное требование протокола передачи, состоящее в том, что информация в систему поступает группами случайного размера. Для данного случая получено выражение для преобразования Лапласа-Стилтьеса стационарной функции распределения пикового возраста информации и его среднего значения. По результатам аналитического моделирования проведено численное исследование зависимости среднего значения пикового возраста информации от загрузки системы. Корректность полученных выражений проверена путем сравнения аналитических результатов с результатами имитационного моделирования.</p></trans-abstract><kwd-group xml:lang="en"><kwd>information age</kwd><kwd>peak information age</kwd><kwd>queuing system</kwd><kwd>phase type distribution</kwd><kwd>group flow</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>Sultan, A. Ultra Reliable and Low Latency Communications. 3GPP 2023.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Kamoun, F. &amp; Kleinrock, L. Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions. IEEE Transactions on Communications 28, 992- 1003. doi:10.1109/TCOM.1980.1094756 (1980).</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Baskett, F., Chandy, K. M., Muntz, R. R. &amp; Palacios, F. G. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers. Journal of the ACM 22, 248-260. doi:10.1145/321879.321887 (1975).</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Bedewy, A. M., Sun, Y. &amp; Shroff, N. B. Age-optimal information updates in multihop networks in 2017 IEEE International Symposium on Information Theory (ISIT) (2017), 576-580. doi:10.1109/ISIT.2017.8006593.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Bojan, T. M., Kumar, U. R. &amp; Bojan, V. M. An internet of things based intelligent transportation system in 2014 IEEE International Conference on Vehicular Electronics and Safety (2014), 174-179. doi:10.1109/ICVES.2014.7063743.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Hu, C. &amp; Dong, Y. Age of information of two-way data exchanging systems with power-splitting. Journal of Communications and Networks 21, 295-306. doi:10.1109/JCN.2019.000037 (2019).</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Costa, М., Codreanu, М. &amp; Ephremides, А. Age of information with packet management in IEEE International Symposium on Information Theory (ISIT) (2014), 1583-1587.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Chiariotti, F., Vikhrova, O., Soret, B. &amp; Popovski, P. Peak Age of Information Distribution for Edge Computing With Wireless Links. IEEE Transactions on Communications 69, 3176-3191. doi:10.1109/TCOMM.2021.3053038 (2021).</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Kadota, I., Uysal-Biyikoglu, E., Singh, R. &amp; Modiano, E. Minimizing the Age of Information in broadcast wireless networks in 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) (2016), 844-851. doi:10.1109/ALLERTON.2016.7852321.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Kosta, A., Pappas, N., Ephremides, A. &amp; Angelakis, V. Non-linear Age of Information in a Discrete Time Queue: Stationary Distribution and Average Performance Analysis in ICC 2020 - 2020 IEEE International Conference on Communications (ICC) (2020), 1-6. doi:10.1109/ICC40277.2020.9148775.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Talak, R., Karaman, S. &amp; Modiano, E. Improving Age of Information in Wireless Networks With Perfect Channel State Information. IEEE/ACM Transactions on Networking 28, 1765-1778. doi:10.1109/TNET.2020.2996237 (2020).</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Tripathi, V., Talak, R. &amp; Modiano, E. Age of information for discrete time queues 2019.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Wijerathna Basnayaka, C. M., Jayakody, D. N. K., Ponnimbaduge Perera, T. D. &amp; Vidal Ribeiro, M. Age of Information in an URLLC-enabled Decode-and-Forward Wireless Communication System in 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring) (2021), 1-6. doi:10.1109/VTC2021Spring51267.2021.9449007.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Zhbankova, E., Khakimov, A., Markova, E. &amp; Gaidamaka, Y. The Age of Information in Wireless Cellular Systems: Gaps, Open Problems, and Research Challenges. Sensors 23. doi:10.3390/s23198238 (2023).</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Kaul, S., Yates, R. &amp; Gruteser, M. Real-time status: How often should one update? in 2012 Proceedings IEEE INFOCOM (2012), 2731-2735. doi:10.1109/INFCOM.2012.6195689.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Costa, M., Codreanu, M. &amp; Ephremides, A. On the Age of Information in Status Update Systems With Packet Management. IEEE Transactions on Information Theory 62, 1897-1910. doi:10.1109/TIT.2016.2533395 (2016).</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Kaul, S. K., Yates, R. D. &amp; Gruteser, M. Status updates through queues in 2012 46th Annual Conference on Information Sciences and Systems (CISS) (2012), 1-6. doi:10.1109/CISS.2012.6310931.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Bocharov, P. P. &amp; Pechinkin, A. V. Queueing Theory [Teoriya massovogo obsluzhivaniya] in Russian. 529 pp. (Izd-vo RUDN, Moscow, 1995).</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Bocharov, P. P. &amp; Yakutina, S. V. Stationary queue distribution in a finite capacity service system with group flow and phase-type service time [Stacionarnoe raspredelenie ocheredi v sisteme obslugivaniya konechnoy emkosty s gruppovim potokom i vremenem obslugivaniya fazovogo tipa]. Avtomatika i Telemekhanika. in Russian, 106-119 (1994).</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Naumov, V. A. O predelnih veroyatnostyah polumarkovskogo processa [On the limiting probabilities of a semi-Markov process] in Russian. 35-39 (Universitet drugbi narodov, Moscow, 1975).</mixed-citation></ref></ref-list></back></article>
