Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/305719
Title: | Queueing System with Potential for Recruiting Secondary Servers |
Authors: | Chakravarthy, Srinivas R. Dudin, Alexander N. Dudin, Sergey A. Dudina, Olga S. |
Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетика ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетика |
Issue Date: | 2023 |
Publisher: | MDPI |
Citation: | Mathematics 2023; 11(3):624 |
Abstract: | In this paper, we consider a single server queueing system in which the arrivals occur according to a Markovian arrival process (MAP). The served customers may be recruited (or opted from those customers’ point of view) to act as secondary servers to provide services to the waiting customers. Such customers who are recruited to be servers are referred to as secondary servers. The service times of the main as well as that of the secondary servers are assumed to be exponentially distributed possibly with different parameters. Assuming that at most there can only be one secondary server at any given time and that the secondary server will leave after serving its assigned group of customers, the model is studied as a QBD-type queue. However, one can also study this model as a GI/M/1-type queue. The model is analyzed in steady state, and a few illustrative numerical examples are presented. |
URI: | https://elib.bsu.by/handle/123456789/305719 |
DOI: | 10.3390/math11030624 |
Scopus: | 85147818214 |
Licence: | info:eu-repo/semantics/openAccess |
Appears in Collections: | Статьи факультета прикладной математики и информатики |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
mathematics-11-00624-v2.pdf | 612,51 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.