Numerical recipes in FORTRAN (2nd ed.): the art of scientific computing
Numerical recipes in FORTRAN (2nd ed.): the art of scientific computing
Analysis of a multi-server retrial queue with search of customers from the orbit
Performance Evaluation
Queueing Systems: Theory and Applications
Analysis of an M/{Dn}/1 retrial queue
Journal of Computational and Applied Mathematics
Algorithmic Analysis of the Maximum Queue Length in a Busy Period for the M/M/c Retrial Queue
INFORMS Journal on Computing
A multiserver retrial queue: regenerative stability analysis
Queueing Systems: Theory and Applications
Proceedings of the 5th International Conference on Queueing Theory and Network Applications
Analysis of the successful and blocked events in the Geo/Geo/c retrial queue
Computers & Mathematics with Applications
| Hi-index | 7.29 |
We consider queuing systems where customers are not allowed to queue; instead of that they make repeated attempts, or retrials, in order to enter service after some time. The performance of telephone systems and communication networks modelled as retrial queues differs from standard waiting lines because typically the retrial group is an invisible queue which cannot be observed. As a result, the original flow of primary arrivals and the flow of repeated attempts become undistinguished. Our aim in this paper is to consider some aspects of this problem. Thus, we focus on the main retrial model of M/G/1 type and investigate the distribution of the successful and blocked events made by the primary customers and the retrial customers.