The laplace -- stieltjes transformation of the distribution function of the peak age of information in a transmission group modeled by a two-node network

Cover Page

Cite item

Full Text

Abstract

In this paper, we consider a two-node information transmission group consisting of a peripheral node (sender node), a control center (recipient node) and two serial communication channels between them. The process of transferring information from the sending node to the receiving node is modeled by means of a two-node queuing network with an arbitrary function for distributing intervals between requests and arbitrary service durations at each node of the network, i.e., a network that, according to Kendall's designations, is usually encoded as G/G/1 -- G/G/1. In this case, the transmitted packets of information are modeled by requests, and the process of transmitting packets through the system channels is modeled by the maintenance procedure at the network nodes. The paper provides an expression for the Laplace -- Stieltjes transformation of the stationary distribution function of the peak age of information -- a metric that allows quantifying the "freshness" of information entering the receiving node in order to accept management decisions. This work continues the cycle of works by the authors devoted to the problem of analyzing the age of information, summarizing the results of the work of other authors, which is achieved through the most arbitrary assumptions about the distributions of the durations of generating and servicing applications in the network nodes. The correctness of the obtained results was verified on a number of special cases considered earlier, as well as by comparing the analytical results with the results of simulation modeling.

About the authors

Sergey Ivanovich Matyushenko

Peoples’ Friendship University of Russia (RUDN University)

Email: matyushenko-si@rudn.ru
Moscow

Konstantin Evgen'evich Samouylov

Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences

Email: samuylov-ke@rudn.ru
Moscow

References

  1. БОЧАРОВ П.П., ПЕЧИНКИН А.В. Теория массового обслу-живания. – М.: Изд-во РУДН, 1995. – 529 c.
  2. CHIARIOTTI F., VIKHROVA O., SORET B., POPOVSKI P.Peak Age of Information Distribution in TandemQueue Systems // arXiv.2004.05088. – 2020. – doi: 10.48550/arXiv.2004.05088.
  3. COSTA M., CODREANU M., EPHREMIDES A. On theAge of Information in Status Update Systems With PacketManagement // IEEE Trans. on Information Theory. –2016. – Vol. 62, No. 4. – P. 1897–1910. – doi: 10.1109/TIT.2016.2533395.
  4. KAUL S., GRUTESER M., RAI V., KENNEY J. Minimizingage of information in vehicular networks // Proc. of the 2011 8thAnnual IEEE Communications Society Conference on Sensor,Mesh and ad hoc Communications and Networks. – IEEE,2011. – P. 350–358.
  5. KAUL S. K., YATES R. D., GRUTESER M. Status updatesthrough queues // 46th Annual Conference on InformationSciences and Systems (CISS). – 2012. – P. 1–6. – doi: 10.1109/CISS.2012.6310931.
  6. KOSTA A., PAPPAS N., AGELAKIS V. Age of Information:A New Concept, Metrics and Tools // Foundations and Trendsin Networking. – 2017. – Vol. 12, No. 3. – P. 162–259. – doi: 10.1561/1300000060.
  7. ZHBANKOVA E., MANAEVA V., MARKOVA E.,GAIDAMAKA YU. The Age of Information in WirelessCellular Systems: Gaps, Open Problems, and ResearchChallenges // Sensors. – 2023. – Vol. 23, No. 19. – P. 8238. –doi: 10.3390/s23198238.

Supplementary files

Supplementary Files
Action
1. JATS XML


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Согласие на обработку персональных данных

 

Используя сайт https://journals.rcsi.science, я (далее – «Пользователь» или «Субъект персональных данных») даю согласие на обработку персональных данных на этом сайте (текст Согласия) и на обработку персональных данных с помощью сервиса «Яндекс.Метрика» (текст Согласия).