×

Discrete-time geo\(^{[X]}\)/G\(_{H}\)/1 retrial queue with Bernoulli feedback. (English) Zbl 1061.60092

Bathes of calls arrive according to a geometrical arrival process. At every arrival epoch a batch of \(l\) calls arrives with probability \(c_l \). If the server is busy at the arrival epoch, then all these calls join the orbit, whereas the server is free, then one of the arriving calls begins its service and the others form sources of repeated calls. Each call before being served chooses a service distribution of type \(h\) with probability \(q_h \). A call who has received service returns to the orbit for reservice with probability \(\theta \) or departs the system with probability \(1 - \theta \). The retrial time is distributed geometrically. The paper gives the generating function of the number of calls in the orbit and in the system. It is shown that the total number of calls in the system can be represented as the sum of two independent variables, one of which is the total number of calls in a queueing system with Bernoulli feedback and the other is the number of repeated calls given that the server is free.

MSC:

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

References:

[1] Meisling, T., Discrete time queueing theory, Operations Research, 6, 96-105 (1958) · Zbl 1414.90112
[2] Atencia, I.; Moreno, P., The discrete-time Geo/Geo/1 queue with negative customers and disasters, Computers and Operations Research, 31, 9, 1537-1548 (2004) · Zbl 1107.90330
[3] Bruneel, H.; Kim, B. G., Discrete-Time Models for Communication Systems Including ATM (1993), Kluwer Academic: Kluwer Academic Boston, MA
[4] Chaudhry, M. L.; Templeton, J. G.C.; Gupta, U. C., Analysis of the discrete-time GI/Geom \(n/1/N\) queue, Computers Math. Applic., 31, 1, 59-68 (1996) · Zbl 0844.90031
[5] Fiems, D.; Steyaert, B.; Bruneel, H., Randomly interrupted GI — \(G\) — 1 queues: Service strategies and stability issues, Annals of Operations Research, 112, 171-183 (2002) · Zbl 1013.90028
[6] Hunter, J. J., Mathematical techniques of applied probability, (Discrete-Time Models: Techniques and Applications, Volume 2 (1983), Academic Press: Academic Press New York) · Zbl 0184.21303
[7] Takagi, H., Queueing analysis: A foundation of performance evaluation, (Discrete-Time Systems, Volume 3 (1993), North-Holland: North-Holland Amsterdam)
[8] Zhang, Z. G.; Tian, N., Discrete time \(Geo /G/1\) queue with multiple adaptive vacations, Queueing Systems, 38, 419-429 (2001) · Zbl 1079.90525
[9] Woodward, M. E., Communication and Computer Networks: Modelling with Discrete-Time Queues (1994), IEEE Computer Society: IEEE Computer Society Los Alamitos, CA
[10] Yang, T.; Templeton, J. G.C., A survey on retrial queues, Queueing Systems, 2, 201-233 (1987) · Zbl 0658.60124
[11] Artalejo, J. R., A classified bibliography of research on retrial queues: Progress in 1990-1999, Top, 7, 2, 187-211 (1999) · Zbl 1009.90001
[12] Artalejo, J. R., Accessible bibliography on retrial queues, Mathl. Comput. Modelling, 30, 3/4, 1-6 (1999) · Zbl 1009.90001
[13] Fallin, G. I., A survey of retrial queues, Queueing Systems, 7, 127-168 (1990)
[14] Fallin, G. I.; Templeton, J. G.C., Retrial Queues (1997), Chapman & Hall: Chapman & Hall London · Zbl 0944.60005
[15] Yang, T.; Li, H., On the steady-state queue size distribution of the discrete-time \(Geo /G/1\) queue with repeated customers, Queueing Systems, 21, 199-215 (1995) · Zbl 0840.60085
[16] Choi, B. D.; Kim, J. W., Discrete-time \(Geo_1, Geo_2/G/1\) retrial queueing system with two types of calls, Computers Math. Applic., 33, 10, 79-88 (1997) · Zbl 0878.90041
[17] Li, H.; Yang, T., \( Geo /G/1\) discrete time retrial queue with Bernoulli schedule, European Journal of Operational Research, 111, 3, 629-649 (1998) · Zbl 0948.90043
[18] Li, H.; Yang, T., Steady-state queue size distribution of discrete-time PH/Geo/1 retrial queues, Mathl. Comput. Modelling, 30, 3/4, 51-63 (1999) · Zbl 1042.60543
[19] Takahashi, M.; Osawa, H.; Fujisawa, T., \( Geo^{[X]}/G/1\) retrial queue with non-preemptive priority, Asia-Pacific Journal of Operational Research, 16, 2, 215-234 (1999) · Zbl 1053.90505
[20] Takacs, L., A single-server queue with feedback, Bell System Technical Journal, 42, 505-519 (1963)
[21] Choi, B. D.; Kulkarni, V. G., Feedback retrial queueing systems, (Bhat, U. N.; Basawa, I. V., Queueing and Related Models (1992), Oxford University Press: Oxford University Press New York), 93-105 · Zbl 0783.60092
[22] Farahmand, K.; Smith, N. H., Retrial queues with recurrent demand option, Journal of Applied Mathematics and Stochastic Analysis, 9, 2, 221-228 (1996) · Zbl 0858.60078
[23] Fuhrmann, S. W.; Cooper, R. B., Stochastic decompositions in the \(M/G/1\) queue with generalized vacations, Operations Research, 33, 5, 1117-1129 (1985) · Zbl 0585.90033
[24] Shanthikumar, J. G., On stochastic decomposition in \(M/G/1\) type queues with generalized server vacations, Operations Research, 36, 4, 566-569 (1988) · Zbl 0653.90023
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.