Analysis of the BMAP/PH/N queueing system with backup servers

We consider a novel multi-server queueing system that is potentially useful for optimizing real-world systems, in which the objectives of high performance and low power consumption are conflicting. The queueing model is formulated and investigated under the assumption that an arrival flow is defined by a batch Markovian arrival process and random values characterizing customer processing have the phase-type distribution. If the service time of some customer by a server exceeds a certain random bound, this server receives help from a so-called backup server from a finite pool of backup servers. The behavior of the system is described by a quite complicated multi-dimensional continuous-time Markov chain that is successfully analyzed in this paper. Examples of the potential use of the obtained results in managerial decisions are presented. © 2017 Elsevier Inc.

Авторы
Издательство
Elsevier Inc.
Язык
Английский
Страницы
64-84
Статус
Опубликовано
Том
57
Год
2018
Организации
  • 1 Department of Applied Mathematics and Computer Science, Belarusian State University, Nezavisimosti Avenue, 4, Minsk, 220030, Belarus
  • 2 Department of Applied Probability and Informatics, RUDN University, Miklukho-Maklaya Street, 6, Moscow, 117198, Russian Federation
Ключевые слова
Backup servers; Markovian arrival process; Multi-server queueing system; Optimization; Stationary distribution
Дата создания
19.10.2018
Дата изменения
25.05.2021
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/6669/
Поделиться

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