Retrial tandem queue with BMAP-input and semi-Markovian service process

We consider a tandem queueing system consisting of two stations. The input flow at the single-server first station is described by a BMAP (batch Markovian arrival process). If a customer from this flow meets the busy server, it goes to the orbit of infinite size and tries its luck later on in exponentially distributed random time. The service time distribution at the first station is assumed to be semi-Markovian. After service at the first station a customer proceeds to the second station which is described by a multi-server queue without a buffer. The service time by the server of the second station is exponentially distributed. We derive the condition for the stable operation of the system and determine the stationary distribution of the system states. Some key performance measures are calculated and illustrative numerical results are presented. © 2017, Springer International Publishing AG.

Авторы
Klimenok V. 1 , Dudina O. 1 , Vishnevsky V.2 , Samouylov K. 3
Издательство
Springer Verlag
Язык
Английский
Страницы
159-173
Статус
Опубликовано
Том
700
Год
2017
Организации
  • 1 Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, 220030, Belarus
  • 2 Institute of Control Sciences of Russian Academy of Sciences, Moscow, Russian Federation
  • 3 Peoples’ Friendship University of Russia, Moscow, Russian Federation
Ключевые слова
Asymptotically quasi-Toeplitz Markov chain; Batch Markovian arrival process; Semi-Markovian service process; Tandem retrial queue
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/6101/
Поделиться

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

Kosheleva I.V., Bitkina O.A., Klivitskaya N.A., Shadyzheva L.I.
Вопросы курортологии, физиотерапии и лечебной физической культуры. Медиа Сфера. Том 94. 2017. С. 35-42