|
This article is cited in 6 scientific papers (total in 6 papers)
Resource queuing systems with general service discipline
A. V. Gorbunovaa, V. A. Naumovb, Yu. V. Gaidamakaac, K. E. Samouylovca a Peoples' Friendship University of Russia,
6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
b Service Innovation Research Institute,
8A Annankatu, Helsinki 00120, Finland
c Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract:
The article gives an overview of resource queuing systems with the concentration on the methods of their investigation. A valuable part of the article is devoted to the method, which leads to a significant simplification of the system analysis while maintaining high accuracy of the estimate, and in some cases without any loss of accuracy. Simplification is to consider a system with random resource amount release at the instant of a customer departure instead of a system with the exact resource amount release equal to the occupied by the customer at the beginning of service. Subsequently, for the case of a Poisson flow of arrivals and exponential service time, the equivalence of the results for the initial and the simplified models was rigorously proved. In addition, a significant part of the paper is devoted to the overview of publications on the recurrent service discipline.
Keywords:
resource queueing systems, continuous resource, discrete resource, limited resource, recurrent service, heterogeneous network, stationary distribution, semi-Markov process.
Received: 15.01.2019
Citation:
A. V. Gorbunova, V. A. Naumov, Yu. V. Gaidamaka, K. E. Samouylov, “Resource queuing systems with general service discipline”, Inform. Primen., 13:1 (2019), 99–107
Linking options:
https://www.mathnet.ru/eng/ia584 https://www.mathnet.ru/eng/ia/v13/i1/p99
|
Statistics & downloads: |
Abstract page: | 459 | Full-text PDF : | 166 | References: | 38 |
|