×

A queueing system with linear repeated attempts, Bernoulli schedule and feedback. (English) Zbl 1049.60080

A retrial queue is studied, where customers that find the processor busy at arrival either join the queue or the retrial group with given probabilities. After the service, customers either leave the system or join the queue, again, with given probabilities. Service times are general independent and the arrival process is a Poisson one. The ergodicity of embedded Markov chain and the steady-state distribution are studied. A generating function of system size distribution that generalizes the classical Pollaczek-Khinchin formula is derived. A stochastic decomposition law is also derived. As an application, the asymptotic behavior under high rate of retrials is analyzed.

MSC:

60K25 Queueing theory (aspects of probability theory)
60K30 Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Artalejo J.R. and Falin G.I. (1994). Stochastic decomposition for retrial queues.Top 2, 329–342. · Zbl 0837.60084 · doi:10.1007/BF02574813
[2] Artalejo J.R. and Gómez-Corral A. (1997). Steady state solution of a single-server queue with linear repeated requests.Journal of Applied Probability 34, 223–233. · Zbl 0876.60082 · doi:10.2307/3215189
[3] Artalejo J.R. (1998). Some results on theM/G/1 queue withN-policy.Asia-Pacific Journal of Operational Research 15, 147–157. · Zbl 0917.90128
[4] Atencia I., Bouza G. and Rico R. (2002). A queueing system with constant repeated attempts and Bernoulli schedule. Fifth International Conference on Operations Research, La Habana, Cuba. · Zbl 1212.90093
[5] Choi B.D. and Kulkarni V.G. (1992). Feedback retrial queueing systems. In: Bhat U.N. and Basawa I.V. (eds.),Queueing and related models. Oxford University Press, 93–105. · Zbl 0783.60092
[6] Choi B.D. and Park K.K. (1990). TheM/G/1 retrial queue with Bernoulli schedule.Queueing Systems 7, 219–227. · Zbl 0706.60089 · doi:10.1007/BF01158476
[7] Falin G.I., Artalejo J.R. and Martin M. (1993). On the single server retrial queue with priority customers.Queueing Systems 14, 439–455. · Zbl 0790.60076 · doi:10.1007/BF01158878
[8] Fayolle G. (1986). A simple telephone exchange with delayed feedbacks.Teletraffic Analysis and Computer Performance Evaluation 22, 245–253.
[9] Langaris C. and Moutzoukis E. (1995). A retrial queue with structured batch arrivals, priorities and server vacations.Queueing Systems 20, 341–368. · Zbl 0847.90059 · doi:10.1007/BF01245324
[10] Moutzoukis E. and Langaris C. (1996). Non-preemptive priorities and vacations in a multiclass retrial queueing system.Stochastic Models 12, 455–472. · Zbl 0858.60086 · doi:10.1080/15326349608807394
[11] Pakes A.G. (1969). Some conditions for ergodicity and recurrence of Markov chains.Operations Research 17, 1058–1061. · Zbl 0183.46902 · doi:10.1287/opre.17.6.1058
[12] Takacs L. (1963). A single-server queue with feedback.Bell System Technical Journal 42, 505–519. · Zbl 0117.36004
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.