Computation of the moments of queue length in the BMAP∕SM∕1 queue

The BMAP∕SM∕1 queue is the most general single-server queueing model which can be analysed analytically. Problem of computation of stationary distributions of queue length is solved in the literature. However, the problem of computation of the moments of these distributions is not enough addressed. This problem is more complicated than its particular case when the service times are independent identically distributed random variables due to reducibility of some involved matrices. In this communication, we solve this problem. © 2017 Elsevier B.V.

Авторы
Издательство
Elsevier B.V.
Номер выпуска
5
Язык
Английский
Страницы
467-470
Статус
Опубликовано
Том
45
Год
2017
Организации
  • 1 Department of Applied Mathematics and Computer Science, Belarusian State University, 4, Nezavisimosti Ave., Minsk, 220030, Belarus
  • 2 Department of Applied Probability and Informatics, RUDN University, 6, Miklukho-Maklaya st., Moscow, 117198, Russian Federation
Ключевые слова
Batch Markovian arrival process; Moments of queue length; Semi-Markovian service
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/5339/