Mx/G/1 Retrial Queue with Multiple Vacations and Starting Failures
Tóm tắt
This paper is concerned with the analysis of a single-server batch arrival retrial queue with Bernoulli service schedule and multiple vacation with general retrial times and the server being subjected to starting failures. We assume that the customers who find the server busy are queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed for access to the server. We first present the necessary and sufficient condition for the system to be stable and derive analytical results for the queue length distribution as well as some performance measures of the system under steady-state condition. We show that the general stochastic decomposition law for Mx/G/1 queue with multiple vacation models holds for the present system too. Some special cases are also studied.
Tài liệu tham khảo
Artalejo, J. R. (1997). “Analysis of an M/G/1 queue with constant repeated attempts and server vacations”, Computers Operations Research, Vol. 24, No. 6, 493–504.
Artalejo, J. R. (1999a). “Accessible bibliography on retrial queues”, Mathematical and computer modeling, Vol. 30, 1–6.
Artalejo, J. R. and Falin, G. I. (1994), “Stochastic decomposition for retrial queues”, Top Vol. 2, 329–342.
Artalejo, J. R. and Gomez-Corral, A. (1997). “Steady-state solution of a single server queue with linear request repeated”, Journal of Applied Probability, Vol. 34, 223–233.
Baba, Y. (1986). “On the Mx/G/1 queue with vacation time”, Operations Research Letters, Vol. 5, No. 2 (July), 93–98.
Chaudhry, M. L. and Templeton, J. G. C. (1983). A first course in bulk queues, John Wiley and Sons, New York.
Choi, B. D., Rhee, K. H. and Park, K. K. (1993). “The M/G/1 retrial queue with retrial rate control policy”, Prob. in the Eng. and Info. Sci., Vol. 7, 26–46.
Cooper, R. B. (1970). “Queues served in cyclic order: Waiting times”, The Bell System Technical Journal, Vol. 49, 339–413.
Cooper, R. B. (1981). Introduction to Queueing Theory, North-Holland, Newyork.
Doshi, B. T. (1985). “A note on stochastic decomposition in aGI/G/1 queue with vacation or setup times”, Journal of Applied Probability, Vol. 22, 419–428.
Doshi, B. T. (1990). “Single-server queues with vacations”, In: Takagi, H. (Ed.) Stochastic Analysis of Computer and Communications Systems, Elsevier, Amsterdam.
Falin, G. I. (1990). “A survey of retrial queues”, Queueing systems, Vol. 7, 127–168.
Falin, G. I. and Templeton, J. G. C. (1997). Retrial Queues, Chapman and Hall, London.
Farahmand, K. (1990). “Single line queue with repeated demands”, Queueing Systems, Theory and Applications, Vol. 6, 223–228.
Fayolle, G. (1986). “A simple telephone exchange with delayed feedbacks”, In: Boxma, O. J., Cohen, J. W. and Tijms, H. C. (eds.), Teletrafic Analysis and Computer Performance Evaluation, Elsevier Science, Amsterdam.
Fuhrmann, S. W. and Cooper, R. B. (1985). “Stochastic decomposition in the M/G/1 queue with generalized vacations”, Operations Research, Vol. 33, 1117–1129.
Gomez-Corral, A. (1999). “Stochastic analysis of a single server retrial queue with general retrial times”, Naval Research Logistics, Vol. 46, 561–581.
Kapyrin, V. A. (1977). “A study of the stationary distributions of a queueing system with recurring demands”, Cybernetics Vol. 13, 584–590.
Keilson, J., Cozzolino, J. and Young, H. (1968). “A service system with unfilled requests repeated”, Operations Research, Vol. 16, 1126–1137.
Keilson, J. and Servi, L. D. (1986). “Oscillating random walk models for GI/G/1 vacation system with Bernoulli schedules”, Journal of Applied Probability, Vol. 23, 790–802.
Langaris, C. (1999). “Gated polling models with customers in orbit”, Mathematical and Computer Modeling, Vol. 30, 171–187.
Langaris, C. and Moutzoukis, E. (1995). “A retrial queue with structured batch arrivals, priorities and server vacations”, Queueing Systems, Vol. 20, 341–368.
Levy, Y. and Yechiali, U. (1975). “Utilization of idle time in an M/G/1 queueing system”, Management Science, Vol. 22, 202–211.
Ramasamy, R. and Servi, L. D. (1988). “The busy period of the M/G/1 vacation model with a Bernoulli schedule”, Stochastic Models, Vol. 4, No. 3, 507–521.
Sennott, L. I., Humblet, R A. and Tweedi, R. L. (1983). “Mean drifts and the non-ergodicity of Markov chains”, Operations Research, Vol. 31, 783–789.
Servi, L. D. (1986). “Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedule”, IEEE Journal on Selected Areas in Communications, Vol. SAC-4, No. 6, 813–822, Correction in Vol. SAC- 5, No.3, 547, (1987).
Takagi, H. (1991). Queueing Analysis: Vacation and Priority Systems, Volume I, North-Holland, Amsterdam.
Tedijanto, (1990). “Exact results for the cyclic-service queue with a Bernoulli schedule”, Performance Evaluation, Vol. 11, 107–115.
Teghem, J. (1986). “Control of the service process in a queueing system”, European Journal of Operational Research, Vol. 23, 141–158.
Yang, T. and Li, H. (1994). “The M/G/1 retrial queue with the server subject to starting failures”, Queueing Systems, Vol. 16, 83–96.
Yang, T., Posner, M. J. M., Templeton, J. G. C. and Li, H. (1994). “An approximation method for the M/G/1 retrial queue with general retrial times”, European Journal of Operational Research, Vol. 76, 552–562.
Yang, T. and Templeton, J. G. C. (1987). “A survey on retrial queue”, Queueing Systems, Vol. 2, 201–233.