Sojourn Times in a Queueing System with Breakdowns and General Retrial Times.

Abstract

This paper centers on a discrete-time retrial queue where the server experiences breakdowns and repairs when arriving customers may opt to follow a discipline of a last-come, first-served (LCFS)-type or to join the orbit. We focused on the extensive analysis of the system, and we obtained the stationary distributions of the number of customers in the orbit and in the system by applying the generation function (GF). We provide the stochastic decomposition law and the application bounds for the proximity between the steady-state distributions for the queueing system under consideration and its corresponding standard system. We developed recursive formulae aimed at the calculation of the steady-state of the orbit and the system. We proved that our discrete-time system approximates M/G/1 with breakdowns and repairs. We analyzed the busy period of an auxiliary system, the objective of which was to study the customer’s delay. The stationary distribution of a customer’s sojourn in the orbit and in the system was the object of a thorough and complete study. Finally, we provide numerical examples that outline the effect of the parameters on several performance characteristics and a conclusions section resuming the main research contributions of the paper.