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

摘要: We consider a discrete-time Geo/G/1 retrial queue in which the time has general distribution and server, after each service completion, begins process of search order to find following customer be served. study Markov chain underlying considered queueing system its ergodicity condition. generating function number customers orbit system. derive stochastic decomposition law as an application we give bounds for proximity between steady-state distributions our corresponding standard Also, develop recursive formulae calculating sizes. Besides, prove that M/G/1 with times can approximated by Finally, numerical examples illustrate effect parameters on several performance characteristics.