The G-network as a stochastic data network model
Abstract
The primary objective of this paper is the mathematical modelling of a data network consisting of terminal devices connected by routing devices and data links. A closed exponential G-network of single-server queueing nodes with positive requests and signals is used as a stochastic model. The model is studied in the asymptotic case of a large number of requests being processed. The mathematical approach used makes it possible to calculate the main statistical characteristics of a Markov process describing the model state, as well as to reconstruct analytically its normal probability density function based on the Gaussian approximation method. The results of the study allow us to analyse the data network performance in both transient and steady state. The areas of implementation of the research results are the pre-design of data networks and solving problems of their optimisation.
References
- Gelenbe E. Product-form queueing networks with negative and positive customers. Journal of Applied Probability. 1991;28(3):656–663. DOI: 10.2307/3214499.
- Gelenbe E. G-networks by triggered customer movement. Journal of Applied Probability. 1993;30(3):742–748. DOI: 10.2307/3214781.
- Gelenbe E. G-networks with signals and batch removal. Probability in the Engineering and Informational Sciences. 1993;7(3):335–342. DOI: 10.1017/S0269964800002953.
- Caglayan MU. G-networks and their applications to machine learning, energy packet networks and routing: introduction to the special issue. Probability in the Engineering and Informational Sciences. 2017;31(4):381–395. DOI: 10.1017/S0269964817000171.
- Zhang Yunxiao. Optimal energy distribution with energy packet networks. Probability in the Engineering and Informational Sciences. 2021;35(1):75–91. DOI: 10.1017/S0269964818000566.
- Gelenbe E. Steps toward self-aware networks. Communications of the ACM. 2009;52(7):66–75. DOI: 10.1145/1538788.1538809.
- Matalytski M, Naumenko V. Investigation of G-network with signals at transient behavior. Journal of Applied Mathematics and Computational Mechanics. 2014;13(1):75–86. DOI: 10.17512/jamcm.2014.1.08.
- Gelenbe E, Pujolle G. Introduction to queueing networks. 2nd edition. Chichester: John Wiley & Sons; 1998. XIII, 244 p.
- Rusilko TV. Network stochastic call centre model. In: Petrenko SA, Tarkhov DA, editors. Distance learning technologies – 2021 (DLT-2021). Selected papers of the VI International scientific and practical conference; 2021 September 20–22; Yalta, Crimea [Internet]. [S. l.]: [s. n.]; 2021 [cited 2022 March 21]. p. 91–101 (CEUR workshop proceedings; volume 3057). Available from: https://ceur-ws.org/Vol-3057/paper9.pdf.
- Rusilko T. Asymptotic analysis of a closed G-network of unreliable nodes. Journal of Applied Mathematics and Computational Mechanics. 2022;21(2):91–102. DOI: 10.17512/jamcm.2022.2.08.
- Matalytski MA, Romaniuk TV. Priblizhennye metody analiza setei s tsentral’noi sistemoi obsluzhivaniya i ikh primeneniya [Approximate methods for analysis of networks with a central queueing system and their applications]. Grodna: Yanka Kupala State University of Grodno; 2003. 200 p. Russian.
- Medvedev GA. [Closed queueing systems and their optimisation]. Izvestiya Akademii nauk SSSR. Tekhnicheskaya kibernetika. 1978;6:199–203. Russian.
- Tikhonov VI, Mironov MA. Markovskie protsessy [Markov processes]. Moscow: Sovetskoe radio; 1977. 488 p. Russian.
- Paraev YuI. Vvedenie v statisticheskuyu dinamiku protsessov upravleniya i fil’tratsii [Introduction to statistical dynamics of management and filtering]. Moscow: Sovetskoe radio; 1976. 184 p. (Biblioteka tekhnicheskoi kibernetiki). Russian.
- Gardiner CW. Handbook of stochastic methods for physics, chemistry and the natural sciences. 2nd edition. Berlin: Springer-Verlag; 1985. 442 p. (Springer series in synergetics; volume 13). Russian edition: Gardiner CW. Stokhasticheskie metody v estestvennykh naukakh. Dobroslavskii AS, Kolomenskii AA, Tolstopyatenko AV, translators; Stratonovich RL, editor. Moscow: Mir; 1986. 526 p.
- Rusilko TV. The first two orders moments of determination method for the state vector of the queueing network in the asymptotic case. Vesnik of Yanka Kupala State University of Grodno. Series 2, Mathematics. Physics. Informatics, Сomputer Technology and Сontrol. 2021;11(2):152–161. Russian.
- Rusilko TV. Gaussian approximation method for determining the probability density of the state vector of the queueing network in the asymptotic case. Vesnik of Yanka Kupala State University of Grodno. Series 2, Mathematics. Physics. Informatics, Сomputer Technology and Сontrol. 2022;12(3):151–161. Russian.
- Tu TT, Kharin AYu. Sequential probability ratio test for many simple hypotheses on parameters of time series with trend. Journal of the Belarusian State University. Mathematics and Informatics. 2019;1:35–45. DOI: 10.33581/2520-6508-2019-1-35-45.
- Rusilko TV. Application of queueing network models in insurance. Izvestiya of Saratov University. New series. Series: Mathematics. Mechanics. Informatics. 2022;22(3):315–321. DOI: 10.18500/1816-9791-2022-22-3-315-321.
- Matalytski MA. Forecasting anticipated incomes in the Markov networks with positive and negative customers. Automation and Remote Control. 2017;78(5):815–825. DOI: 10.1134/S0005117917050046.
Copyright (c) 2023 Journal of the Belarusian State University. Mathematics and Informatics

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The authors who are published in this journal agree to the following:
- The authors retain copyright on the work and provide the journal with the right of first publication of the work on condition of license Creative Commons Attribution-NonCommercial. 4.0 International (CC BY-NC 4.0).
- The authors retain the right to enter into certain contractual agreements relating to the non-exclusive distribution of the published version of the work (e.g. post it on the institutional repository, publication in the book), with the reference to its original publication in this journal.
- The authors have the right to post their work on the Internet (e.g. on the institutional store or personal website) prior to and during the review process, conducted by the journal, as this may lead to a productive discussion and a large number of references to this work. (See The Effect of Open Access.)