In this paper, we consider a c-server queuing model in which customers arrive according to a batch Markovian arrival process. These customers are served in groups of varying sizes ranging from a predetermined value L through a maximum size, K. The service times are exponentially distributed. Any customer not entering into service immediately orbit in an infinite space. These orbiting customers compete for service by sending out signals that are exponentially distributed with parameter θ. Under a full access policy freed servers offer services to orbiting customers in groups of varying sizes. This multi-server retrial queue under the full access policy is a quasi-birth and death process and the steady state analysis of the model is performed by exploiting the structure of the coefficient matrices. Some interesting numerical examples are discussed.
