Computation of the limiting distribution in queueing systems with repeated attempts and disasters

RAIRO - Operations Research

Volumn 33, Issue 3, 1999, Pages 371-382

  Artalejo, J R ^a   Gomez Corral A ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Disasters; G networks; Queueing theory; Repeated attempts

Indexed keywords

COMPUTATIONAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBABILITY; QUEUEING THEORY; VALUE ENGINEERING;

SINGLE SERVER QUEUES;

OPERATIONS RESEARCH;

EID: 0342794211     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:1999116     Document Type: Article

References (22)

1. J. R. ARTALEJO, New results in retrial queueing systems with breakdown of the servers, Statist. Neerlandica, 1994, 48, p. 23-36.
2. J. R. ARTALEJO and A. GOMEZ-CORRAL, Steady state solution of a single-server queue with linear request repeated, J. Appl. Probab., 1997, 34, p. 223-233.
3. J. R. ARTALEJO and A. GOMEZ-CORRAL, Analysis of a stochastic clearing system with repeated attempts, Communications in Statistics-Stochastic Models, 1998, 14, p. 623-645.
4. R. J. BOUCHERIE and O. J. BOXMA, The workload in the M/G/1 queue with work removal, Probab. Engineering and Informational Sci., 1996, 10, p. 261-277.
5. X. CHAO, A queueing network model with catastrophes and product form solution, Operations Research Letters, 1995, 18, p. 75-79.
6. G. I. FALIN and J. G. C. TEMPLETON, Retrial Queues, Chapman and Hall, London, 1997.
7. J. M. FOURNEAU, E. GELENBE and R. SUROS, G-Networks with multiple classes of positive and negative customers, Theoret. Comput. Sci., 1996, 155, p. 141-156.
8. E. GELENBE, P. GLYNN and K. SIGMAN, Queues with negative arrivals, J. Appl. Probab., 1991, 28, p. 245-250.
9. E. GELENBE, Queueing networks with negative and positive customers and product form solution, J. Appl. Probab., 1991, 28, p. 656-663.
10. E. GELENBE and M. SCHASSBERGER, Stability of product form G-Networks, Probab. Engineering and Informational Sci., 1992, 6, p. 271-276.
11. E. GELENBE, G-Networks with triggered customer movement, J. Appl. Probab., 1993, 30, p. 742-748.
12. E. GELENBE, G-Networks with signals and batch removal, Probab. Engineering and Informational Sci., 1993, 7, p. 335-342.
13. E. GELENBE and A. LABED, G-Networks with multiple classes of signals and positive customers, European J. Oper. Res., 1998, 108, p. 393-405
14. P. G. HARRISON and E. PITEL, The M/G/1 queue with negative customers, Adv. Appl. Probab., 1996, 28, p. 540-566.
15. G. JAIN and K. SIGMAN, A Pollaczek-Khintchine formula for M/G/1 queues with disasters, J. Appl. Probab., 1996, 33, p. 1191-1200.
16. A. G.DE KOK, Algorithmic methods for single server systems with repeated attempts, Statist. Neerlandica, 1984, 38, p. 23-32.
17. M. MARTIN and J. R. ARTALEJO, Analysis of an M/G/1 queue with two types of impatient units, Adv. Appl. Probab., 1995, 27, p. 840-861.
18. H. SCHELLHAAS, Computation of the state probabilities in a class of semi-regenerative queueing Models, J. Janssen, Ed., Semi-Markov Models: Theory and Applications, Plenum Press, New York and London, 1986, p. 111-130.
19. R. SERFOZO and S. STIDHAM, Semi-stationary clearing processes, Stochastic Process. Appl., 1978, 6, p. 165-178.
20. S. STIDHAM, Stochastic clearing systems, Stochastic Process. Appl., 191 A, 2, p. 85-113.
21. H. C. TIJMS, Stochastic Models: An Algorithmic Approach, John Wiley and Sons, Chichester, 1994.
22. T. YANG and J. G. C. TEMPLETON, A survey on retrial queues, Queueing Systems, 1987, 2, p. 201-233.