Geodesic
About the peak age of information in a single-channel transmission group modeled by the $PH/PH/1/r/LCFS$ system with inversion discipline, interruption maintenance and re-service of applications
Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 1 (2024), pp. 37-52 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This article continues the author's cycle of works devoted to the problem of the Age of Information (AoI), a metric used in information systems to quantify the “freshness” of information delivered to the control center from peripheral sources. The paper considers a two-node information transmission group consisting of a sender node, a recipient node and a communication channel between them. The information transfer process is modeled by means of a single-line finite capacity queuing system with phase-type distributions, which in Kendall's notation is encoded as $PH/PH/1/r$. This takes into account the special requirements of the transmission protocol, which consist in the fact that a packet entering the system, bypassing the queue, is immediately sent for transmission, capturing the channel from the previous packet if it has not completed transmission. The packet whose transmission was interrupted is moved to the first place in the queue and, after the channel is released, attempts transmission again. For this system, an expression is obtained for the Laplace-Stieltjes transformation of the stationary distribution function of the peak age of information and its average value. A numerical study of the dependence of the peak age of information on the system load was carried out. The correctness of the analytical results was verified by comparing them with the results of simulation modeling.
Mots-clés : age of information
Keywords: peak age of information, queuing system, phase type distribution. 
@article{VTPMK_2024_1_a2,
     author = {Yu. V. Gaidamaka and S. Matyushenko and K. E. Samouylov},
     title = {About the peak age of information in a single-channel transmission group modeled by the $PH/PH/1/r/LCFS$ system with inversion discipline, interruption maintenance and re-service of applications},
     journal = {Vestnik Tverskogo gosudarstvennogo universiteta. Seri\^a Prikladna\^a matematika},
     pages = {37--52},
     year = {2024},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VTPMK_2024_1_a2/}
}
TY  - JOUR
AU  - Yu. V. Gaidamaka
AU  - S. Matyushenko
AU  - K. E. Samouylov
TI  - About the peak age of information in a single-channel transmission group modeled by the $PH/PH/1/r/LCFS$ system with inversion discipline, interruption maintenance and re-service of applications
JO  - Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika
PY  - 2024
SP  - 37
EP  - 52
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VTPMK_2024_1_a2/
LA  - ru
ID  - VTPMK_2024_1_a2
ER  - 
%0 Journal Article
%A Yu. V. Gaidamaka
%A S. Matyushenko
%A K. E. Samouylov
%T About the peak age of information in a single-channel transmission group modeled by the $PH/PH/1/r/LCFS$ system with inversion discipline, interruption maintenance and re-service of applications
%J Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika
%D 2024
%P 37-52
%N 1
%U http://geodesic.mathdoc.fr/item/VTPMK_2024_1_a2/
%G ru
%F VTPMK_2024_1_a2
Yu. V. Gaidamaka; S. Matyushenko; K. E. Samouylov. About the peak age of information in a single-channel transmission group modeled by the $PH/PH/1/r/LCFS$ system with inversion discipline, interruption maintenance and re-service of applications. Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 1 (2024), pp. 37-52. http://geodesic.mathdoc.fr/item/VTPMK_2024_1_a2/

[1] Kaul S., Gruteser M., Rai V., Kenney J., “Minimizing age of information in vehicular networks”, 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2011, 350–358

[2] Gorbunova A. V., Zaryadov I. S., Matyushenko S. I., Samujlov K. E., Shorgin S. Ya., “Approximation of the response time of a cloud computing system”, Computer science and its applications, 9:3 (2015), 32–38 (in Russian) | DOI

[3] Meykhanadzhyan L., Matyushenko S., Pyatkina D., Razumchik R., “Revisiting joint stationary distribution in two finite capacity queues operating in parallel”, Computer science and its applications, 11:3 (2017), 106–112 (in Russian) | DOI

[4] The Ongoing History of the Age of Information, 2023 https://webhome.auburn.edu/~yzs0078/AoI.html

[5] Costa M., Codreanu M., Ephremides A., “On the age of information in status update systems with packet management”, IEEE Transactions on Information Theory, 62:4 (2016), 1897–1910 | DOI | MR | Zbl

[6] Kaul S. K., Yates R. D., Gruteser M., “Status updates through queues”, 46th Annual Conference on Information Sciences and Systems (CISS), 2012, 1–6 https://ieeexplore.ieee.org/document/6310931

[7] Dogen O., Akar N., “The Multi-Source Preemptive $M/PH/1/1$ Queue with Packet Error: Exact Distribution of the Age of Information and Its Peak”, IEEE Transactions on Communications, 69:11 (2021), 7297–7308 | DOI

[8] Akar N., Dogan O., Atay E. U., “Finding the Exact Distribution of (Peak) Age of Information for Queues of $PH/PH/1/1$ and $M/PH/1/2$ Type”, IEEE Transactions on Communications, 68:9 (2020) | DOI

[9] Kosta A., Pappas N., Angelakis V., “Age of Information: A New Concept, Metric, and Tool”, Foundations and Trends in Networking, 12:3 (2017), 162–259 | DOI | Zbl

[10] Bocharov P. P., Pechinkin A. V., Queuing theory, Publishing House of RUDN, Moscow, 1995, 529 pp. (in Russian)

[11] Bocharov P. P., Pavlova O. I., “Matrix-geometric queue distribution in LCFS discipline with interruptions and phase-type distributions”, Automation and telemechanics, 1991, no. 9, 112–122 (in Russian) | Zbl

[12] Basharin G. P., Bocharov P. P., Kogan Ya. F., Queue analysis in computer networks. Theory and methods of analysis, Nauka Publ., Moscow, 1989 (in Russian) | MR

[13] Naumov V. A., “On the limiting probabilities of a semi-Markov process”, Modern tasks in the exact sciences, Peoples' Friendship University, Moscow, 1975, 35–39 (in Russian)

[14] Najm E., Yates R., Soljanin E., “Status updates through $M/G/1/1$ queues with HARQ”, Proceedings IEEE International Symposium on Information Theory (ISIT), 2017, 131–135