Analysis of a retrial queue with limited processor sharing operating in the random environment

Queueing system with limited processor sharing, which operates in the Markovian random environment, is considered. Parameters of the system (pattern of the arrival rate, capacity of the server, i.e., the number of customers than can share the server simultaneously, the service intensity, the impatience rate, etc.) depend on the state of the random environment. Customers arriving when the server capacity is exhausted join orbit and retry for service later. The stationary distribution of the system states (including the number of customers in orbit and in service) is computed and expressions for the key performance measures of the system are derived. Numerical example illustrates possibility of optimal adjustment of the server capacity to the state of the random environment. © IFIP International Federation for Information Processing 2017.

Авторы
Dudin S. 1, 2 , Dudin A. 1 , Dudina O. 1, 2 , Samouylov K. 2
Язык
Английский
Страницы
38-49
Статус
Опубликовано
Том
10372 LNCS
Год
2017
Организации
  • 1 Belarusian State University, 4 Nezavisimosti Avenue, Minsk, 220030, Belarus
  • 2 RUDN University, 6 Miklukho-Maklaya Street, Moscow, 117198, Russian Federation
Ключевые слова
Markovian arrival process; Processor sharing; Random environment
Цитировать
Поделиться

Другие записи