×

The \(M/G/1\) retrial queue with Bernoulli schedules and general retrial times. (English) Zbl 1008.90010

Summary: This paper is concerned with the analysis of a single-server queue with Bernoulli vacation schedules and general retrial times. 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 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 M/G/1 vacation models holds for the present system also. Some special cases are also studied.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI

References:

[1] Yang, T.; Templeton, J. G.C., A survey on retrial queues, Queueing Systems, 2, 201-233 (1987) · Zbl 0658.60124
[2] Falin, G. I., A survey of retrial queues, Queueing Systems, 7, 127-168 (1990) · Zbl 0709.60097
[3] Falin, G. I.; Templeton, J. G.C., Retrial Queues (1997), Chapman and Hall: Chapman and Hall New York · Zbl 0944.60005
[4] Artalejo, J. R., Accessible bibliography on retrial queues, Mathl. Comput. Modelling, 30, 3/4, 1-6 (1999) · Zbl 1009.90001
[5] Teghem, J., Control of the service process in a queueing system, European Jl. of Opnl. Res., 23, 141-158 (1986) · Zbl 0583.60092
[6] Doshi, B. T., Queueing system with vacations—A survey, Queueing Systems, 1, 29-66 (1986) · Zbl 0655.60089
[7] Doshi, B. T., Single-server queues with vacations, (Takagi, H., Stochastic Analysis of Computer and Communications Systems (1990), Elsevier: Elsevier Amsterdam) · Zbl 0655.60089
[8] Artalejo, J. R., Analysis of an M/G/1 queue with constant repeated attempts and server vacations, Computers Opns. Res., 24, 6, 493-504 (1997) · Zbl 0882.90048
[9] Langaris, C., Gated polling models with customers in orbit, Mathl. Comput. Modelling, 30, 3/4, 171-187 (1999) · Zbl 1042.60542
[10] Keilson, J.; Servi, L. D., Oscillating random walk models for GI/G/1 vacation system with Bernoulli schedules, J. Appl. Prob., 23, 790-802 (1986) · Zbl 0612.60087
[11] Servi, L. D., Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedule, IEEE Journal on Selected Areas in Communications, SAC-5, 3, 547 (1987), Correction in
[12] Ramasamy, R.; Servi, L. D., The busy period of the M/G/1 vacation model with a Bernoulli schedule, Stochastic Models, 4, 3, 507-521 (1988) · Zbl 0695.60095
[13] Tedijanto, Exact results for the cyclic-service queue with a Bernoulli schedule, Performance Evalution, 11, 107-115 (1990)
[14] Wortman, M. A.; Disney, R. L.; Kiessler, P. C., The M/G/1 Bernoulli feedback queues with vacations, Working paper INEN/OR/WP/05/07-90 (1990), Industrial Engineering, Texas A&M University
[15] Kapyrin, V. A., A study of the stationary distributions of a queueing system with recurring demands, Cybernetics, 13, 584-590 (1997)
[16] Yang, T.; Posner, M. J.M.; Templeton, J. G.C.; Li, H., An approximation method for the M/G/1 retrial queue with general retrial times, European Jl. of Opnl. Res., 76, 552-562 (1994) · Zbl 0802.60089
[17] Fayolle, G., A simple telephone exchange with delayed feedbacks, (Boxma, O. J.; Cohen, J. W.; Tijims, H. C., Teletraffic Analysis and Computer Performance Evaluation (1986), Elsevier Science)
[18] Farahmand, K., Single line queue with repeated demands, Queueing Systems, 6, 223-228 (1990) · Zbl 0712.60100
[19] Bertsekas, D.; Gallager, R., Data Network (1987), Prentice Hall: Prentice Hall Englewood Cliffs, NJ
[20] Sennot, L. I.; Humblet, P. A.; Tweedie, R. L., Mean drifts and the non-ergodicity of Markov chains, Opns. Res., 31, 783-789 (1983) · Zbl 0525.60072
[21] Cooper, R. B., Introduction to Queueing Theory (1981), North-Holland: North-Holland New York · Zbl 0486.60002
[22] Keilson, J.; Cozzolino, J.; Young, H., A service system with unfilled requests repeated, Opns. Res., 16, 1126-1137 (1968) · Zbl 0165.52703
[23] Levy, Y.; Yechiali, U., Utilization of idle time in an M/G/1 queueing system, Management Science, 22, 202-211 (1975) · Zbl 0313.60067
[24] Takagi, H., Queueing Analysis, Volume I: Vacation and Priority Systems (1991), North-Holland: North-Holland Amsterdam · Zbl 0744.60114
[25] Cooper, R. B., Queues served in cyclic order: Waiting times, The Bell System Tech. Journal, 49, 339-413 (1970) · Zbl 0208.22502
[26] Fuhrmann, S. W.; Cooper, R. B., Stochastic decomposition in the M/G/1 queue with generalized vacations, Opns. Res., 33, 1117-1129 (1985) · Zbl 0585.90033
[27] Doshi, B. T., A note on stochastic decomposition in a GI/G/1 queue with vacation or setup times, J. Appl. Prob., 22, 419-428 (1985) · Zbl 0566.60090
[28] Yang, T.; Li, H., The M/G/1 retrial queue with the server subject to starting failures, Queueing Systems, 16, 83-96 (1994) · Zbl 0810.90046
[29] Artalejo, J. R.; Gomez-Corral, A., Steady-state solution of a single server queue with linear request repeated, J. Appl. Prob., 34, 223-233 (1997) · Zbl 0876.60082
[30] Gross, D.; Harris, C. M., (Fundamentals of Queueing Thoery (1998), John Wiley and Sons: John Wiley and Sons New York) · Zbl 0949.60002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.