We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues with waiting line and queues with losses. We give a survey of main results for both single server M/G/1 type and multiserver M/M/c type retrial queues and discuss similarities and differences between the retrial queues and their standard counterparts. We demonstrate that although retrial queues are closely connected with these standard queueing models they, however, possess unique distinguished features. We also mention some open problems.
@article{urn:eudml:doc:44437,
title = {Standard and retrial queueing systems: a comparative analysis.},
journal = {Revista Matem\'atica de la Universidad Complutense de Madrid},
volume = {15},
year = {2002},
pages = {101-129},
zbl = {1009.60079},
mrnumber = {MR1915218},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:44437}
}
Artalejo, Jesús; Falin, Gennadi. Standard and retrial queueing systems: a comparative analysis.. Revista Matemática de la Universidad Complutense de Madrid, Tome 15 (2002) pp. 101-129. http://gdmltest.u-ga.fr/item/urn:eudml:doc:44437/