| Article ID: | iaor20062940 |
| Country: | Netherlands |
| Volume: | 141 |
| Issue: | 1 |
| Start Page Number: | 283 |
| End Page Number: | 301 |
| Publication Date: | Jan 2006 |
| Journal: | Annals of Operations Research |
| Authors: | Jacob M.J., Krishnamoorthy A., Dudin Alexander N., Mushko V.V., Ramakrishnan K.O. |
| Keywords: | retrial queues |
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.