Standard and retrial queueing systems: A comparative analysis (Q700037): Difference between revisions

The authors describe main models and results of the new branch of queueing theory of retrial queues. The standard queueing models do not take into account the phenomenon of retrials and therefore cannot be applied in solving a number of practical problems. Retrial queues have been introduced to solve this deficiency. The works of Kosten (1947), Wilkinson (1956) and Cohen (1957) show that retrial queues are suitable mathematical models for modelling subscribes' behavior in telephone networks. Several textbooks contain chapters devoted to retrial queues. The second chapter is devoted to the mathematial formalism. The authors consider a multiserver queueing system in which primary customers arrive according to Poisson flow of rate \(\lambda\). The service facility consists of \(c\) identical servers, and service times are exponentially distributed with parameter \(\nu\). If a primary customer finds some server free, he automatically occupies a server and leaves the system after service. Any customer who finds all servers busy upon arrival is obliged to leave the service area but he repeats his demand after an exponential time with parameter \(\mu\). Chapter 3 is devoted to ``Other queueing systems with retrials'' (the single server model of type M/G/1, generalized retrial policies, retrial queues with a finite number of sources and so on). In Chapter 4 the authors treat ``Comparing standard and retrial queueing systems'' (the main M/M/\(c\) model, the main M/G/1 model). See also the comprehensive references of the authors.