M/G/1/R retrial queueing systems with priority of primary customers

We analyze a single-server retrial queueing system with finite buffer, Poisson arrivals, and general distribution of service time. If an arriving customer finds the queue completely occupied he joins a retrial group (or orbit) in order to seek service again after an exponentially distributed amount of time. We obtain a stationary distribution of the primary queue size, a recurrent algorithm for the factorial moments of the number of retrial customers and an expression for the expected number of customers in the system.

Editors
-
Publisher
-
Number of issue
3-4
Language
English
Pages
89-98
Status
Published
Department
-
Number
-
Volume
30
Year
1999
Organizations
  • 1 Dept. of Probability Theory and M., Peoples' Friendship Univ. of Russia, Miklukho-Maklaya str., 6, 117198 Moscow, Russian Federation
Keywords
Factorial moments; Poisson arrivals; Repeated attempts; Retrial queueing system; Steady-state (stationary) distribution
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/540/