Analysis of an M/G/1 queue with constant repeated attempts and server vacations

Computers and Operations Research

Volumn 24, Issue 6, 1997, Pages 493-504

  Artalejo, J R ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; INFORMATION RETRIEVAL; OPTIMAL CONTROL SYSTEMS; QUEUEING THEORY;

SERVER VACATIONS;

OPERATIONS RESEARCH;

EID: 0031166569     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00076-7     Document Type: Article

References (28)

1. Teghem, J., Control of the service process in a queueing system. Eur. J. Oper. Res., 1986, 23, 141-158.
2. Doshi, B.T., Single-server queues with vacations. In Stochastic Analysis of Computer and Communications Systems. ed. H. Takagi, Elsevier, Amsterdam, 1990.
3. Yang, T. and Templeton, J. G. C., A survey on retrial queues. Queueing Sys., 1987, 2, 201-233.
4. Falin, G. I., A survey of retrial queues. Queueing Sys., 1990, 7, 127-168.
5. Li, H. and Yang, T., A single-server retrial queue with server vacations and a finite number of input sources. Eur. J. Oper. Res., 1995, 85, 149-160.
6. Langaris, C. and Moutzoukis, E., A retrial queue with structured batch arrivals, priorities and server vacations. Queueing Sys., 1995, 20, 341-368.
7. Farahmand, K., Single line queue with repeated demands. Queueing Sys., 1990, 6, 223-228.
8. Martin, M. and Artalejo, J. R., Analysis of an M/G/1 queue with two types of impatient units. Adv. Appl. Prob., 1995, 27, 840-861.
9. Neuts, M. F. and Ramalhoto, M. F., A service model in which the server is required to search for customers. J. App. Prob., 1984, 21, 157-166.
10. Choi, B. D., Shin, Y. W. and Ahn, W. C., Retrial queues with collision arising from unslotted CSMA/CD protocol. Queueing Sys., 1992, 11, 335-356.
11. Heyman, D. P., The T-policy for the M/G/1 queue. Mgmt Sci., 1977, 23, 775-778.
12. Fuhrmann, S. W. and Cooper, R. B., Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res., 1985, 33, 1117-1129.
13. Artalejo, J. R. and Gomez-Corral, A., Steady state solution of a single-server queue with linear request repeated. J. Appl. Prob. 34 (in press).
14. Cinlar, E., Int. Stochastic Proc. Prentice-Hall, New York, 1975.
15. Sennott, L. I., Humblet, P. A. and Tweedie, R. L., Mean drifts and the non-ergodicity of Markov chains. Oper. Res., 1983, 31, 783-789.
16. Tijms, H. C., Stochastic Models: an Algorithmic Approach, Wiley, Chichester, 1994.
17. Artalejo, J. R., New results in retrial queueing systems with breakdown of the servers. Statistica Neerlandica, 1994, 48, 23-36.
18. de Kok, A. G., Algorithmic methods for single server systems with repeated attempts. Statistica Neerlandica, 1984, 38, 23-32.
19. Wolff, R. W., Poisson arrivals see time averages. Oper. Res., 1982, 30, 223-231.
20. Stidham, S., Regenerative processes in the theory of queues, with applications to the alternating-priority queue. Adv. Appl. Prob., 1972, 4, 542-577.
21. Cooper, R. B., Int. Queueing Theory. Edward Arnold, Elsevier, 1981.
22. Artalejo, J. R. and Falin, G. I., Stochastic decomposition for retrial queues. Top, 1994, 2, 329-342.
23. Yang, T., Posner, M. J. M., Templeton, J. G. C. and Li, H., An approximation method for the M/G/1 retrial queue with general retrial times. Eur. J. Oper. Res., 1994, 76, 552-562.
24. Yadin, M. and Naor, P., Queueing systems with a removable service station. Opl Res. Quart., 1963, 14, 393-405.
25. Choo, Q. H. and Conolly, B., New results in the theory of repeated orders queueing systems. J. Appl. Prob., 1979, 16, 631-640.
26. Kulkarni, V. G., Expected waiting times in a multiclass batch arrival retrial queue. J. Appl. Prob., 1986, 23, 144-159.
27. Lee, S. S., Lee, H. W., Yoon, S. H. and Chae, K. C., Batch arrival queue with N-policy and single vacation. Comp. Oper. Res., 1995, 22, 173-189.
28. X/G/1/K queue with multiple server vacations. Comp. Oper. Res., 1995, 22, 543-552.