Batch Arrival M/g/1 Retrial Queueing System with General Retrial Time, Bernoulli Schedule Vacation, Multi Second Optional Heterogeneous Service and Repair Facility

Retrial queueing systems are characterized by the fact that a primary request, finding all servers and waiting positions busy upon arrival, leaves the service area but after some random time, repeats its demand. Between retrials, the customer is said to be in “Orbit”. So the repeated attempts for service from the group of blocked customers are super imposed on the normal stream of arrivals of primary requests. Thus the retrial queues can be considered as alternative to queues with losses that do not take repeated attempts into account. Retrial queues have wide applications in telephone systems, computer and communication networks, random access protocols in digital communication networks and daily life situations. For a review of main results and methods, the reader is referred to the specific monographs by Falin and Templeton (1997).