Simplified analysis of queueing systems with random requirements

In this work, a simplification approach for analysis of queueing systems with random requirements is proposed. The main point of the approach is to keep track of only total amount of occupied system resources. Therefore, we cannot know the exact amount of resources released by the departure of a customer, so we assume it a random variable with conditional cumulative distribution function depending on only number of customers in the system and total occupied resources at the moment just before the departure. In the chapter, we briefly describe the queuing system with random requirements, the simplification method and show that in case of Poisson arrival process simplified system has exactly the same stationary probability distribution as the original one. © Springer International Publishing AG, part of Springer Nature 2018.

Авторы
Сборник материалов конференции
Издательство
Springer New York LLC
Язык
Английский
Страницы
381-390
Статус
Опубликовано
Том
231
Год
2018
Организации
  • 1 Peoples’ Friendship University of Russia (RUDN University), Miklukho-Maklaya str. 6, Moscow, 117198, Russian Federation
  • 2 Institute of Informatics Problems, FRC CSC RAS, Vavilova Str. 44-2, Moscow, 119333, Russian Federation
Ключевые слова
Insensitivity; Limited resources; Probabilistic characteristics; Queuing system
Дата создания
19.10.2018
Дата изменения
20.02.2021
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/7118/