Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
On the M/G/1 Bernoulli feedback queue with multi-class customers
Computers and Operations Research
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
Performance analysis of finite buffer discrete-time queue with bulk service
Computers and Operations Research
Performance analysis and optimal control of the Geo/Geo/c queue
Performance Evaluation
An M/G/1 queue with multiple types of feedback, gated vacations and FCFS policy
Computers and Operations Research
The discrete-time Geo/Geo/1 queue with negative customers and disasters
Computers and Operations Research
A Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times
Queueing Systems: Theory and Applications
Computers and Industrial Engineering
Steady-state queue size distribution of discrete-time PH/Geo/1 retrial queues
Mathematical and Computer Modelling: An International Journal
Accessible bibliography on retrial queues
Mathematical and Computer Modelling: An International Journal
A new computational algorithm for retrial queues to cellular mobile systems with guard channels
Computers and Industrial Engineering
An initiative for a classified bibliography on G-networks
Performance Evaluation
Bibliography on G-networks, negative customers and applications
Mathematical and Computer Modelling: An International Journal
Discrete-time Geo1,GeoX2/G1,G2/1 retrial queue with two classes of customers and feedback
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
It is well known that discrete-time queues are more appropriate than their continuous-time counterparts for modelling computer and telecommunication systems. This paper is concerned with a discrete-time Geo/G/1 retrial queue with general retrial times, Bernoulli feedback and the server subjected to starting failures. In this paper, we generalize the previous works in discrete-time retrial queue with unreliable server due to starting failures in the sense that we consider general service with Bernoulli feedback and general retrial times. We analyse the Markov chain underlying the considered queueing system and present some performance measures of the system in steady-state. We provide two stochastic decomposition laws and as application we give bounds for the distance between the system size distribution of our model and the corresponding model without retrials. Besides, some numerical results are given to illustrate the impact of the unreliability and the feedback on the performance of the system. We also investigate the relation between our discrete-time system and its continuous counterpart.