Discrete-time Retrial Queues With Batch Arrive And General Retrial Times

Discrete-time queueing systems with repeated customers are important branch of Queueing Theory. Recently, There is a growing interest in the analysis of discrete-time queues due to their applications in communication systems and other related areas. Many computer and communication systems operate on a discrete time basis where events can only happen at regularly spaced epochs. One of the main reasons for analysing discrete-time queues is that these systems are more appropriate than their continuous-time counterparts for modelling computer and telecommunication systems. Now discrete-time queueing systems with repeated customers has been widely used in view of their applicability in the study of many computer and communication systems in which time is slotted.In this paper, we study two queueing systems, that is, A Discrete-Time Retrial Queue with Starting Failures, Batch Arrive, Admission Control. A Discrete-Time Retrial Queue with Starting Failures, Batch Arrive and Feedback. In each model, we analyse the Markov Chain underlying the regarded queueing system and its ergodicity condition. Then, we present some performance measures of the system in steady-state. Finally, some numerical examples show the influence of the parameters on several performance characteristics. In some models, we give two stochastic decomposition laws and give the two stochastic decomposition for further explaination.