Asymptotic analysis of a closed G-network with rewards

A closed exponential G-network with positive and negative customers is studied. In addition, the G-network under study generates a sequence of rewards or earnings associated with network transitions from one state to another. The total network reward is a random process governed by the probabilistic...

Full description

Bibliographic Details
Published in:Вестник Томского государственного университета. Управление, вычислительная техника и информатика № 68. С. 38-47
Main Author: Rusilko, Tatiana V.
Other Authors: Salnikov, Dmitry A.
Format: Article
Language:English
Subjects:
Online Access:http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001146907
LEADER 02274nab a2200325 c 4500
001 koha001146907
005 20241102112648.0
007 cr |
008 241029|2024 ru s a eng d
024 7 |a 10.17223/19988605/68/4  |2 doi 
035 |a koha001146907 
040 |a RU-ToGU  |b rus  |c RU-ToGU 
100 1 |a Rusilko, Tatiana V. 
245 1 0 |a Asymptotic analysis of a closed G-network with rewards  |c T. V. Rusilko, D. A. Salnikov 
246 1 1 |a Асимптотический анализ замкнутой G-сети с вознаграждениями 
336 |a Текст 
337 |a электронный 
504 |a Библиогр.: 16 назв. 
520 3 |a A closed exponential G-network with positive and negative customers is studied. In addition, the G-network under study generates a sequence of rewards or earnings associated with network transitions from one state to another. The total network reward is a random process governed by the probabilistic relations of the Markov process that determines the number of customers in the network nodes. The purpose of this paper is to asymptotically study the G-network with rewards under the assumption of a large number of customers. The main objective is to calculate the expected total reward of the G-network in the asymptotic case. It is proved that reward density function satisfies the generalized Kolmogorov back-ward equation. An ordinary differential equation for the expected reward that the G-network will earn in a time t if it starts in a given initial state, is derived. 
653 |a сети массового обслуживания 
653 |a метод асимптотического анализа 
653 |a сети с вознаграждениями 
653 |a G-сети 
655 4 |a статьи в журналах 
700 1 |a Salnikov, Dmitry A. 
773 0 |t Вестник Томского государственного университета. Управление, вычислительная техника и информатика  |d 2024  |g  № 68. С. 38-47  |x 1998-8605  |w 0210-40860 
852 4 |a RU-ToGU 
856 4 |u http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001146907 
908 |a статья 
999 |c 1146907  |d 1146907