\(Geo/G/1\) discrete time retrial queue with Bernoulli schedule.

*(English)*Zbl 0948.90043Summary: This paper studies discrete time \(Geo/G/1\) retrial queues with Bernoulli schedule in which the blocked customers either join the infinite waiting space with probability \(\alpha\) or leave the server and enter the retrial orbit with probability \(\overline\alpha(=1-\alpha)\). The customers in the retrial orbit will retry their service after a random amount of time. First, the analytic formula for the generating function of the joint distribution of the numbers of customers in the waiting space and the retrial orbit in steady state is derived. It is shown that a stochastic decomposition law holds for the retrial queues under study. That is, the total number of customers in system is distributed as a sum of two independent random variables. Second, recursive formulas for the marginal steady state probabilities of the numbers of customers in the waiting space and in the retrial orbit was developed. Since a regular two-level priority \(Geo/G/1\) queue (one without retrials) with Bernoulli schedule and head-of-line priority discipline is a special case of the studied retrial systems, the recursive formulas developed can be used to compute the marginal steady state probabilities of numbers of customers in the priority and non-priority groups for this case. Furthermore, a relationship between a continuous time \(M/G/1\) retrial queue with Bernoulli schedule and its discrete time counterpart is established so that the recursive formulas can also be applied to a continuous time system. Last, several special cases are studied and some numerical examples are presented to demonstrate the use of the recursive formulas.

##### MSC:

90B22 | Queues and service in operations research |

90B36 | Stochastic scheduling theory in operations research |

60K25 | Queueing theory (aspects of probability theory) |

##### Keywords:

discrete-time queues; generating functions; Bernoulli schedule; retrial queues; priority queues; recursive computation; stochastic decomposition
PDF
BibTeX
XML
Cite

\textit{H. Li} and \textit{T. Yang}, Eur. J. Oper. Res. 111, No. 3, 629--649 (1998; Zbl 0948.90043)

Full Text:
DOI

##### References:

[1] | Yang, T.; Templeton, J.G.C., A survey on retrial queues, Queueing syst., 2, 201-233, (1987) · Zbl 0658.60124 |

[2] | Li, H.; Yang, T., A single-server retrial queue with server vacations and a finite number of input sources, Eur. J. oper. res., 85, 149-160, (1995) · Zbl 0912.90139 |

[3] | Falin, G.I., A survey of retrial queues, Queueing syst., 7, 127-168, (1990) · Zbl 0709.60097 |

[4] | Khalil, Z.; Falin, G.; Yang, T., Some analytical results for congestion in subscriber line modules, Queueing syst., 10, 382-402, (1992) · Zbl 0786.60116 |

[5] | Choi, B.D.; Park, K.K., The M/G/1 retrial queue with Bernoulli schedule, Queueing syst., 7, 219-228, (1990) · Zbl 0706.60089 |

[6] | Yang, T.; Li, H., On the steady-state queue size distribution of the discrete-time geo/G/1 queue with repeated customers, Queueing syst., 21, 199-215, (1995) · Zbl 0840.60085 |

[7] | K. Knopp, Infinite Sequences and Series, Dover Publications, New York, 1956 · Zbl 0070.05807 |

[8] | Fuhrmann, S.W.; Cooper, R.B., Stochastic decomposition in the M/G/1 queue with generalized vacations, Oper. res., 33, 1117-1129, (1985) · Zbl 0585.90033 |

[9] | J.J. Hunter, Mathematical techniques of applied probability, vol. 2, Discrete-Time Models: Techniques and Applications, Academic Press, New York, 1983 · Zbl 0539.60065 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.