The performance of a finite capacity random access telecommunication system with repeated calls is modelled by a G/M/N/K queueing system with generally distributed interarrival time, N parallel Markovian servers, a waiting room of size K, the first come first served queueing discipline, the random access processing discipline, and retrials. In this system, a fraction of the units which at the instants of their arrival at the system find it full, may retry to be processed by merging with the incoming arrival units, after a fixed delay time. The performance of this system is approximated by a recursive algorithm, in steady state. Furthermore, the approximation outcomes are compared against those from a simulation study.
