2026-05-31T02:36:57Zhttps://riuma.uma.es/rest/oai/requestoai:riuma.uma.es:10630/196742026-02-03T12:30:51Zcom_10630_2254col_10630_37959
Atencia-McKillop, Iván
2020-07-24T08:01:18Z
2020-07-24T08:01:18Z
2020-07-24
https://hdl.handle.net/10630/19674
This paper analyses a discrete-time Geo/G/1 retrial queue with general retrial times in which
the arriving customers may opt to follow a LCFS-PR discipline or to join the orbit where it is
contemplated the movement of jobs, customers, etc., from one place to another. The Markov
chain underlying the system has been studied, the generating functions of the number of
customers in the orbit and in the system as well as their expected values are derived. The
stochastic decomposition law and, as an application, bounds for the proximity between the
steady-state distribution for the system under study and its corresponding standard system
has been derived. Recursive formulae for calculating the steady-state distributions of the orbit
and system size have been developed. Besides, it has proved that the M/G/1 continuous-time
version of the studied model can be approximated by the discrete-time system considered.
A complete study of the sojourn time of a customer in the server, the orbit and the
system has been carried out. Numerical examples to illustrate the effect of the most signiffcant
parameters of the system on several performance characteristics are given. Finally, a section
of conclusions and research results is presented.
eng
open access
Colas de espera, Teoría de
Probabilidades
Procesos estocásticos
Sojourn Times and Steady-state Probabilities in a Retrial Queueing System
conference output