The Geo(superscript [X])/G/1 Retrial Queue with General Retrial Times, Admission Control and Starting Failures

10.6186/IJIMS.2011.22.3.6

Jinting Wang；Yunle Yin

Batch arrival retrial queue ； Markov chain ； general retrial time ； admission control ； starting failure

International Journal of Information and Management Sciences

22：3（2011 / 09 / 01）

277 - 290

英文

This paper analyzes a discrete-time Geo(superscript [X])/G/1 retrial queue with control of admission where the retrial time has a general distribution and the server is subject to starting failures. Batches of customers arrive at the system according to a geometrical process and each individual customer in a batch is subject to a control admission policy upon arrival. If the server is found idle, one of the customers admitted to the system may start his service and the rest joins the retrial group, whereas all the admitted customers go to the retrial group when the server is unavailable upon arrival. An arriving customer (primary or retrial) must turn- on the server, which takes negligible time. If the server is started successfully, the customer gets service immediately. Otherwise, the repair for the server commences immediately and the customer must leave for the orbit and make a retrial at a later time. It is assumed that the customers who find the server unavailable are queued in the orbit in accordance with an FCFS discipline and only the customer at the head of the queue is allowed for access to the server. Both external arrivals and first customer in orbit may arrive at the same epoch. Under the early arrival system (EAS) assumption, the Markov chain underlying the considered queueing system is studied and the generating functions of the orbit size and the system size distributions are obtained along with the marginal distributions of the orbit size when the server is idle, busy or down. Finally, two stochastic decomposition laws for the system size distribution are presented.

1. Aboul-Hassan, A.-K.,Rabia, S.,Taboly, F.(2009).Performance evaluation of a discrete-time Geo[X]/G/1 retrial queue with general retrial times.Computers and Mathematics with Applications,58,548-557.
2. Artalejo, J. R.,Atencia, I.(2004).On the single retrial queue with batch arrivals.Sankȳa,66,140-158.
3. Artalejo, J. R.,Falin, G. I.(1994).Stochastic decomposition for retrial queues.Top,2,329-342.
4. Artalejo, J. R.,Gómez-Corral, A.(2008).Retrial Queueing Systems: A Computational Approach.Berlin:Springer.
5. Atencia, I.,Fortes, I.,Moreno, P.,Sanchez, S.(2006).An M/G/1 retrial queue with active breakdowns and Bernoulli schedule in the server.International Journal of Information and Management Sciences,17,1-17.
6. Atencia, I.,Moreno, P.(2004).A discrete-time Geo/G/1 retrial queue with general retrial times.Queueing Systems,48,5-21.
7. Bruneel, H.,Kim, B. G.(1993).Dicrete-time models for communication systems including ATM.Boston:Kluwer Academic Publisher.
8. Choi, B. D.,Kim, J. W.(1997).Discrete-time GEO1, Geo2/G/1 retrial queueing system with two types of calls.Computers and Mathematics with Applications,33,79-88.
9. Choudhury, G.(2009).An M/G/1 retrial queue with an additional phase of second service and gerneral retrial times.International Journal of Information and Management Sciences,20,1-14.
10. Choudhury, G.,Deka, K.(2009).A note on M/G/1 queue with two phases of service and linear repeated attempts subject to random breakdown.International Journal of Information and Management Sciences,20,547-563.
11. Falin, G. I.(1990).A Survey of retrial queues.Queueing Systems,7,127-167.
12. Falin, G. I.,Templeton, J. G. C.(1997).Retrial Queues.London:Chapman & Hall.
13. Hunter, J. J.(1983).Mathematical techniques of applied probability, Vol. 2, Discrete-time models: techniques and applications.New York:Academic Press.
14. Kulkarni, V. G.,Choi, B. D.(1990).Retrial queue with server subject to breakdown and repairs.Queueing Systems,7,191-208.
15. Kulkarni, V. G.,Liang, H. M.(1997).Retrial queues revisited.Frontiers in Queueing,Boca Raton, FL:
16. Li, H.,Yang, T.(1999).Steady-state queue size distribution of discrete-time PH/Geo/1 retrial queues.Mathematical and Computer Modelling,30,51-63.
17. Li, H.,Yang, T.(1998).Geo/G/1 discrete-time retrial queue with Bernoulli schedule.European Journal of Operational Research,111,629-649.
18. Takagi, H.(1993).Queueing analysis: A foundation of performance evaluation, Dicrete-Time Systems.Amsterdam:North-Holland.
19. Takahashi, M.,Osawa, H.,Fujisawa, T.(1999).Geo[X]/G/1 retrial queue with non-preemptive priority.Asia-Pacific Journal of Operational Research,16,215-234.
20. Wang, J.(2006).Reliability analysis of M/G/1 retrial queues with general retrial times and server breakdowns.Progress in Natural Science,16,23-32.
21. Wang, J.,Cao, J.,Li, Q. L.(2001).Reliability analysis of the retrial queue with server breakdowns and repairs.Queueing Systems,38,363-380.
22. Wang, J.,Zhang, P.(2009).A discrete-time retrial queue with negative customers and unreliable server.Computer & Industrial Engineering,56,1216-1222.
23. Wang, J.,Zhang, P.(2009).A single-server discrete-time retrial G-queue with server breakdowns and repairs.Acta Mathematicae Applicatae Sinica,25,675-684.
24. Wang, J.,Zhao, Q.(2007).Discrete-time Geo/G/1 retrial times and starting failures.Mathematical and Computer Modelling,45,853-863.
25. Wang, J.,Zhao, Q.(2007).A disctrete-time Geo/G/1 retrial queue with starting failures and second optional service.Computers and Mathematics with Applications,53,115-127.
26. Woodward, M. E.(1994).Communication and computer networks: modelling with discrete-time queues.Los Alamitos, CA:IEEE Computer Soc. Press.
27. Yang, T.,Li, H.(1995).On the steady-state queue size distribution of the discrete-time Geo/G/1 queue with repeated customers.Queueing Systems,21,199-215.
28. Yang, T.,Li, H.(1994).The M/G/1 retrial queue with the server subject to starting failures.Queueing Systems,16,83-96.
29. Yang, T.,Templeton, J. G. C.(1987).A survey on retrial queues.Queueing Systems,2,201-233.