A Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times

A discrete-time retrial queue with multiplicative repeated attempts

“…Let us observe that the linear policy generalizes to the classical and constant policies, and the general policy generalizes to the constant policy. Atencia and Moreno [6] extend the general retrial policy in continuous-time to the discrete-time systems and the rest of papers about discrete-time retrial queues [3, 7-10, 12, 20, 21, 23, 25, 28] assumes a retrial policy analogous to the classical one in continuous-time; to be exact, they suppose the retrial time (the time interval between two consecutive attempts by the same customer) geometrically distributed with probability 1 − r 2 , where r 2 is the probability that a repeated customer does not make a retrial in a slot. In this context each blocked customer generates a stream of repeated requests independently of the rest of customers in the retrial group.…”

A single-server discrete-time retrial G-queue with server breakdowns and repairs

“…It is well known that in the field of telecommunications modern systems are more digital than analogue, hence the studies of the modern communication systems are based more on discrete-time analysis. But, as far as we know, there are no results for the discrete retrial G-queueing systems although the analysis of discrete-time retrial queueing models has received considerable attention in the literature over the past few years (see [1,10,12,[29][30][31] and references therein).…”

A multiserver retrial queue: regenerative stability analysis

“…The performance analysis assumes a stationary regime exists, but stability conditions are not covered. Related papers [7,8] consider steady-state performance of discrete-time retrial systems. A rather complete bibliography on research related to retrial queues is in [3][4][5].…”