Optimal control of an M/G/1 retrial queue with vacations

Abstract

In this note, we consider an M/G/1 retrial queue with server vacations, when retrial times, service times and vacation times are arbitrary distributed. The distribution of the number of customers in the system in stationary regime is obtained in terms of generating function. Next, we give heavy traffic approximation of such distribution. We show that the system size can be decomposed into two random variables, one of which corresponds to the system size of the ordinary M/G/1 FIFO queue without vacation. Such a stochastic decomposition property is useful for the computation of performance measures of interest. Finally, we solve simple problems of optimal control of vacation and retrial policies.

Keywords

Retrial queues / vacation / optimal control / stochastic decomposition / ageing distribution / heavy traffic

References

[1] Aissani A.. An M^X/G/1 retrial queue with exhaustive vacations. Journal of Statistics and Management Systems, 2000, 3(3): 270-286.

[2] Artalejo J.R.. Analysis of an M/G/1 retrial queue with constant repeated attempts and server vacations. Computers and Operations Research, 1997, 24(6): 493-504.

[3] Artalejo J.R., Gomez-Corall A.. Steady-state solution of a single server queue with linear repeated requests. Journal of Applied Probability, 1997, 34(3–4): 223-233.

[4] Atencia I., Moreno P.. Single-server retrial queue with general retrial time and bernoulli schedule. Applied Mathematics and Computation, 2005, 62(2): 855-880.

[5] Choi B.D., Park K.K., Pearce C.E.M.. An M/M/1 retrial queue with control policy and general retrial times. Queueing Systems, 1993, 14: 275-292.

[6] Choi B.D., Shin Y.W., Ahn W.C.. Retrial queues with collision arriving from non slotted CSMA/CD protocols. Queueing Systems, 1992, 11: 335-356.

[7] Choi B.D., Rhee K.H., Park K.K.. The M/G/1 retrial queue with retrial rate control policy. Probability in the Engineering Sciences, 1993, 1: 29-46.

[8] Doshi T.. Queueing systems with vacations - a survey. Queueing Systems, 1986, 1: 29-66.

[9] Eckeberg T.. Sharp bound on Laplace-Stieltjes transforms with applications to various queueing problems. Mathematics of Operations Research, 1977, 2(2): 135-142.

[10] Falin G.I.. A survey of retrial queues. Queueing Systems, 1990, 7: 127-168.

[11] Falin G.I., Templeton J.G.C.. Retrial Queues, 1997, New Jersey: Chapman & Hill.

[12] Fayolle G.. Boxma O.J., Cohen J.W., Tijms H.C.. A simple telephone exchange with delayed feedbacks. Teletraffic Analysis and Computer Performance Evaluation, 1986, Amsterdam: Elsevier Science 245-253.

[13] Gnedenko B.V., Kovalenko I.N.. Introduction to Queueing Theory, 1967, Moscow: Nauka

[14] Gomez-Corall A.. Stochastic analysis of single server retrial queue with general retrial times. Naval Research Logistics, 1999, 46(5): 561-581.

[15] Heyman D.P.. The T-policy for the M/G/1 queue. Management Science, 1977, 23: 757-778.

[16] Kernane, T. & Aissani, A. (2006). Stability of retrial queues with versatile policy. Journal of Applied Mathematics and Stochastic Analysis, Volume 2006, Article ID 54359, 16 pages

[17] Kumar B.K., Arivudainambi D., Vijayakumar A.. On the M^X /G/1 retrial queue with bernoulli schedules and general retrial times. Asia-Pacific Journal of Operations Research, 2002, 19(2): 177-194.

[18] Kumar B.K., Arivudainambi D.. The M/G/1 retrial queue with bernoulli schedules and general retrial times. Computer and Mathematics with Applications, 2002, 43: 15-30.

[19] Levy Y., Yechiali U.. Utilization of the idle time in an M/G/1 queueing systems. Management Science, 1975, 22: 202-211.

[20] Shikata Y., Suzuki S., Takahashi Y., Ihara T., Nakanishi T.. Loss probability evaluation of PCS call-terminating control. IEICE Transactions Fundamentals, 1999, E82A(7): 1230-1234.

[21] Stoyan D.. Comparison Methods for Queues and Other Stochastic Models, 1983, New York: Wiley.

[22] Tijms H.C.. Stochastic Models: an Algorithmic Approach, 1994, Chichester: Wiley.

[23] Wang J.. Reliability analysis of M/G/1 queues with general retrial times and server breakdowns. Progress in Natural Science, 2006, 16(5): 464-473.