On the M/G/1 retrial queue subjected to breakdowns

Natalia V. Djellab

RAIRO - Operations Research - Recherche Opérationnelle (2002)

  • Volume: 36, Issue: 4, page 299-310
  • ISSN: 0399-0559

Abstract

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

How to cite

top

Djellab, Natalia V.. "On the M/G/1 retrial queue subjected to breakdowns." RAIRO - Operations Research - Recherche Opérationnelle 36.4 (2002): 299-310. <http://eudml.org/doc/245213>.

@article{Djellab2002,
abstract = {Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.},
author = {Djellab, Natalia V.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {retrial queue; breakdown; stochastic decomposition; approximation},
language = {eng},
number = {4},
pages = {299-310},
publisher = {EDP-Sciences},
title = {On the M/G/1 retrial queue subjected to breakdowns},
url = {http://eudml.org/doc/245213},
volume = {36},
year = {2002},
}

TY - JOUR
AU - Djellab, Natalia V.
TI - On the M/G/1 retrial queue subjected to breakdowns
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2002
PB - EDP-Sciences
VL - 36
IS - 4
SP - 299
EP - 310
AB - Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.
LA - eng
KW - retrial queue; breakdown; stochastic decomposition; approximation
UR - http://eudml.org/doc/245213
ER -

References

top
  1. [1] A. Aissani, A retrial queue with redundancy and unreliable server. Queueing Systems 17 (1994) 431-449. Zbl0817.60093MR1298601
  2. [2] A. Aissani and J.R. Artalejo, On the single server retrial queue subject to breakdowns. Queueing Systems 30 (1998) 309-321. Zbl0918.90073MR1672139
  3. [3] V.V. Anisimov, Averaging methods for transient regimes in overloading retrial queueing system. Math. Comput. Modelling 30 (1999) 65-78. Zbl1042.60528MR1722592
  4. [4] J.R. Artalejo, New results in retrial queueing systems with breakdown of the servers. Statist. Neerlandica 48 (1994) 23-36. Zbl0829.60087MR1267054
  5. [5] J.R. Artalejo, Retrial queues with a finite number of sources. A Korean Math. Soc. 35 (1998) 503-525. Zbl0930.60079MR1660793
  6. [6] J.R. Artalejo and A. Gomez–Coral, Unreliable retrial queues due to service interruptions arising from facsimile networks. Belg. J. Oper. Res. Statist. Comput. Sci. 38 (1998) 31-41. Zbl1010.90503
  7. [7] G.I. Falin, A survey of retrial queues. Queueing Systems 7 (1990) 127-168. Zbl0709.60097MR1079714
  8. [8] G.I. Falin and J.G.C. Templeton, Retrial queues. Chapman and Hall (1997). Zbl0944.60005
  9. [9] E. Gelenbe, On the optimum checkpoint interval. J. ACM 26 (1979) 259-270. Zbl0395.68024MR528031
  10. [10] E. Gelenbe and M. Hernandez, Optimum checkpoints with age dependent failures. Acta Inform. 27 (1990) 519-531. Zbl0673.68007MR1060147
  11. [11] E. Gelenbe and R. Iasnogorodski, A queue with server of walking type. Ann. Inst. H. Poincaré (B) 16 (1980) 63-73. Zbl0433.60086MR575177
  12. [12] A. Krishnamoorthy and P.V. Ushakumari, Reliability of a k -out-of- n system with repair and retrial of failed units. Top 7 (1999) 293-304. Zbl0951.60087MR1737650
  13. [13] V.G. Kulkarni and B.D. Choi, Retrial queue with server subject to breakdowns and repairs. Queueing Systems 7 (1990) 191-208. Zbl0727.60110MR1079715
  14. [14] J.G.C. Templeton, Retrial queues. Top 7 (1999) 351-353. Zbl0949.90022
  15. [15] T. Yang et al., An approximation method for the M/G/1 retrial queue with general retrial times. Eur. J. Oper. Res. 76 (1994) 552-562. Zbl0802.60089
  16. [16] T. Yang and J.G.C. Templeton, A survey on retrial queues. Queueing Systems 2 (1987) 201-233. Zbl0658.60124MR925180

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.