An enhanced algorithm to solve multiserver retrial queueing systems with impatient customers

Authors:
Tien Van Do;Nam H. Do;Jie Zhang
Affiliations:
-;-;-
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 11
Cited 0

A survey on retrial queues

Queueing Systems: Theory and Applications
A survey of retrial queues

Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Numerical investigation of a multiserver retrial model

Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method

Performance Evaluation
Reliability Analysis of the Retrial Queue with Server Breakdowns and Repairs

Queueing Systems: Theory and Applications
Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)

Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)
Numerical Recipes 3rd Edition: The Art of Scientific Computing

Numerical Recipes 3rd Edition: The Art of Scientific Computing
Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit

Computer Networks: The International Journal of Computer and Telecommunications Networking
A new computational algorithm for retrial queues to cellular mobile systems with guard channels

Computers and Industrial Engineering
Accessible bibliography on retrial queues

Mathematical and Computer Modelling: An International Journal
Accessible bibliography on retrial queues: Progress in 2000-2009

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The homogenization of the state space for solving retrial queues refers to an approach, where the performance of the M/M/c retrial queue with impatient customers and c servers is approximated with a retrial queue with a maximum retrial rate restricted beyond a given number of users in the orbit. As a consequence, the stationary distribution can be obtained by the matrix-geometric method, which requires the computation of the rate matrix. In this paper, we revisit an approach based on the homogenization of the state space. We provide the exact expression for the conditional mean number of customers based on the computation of the rate matrix R with the time complexity of O(c). We develop simplified equations for the memory-efficient implementation of the computation of the performance measures. We construct an efficient algorithm for the stationary distribution with the determination of a threshold that allows the computation of performance measures with a specific accuracy.