On the Analysis of Unreliable Markovian Multiserver Queue with Retrials and Impatience

Abstract

This paper concerns an approximate analysis of a Markovian multiserver infinite source retrial queuing with impatience, in which all the servers are subject to breakdown and repairs. Customer who find the total number of busy and failed servers equal to s,i.e, he is given to choice to enter a retrial orbit for an random amount of time before attempting to reccess an available server or enter the queue of size q. Customer waiting in the queue start being served as an idle or repaired server assigned to them, they can also leave the queue and enter orbit due to impatience. Customers whose service is interrupted by a failure may have the option of leaving the system entirely or returning to the orbit to repeat or resume service. We assume that each server has its own dedicated repair person, and repairs begin immediately following a failure and all process are assumed to be mutually independent. The simultaneous effect of customer balking, impatience and retrials is analyzed. We try to approximate the steady-state joint distribution of the number of customers in orbit and the number of customers in the service area using a phase-merging Algorithm.

RQwDFB: analysis of retrial queues with delayed feedback

“…Recently hierarchical SMA to study 3D MC is developed in [13]. In last decade many researchers develop similar SMAs to study 2D MC in various areas of applications [7,9,[14][15][16]24]. In all papers, authors note high efficiency of SMA (in both sense of accuracy and complexity) in comparison with other numerical methods.…”