Algorithmic analysis of the Geo/Geo/c

In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with exponential retrials, is analytically intractable due to the spatial heterogeneity of the underlying Markov chain, caused from the retrial feature. In discrete-time, the occurrence of multiple events at each slot increases the complexity of the model and raises further computational difficulties. We propose several algorithmic procedures for the efficient computation of the main performance measures of this system. More specifically, we investigate the stationary distribution of the system state, the busy period and the waiting time. Several numerical examples illustrate the analysis.

• Type: Journal
• Year: 2008
• Where: EOR
• Authors: Jesus R. Artalejo, Antonis Economou, Antonio Gómez-Corral
• Keywords: Discrete-time Queue, EOR 2008, Geometric Repeated Attempts, Main Performance Measures