A G/M/1 retrial queue with constant retrial rate

• Chesoong Kim ^[1] ; Valentina Klimenok ^[2] ; Alexander Dudin ^[2]
  1. [1] Sangji University

     Sangji University

     Corea del Sur

     
  2. [2] Belarusian State University

     Belarusian State University

     Bielorrusia

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 22, Nº. 2, 2014, págs. 509-529
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • In this paper, we are concerned with the analytical treatment of an GI/M/1 retrial queue with constant retrial rate. Constant retrial rate is typical for some real world systems where the intensity of individual retrials is inversely proportional to the number of customers in the orbit or only one customer from the orbit is allowed to make the retrials. In our model, a customer who finds the server busy joins the queue in the orbit in accordance with the FCFS (first-come-first-out) discipline and only the oldest customer in the queue is allowed to make the repeated attempts to reach the server. A distinguishing feature of the considered system is an arbitrary distribution of inter-arrival times, while the overwhelming majority of the papers is devoted to the retrial systems with the stationary Poisson arrival process. We carry out an extensive analytical analysis of the queue in steady state using the well-known matrix analytic technique. The ergodicity condition and simple expressions for the stationary distributions of the system states at pre-arrival, post-arrival and arbitrary times are derived. The important and difficult problem of finding the stationary distribution of the sojourn time is solved in terms of the Laplace–Stieltjes transform. Little’s formula is proved. Numerical illustrations are presented.