Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T13:02:10.484Z Has data issue: false hasContentIssue false
  • English
  • Français

On the M/G/1 retrial queue subjectedto breakdowns

Published online by Cambridge University Press:  15 July 2003

Natalia V. Djellab
Natalia V. Djellab*
Affiliation:
Department of Mathematics University of Annaba, BP. 12, Annaba, 23000 Algeria; djellab@yahoo.fr.
Get access

Abstract

Retrial queueing systems are characterized by the requirement that customersfinding the service area busy must join the retrial group and reapply forservice at random intervals. This paper deals with the M/G/1 retrial queuesubjected to breakdowns. We use its stochastic decomposition property toapproximate the model performance in the case of general retrial times.

Keywords

Retrial queuebreakdownstochastic decomposition approximation.

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 36 , Issue 4 , October 2002 , pp. 299 - 310
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Aissani, A., A retrial queue with redundancy and unreliable server. Queueing Systems 17 (1994) 431-449. CrossRef
Aissani, A. and Artalejo, J.R., On the single server retrial queue subject to breakdowns. Queueing Systems 30 (1998) 309-321. CrossRef
Anisimov, V.V., Averaging methods for transient regimes in overloading retrial queueing system. Math. Comput. Modelling 30 (1999) 65-78. CrossRef
J.R. Artalejo, New results in retrial queueing systems with breakdown of the servers. Statist. Neerlandica 48 (1994) 23-36.
J.R. Artalejo, Retrial queues with a finite number of sources. A Korean Math. Soc. 35 (1998) 503-525.
Artalejo, J.R. and Gomez-Coral, A., Unreliable retrial queues due to service interruptions arising from facsimile networks. Belg. J. Oper. Res. Statist. Comput. Sci. 38 (1998) 31-41.
Falin, G.I., A survey of retrial queues. Queueing Systems 7 (1990) 127-168. CrossRef
G.I. Falin and J.G.C. Templeton, Retrial queues. Chapman and Hall (1997).
Gelenbe, E., On the optimum checkpoint interval. J. ACM 26 (1979) 259-270. CrossRef
Gelenbe, E. and Hernandez, M., Optimum checkpoints with age dependent failures. Acta Inform. 27 (1990) 519-531. CrossRef
Gelenbe, E. and Iasnogorodski, R., A queue with server of walking type. Ann. Inst. H. Poincaré (B) 16 (1980) 63-73.
Krishnamoorthy, A. and Ushakumari, P.V., Reliability of a k-out-of-nsystem with repair and retrial of failed units. Top 7 (1999) 293-304. CrossRef
Kulkarni, V.G. and Choi, B.D., Retrial queue with server subject to breakdowns and repairs. Queueing Systems 7 (1990) 191-208. CrossRef
Templeton, J.G.C., Retrial queues. Top 7 (1999) 351-353. CrossRef
Yang, T. et al., An approximation method for the M/G/1 retrial queue with general retrial times. Eur. J. Oper. Res. 76 (1994) 552-562. CrossRef
Yang, T. and Templeton, J.G.C., A survey on retrial queues. Queueing Systems 2 (1987) 201-233. CrossRef