Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Numerical investigation of a multiserver retrial model
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
The M/G/1 retrial queue with nonpersistent customers
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Frontiers in queueing
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
A Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times
Queueing Systems: Theory and Applications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
A discrete-time retrial queue with negative customers and unreliable server
Computers and Industrial Engineering
Performance evaluation of a discrete-time Geo[X]/G/1 retrial queue with general retrial times
Computers & Mathematics with Applications
Queue size distribution in a discrete-time D-BMAP/G/1 retrial queue
Computers and Operations Research
Analysis of the successful and blocked events in the Geo/Geo/c retrial queue
Computers & Mathematics with Applications
Fundamentals of Queueing Theory
Fundamentals of Queueing Theory
Discrete-time Geo/G/1 retrial queue with general retrial times and starting failures
Mathematical and Computer Modelling: An International Journal
Accessible bibliography on retrial queues: Progress in 2000-2009
Mathematical and Computer Modelling: An International Journal
On the numerical solution of Kronecker-based infinite level-dependent QBD processes
Performance Evaluation
| Hi-index | 0.01 |
This paper considers a discrete-time retrial queue with impatient customers. We establish the global balance equations of the Markov chain describing the system evolution and prove that this queueing system is stable as long as the customers are strict impatient and the mean retrial time is finite. Direct truncation with matrix decomposition is used to approximate the steady-state distribution of the system state and hence derive a set of performance measures. The proposed matrix decomposition scheme is presented in a general form which is applicable to any finite Markov chain of the GI/M/1-type. It represents a generalization of the Gaver-Jacobs-Latouche's algorithm that deals with QBD process. Different sets of numerical results are presented to test the efficiency of this technique compared to the generalized truncation one. Moreover, an emphasis is put on the effect of impatience on the main performance measures.