Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/341529| Title: | Analysis of retrial queue with heterogeneous servers and markovian arrival process |
| Authors: | Mei, L. Dudin, A. |
| Open Researcher and Contributor ID: | 0000-0003-2881-0227 |
| Keywords: | ЭБ БГУ::ТЕХНИЧЕСКИЕ И ПРИКЛАДНЫЕ НАУКИ. ОТРАСЛИ ЭКОНОМИКИ::Автоматика. Вычислительная техника |
| Issue Date: | 2020 |
| Publisher: | Springer |
| Citation: | Infosys Science Foundation Series in Mathematical Sciences. – 2020. – P. 29-49. |
| Abstract: | Multi-server retrial queueing system with heterogeneous servers is analyzed. Customers arrive to the system according to the Markovian arrival process. Arriving primary customers and customers retrying from orbit occupy available server with the highest service rate, if any. Otherwise, the customers move to the orbit having an infinite capacity. Service times have exponential distribution. The total retrial rate infinitely increases when the number of customers in orbit increases. Behavior of the system is described by multi-dimensional continuous-time Markov chain which belongs to the class of asymptotically quasi-Toeplitz Markov chains. This allows to derive simple and transparent ergodicity condition and compute the stationary distribution of the chain. Presented numerical results illustrate the dynamics of some performance indicators of the system when the average arrival rate increases and the importance of account of correlation in the arrival process. |
| URI: | https://elib.bsu.by/handle/123456789/341529 |
| Sponsorship: | Research is supported by “RUDN University Program 5–100” and the grant F19KOR-001 of Belarusian Republican Foundation for Fundamental Research. |
| Licence: | info:eu-repo/semantics/openAccess |
| Appears in Collections: | Статьи факультета прикладной математики и информатики |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Дудин1.pdf | 442,83 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

