A queueing system with a batch Markovian arrival process and varying priorities

We consider herein a single-server queueing system with a finite buffer and a batch Markovian arrival process. Customers staying in the buffer may have a lower or higher priority. Immediately after arrival each of the customer is assigned the lowest priority and a timer is set for it, which is defin...

Full description

Bibliographic Details
Main Author: Valentina I. Klimenok
Format: Article
Language:Belarusian
Published: Belarusian State University 2022-07-01
Series:Журнал Белорусского государственного университета: Математика, информатика
Subjects:
Online Access:https://journals.bsu.by/index.php/mathematics/article/view/4755