Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: An algorithmic approach

Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: An algorithmic approach

0.00 Avg rating0 Votes
Article ID: iaor20062931
Country: Netherlands
Volume: 141
Issue: 1
Start Page Number: 51
End Page Number: 66
Publication Date: Jan 2006
Journal: Annals of Operations Research
Authors:
Keywords: retrial queues, GI/G/1 queues
Abstract:

In this paper, we show that the discrete GI/G/1 system with Bernoulli retrials can be analyzed as a level-dependent QBD process with infinite blocks; these blocks are finite when both the inter-arrival and service times have finite supports. The resulting QBD has a special structure which makes it convenient to analyze by the Matrix-analytic method (MAM). By representing both the inter-arrival and service times using a Markov chain based approach we are able to use the tools for phase type distributions in our model. Secondly, the resulting phase type distributions have additional structures which we exploit in the development of the algorithmic approach. The final working model approximates the level-dependent Markov chain with a level independent Markov chain that has a large set of boundaries. This allows us to use the modified matrix-geometric method to analyze the problem. A key task is selecting the level at which this level independence should begin. A procedure for this selection process is presented and then the distribution of the number of jobs in the orbit is obtained. Numerical examples are presented to demonstrate how this method works.

Reviews

Required fields are marked *. Your email address will not be published.