Resumen de A discrete-time retrial queueing system with starting failures, Bernoulli feedback and general retrial times
Inmaculada Fortes Ruiz, Sixto Sánchez Merino, Iván Atencia Mckillop 
It is well known that discrete-time queues are more appropiate than their continuous-time counterparts for modelling computer and telecommunication systems. We present a discrete-time Geo/G/1 retrial queue with general retrial times, Bernoulli feedback and the server subjected to starting failures. We gene- ralize the previous works in discrete{time retrial queue with unrealiable server due to starting failures in the sense that we consider general service and ge- neral retrial times. Also we consider the realistic phenomenon of feedback. We analyse the Markov chain underlying the considered queueing system and pre- sent some performance measures of the system in steady-state. We provide two stochastic decomposition laws. Besides, we prove that the M/G/1 retrial queue with feedback and starting failures can be approximated by our corresponding discrete-time system. Some numerical results are given to illustrate the impact of the unreability and the feedback on the performance of the syste
