Resource queuing systems with general service discipline

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 maintaininghigh 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. © 2019 Federal Research Center "Computer Science and Control" of Russian Academy of Sciences. All rights reserved.

Авторы
Издательство
Федеральный исследовательский центр "Информатика и управление" РАН
Номер выпуска
1
Язык
Русский
Страницы
99-107
Статус
Опубликовано
Том
13
Год
2019
Организации
  • 1 Peoples' Friendship University of Russia, 6 Miklukho-Maklaya Str., Moscow, 117198, Russian Federation
  • 2 Service Innovation Research Institute, 8A Annankatu, Helsinki, 00120, Finland
  • 3 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
Ключевые слова
Continuous resource; Discrete resource; Heterogeneous network; Limited resource; Recurrent service; Resource queueing systems; Semi-Markov process; Stationary distribution
Дата создания
19.07.2019
Дата изменения
19.07.2019
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/38828/