##
**Retrial queues with server subject to breakdowns and repairs.**
*(English)*
Zbl 0727.60110

The authors claim communication networks to be typical applications of their queueing model. A customer who gets a busy signal simply tries again at a later time. The server is subject to breakdowns and repairs both in his busy and in his idle period. Appropriate distributions are derived, especially the limiting distribution of the number of retrial customers and of the state of the server.

Reviewer: W.Schlee-Kössler (Baldham)

### MSC:

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

90B22 | Queues and service in operations research |

PDF
BibTeX
XML
Cite

\textit{V. G. Kulkarni} and \textit{B. D. Choi}, Queueing Syst. 7, No. 2, 191--208 (1990; Zbl 0727.60110)

Full Text:
DOI

### References:

[1] | A.M. Aleksandrov, A queueing system with repeated orders, Eng. Cybernet. Rev. 12, 3 (1974) 1. |

[2] | B.D. Choi and K.K. Park,M/G/1 retrial queue with Bernoulli schedule, Queueing Systems 7 (1990) 219-227. · Zbl 0706.60089 |

[3] | G.I. Falin, A single-line system with secondary orders, Eng. Cybernet. Rev. 17, 2 (1989) 76. |

[4] | G.I. Falin, Retrial queues, Queueing Systems 7 (1990) 127-167. · Zbl 0709.60097 |

[5] | D.P. Gaver, Jr., A waiting line with interrupted service including priorities, J. Roy. Stat. Soc. B25 (1962) 73. · Zbl 0108.31403 |

[6] | T. Yang and J.G.C. Templeton, A survey on retrial queues, Queueing Systems 2 (1987) 201. · Zbl 0658.60124 |

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.