Standard and retrial queuesing systemsa comparative analysis

  1. Artalejo Rodríguez, Jesús Manuel
  2. Falin, Gennadi
Revue:
Revista matemática complutense

ISSN: 1139-1138 1988-2807

Année de publication: 2002

Volumen: 15

Número: 1

Pages: 101-130

Type: Article

DOI: 10.5209/REV_REMA.2002.V15.N1.16950 DIALNET GOOGLE SCHOLAR lock_openAccès ouvert editor

D'autres publications dans: Revista matemática complutense

Résumé

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.