Multiserver queue with addressed retrials |
| |
Authors: | V. V. Mushko M. J. Jacob K. O. Ramakrishnan A. Krishnamoorthy A. N. Dudin |
| |
Affiliation: | (1) Belarus State University, 4 F. Skorina Ave, Minsk, 220050, Belarus;(2) National Institute of Technology, Calicut, 673 601, India;(3) Cochin University of Science and Technology, Cochin, 682 022, India;(4) Department of Applied Mathematics and Computer Science, Belarus State University, 4 F. Skorina Ave, Minsk, 220050, Belarus |
| |
Abstract: | This paper presents a multiserver retrial queueing system with servers kept apart, thereby rendering it impossible for one to know the status (idle/busy) of the others. Customers proceeding to one channel will have to go to orbit if the server in it is busy and retry after some time to some channel, not necessarily the one already tried. Each orbital customer, independently of others, chooses the server randomly according to some specified probability distribution. Further this distribution is identical for all customers. We assume that the same ‘orbit’ is used by all retrial customers, between repeated attempts, to access the servers. We derive the system state probability distribution under Poisson arrival process of external customers, exponentially distributed service times and linear retrial rates to access the servers. Several system state characteristics are obtained and numerical illustrations provided. AMS subject classification: Primary 60K25 60K20 |
| |
Keywords: | Retrial queue Addressed retrial Stationary distribution |
本文献已被 SpringerLink 等数据库收录! |
|