On the optimal control of a two-queue polling model

Thumbnail Image
Full text at PDC
Publication Date
Advisors (or tutors)
Journal Title
Journal ISSN
Volume Title
Google Scholar
Research Projects
Organizational Units
Journal Issue
This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the Iona-run expected average cost of holding units and switching actions of the server, and the bias vector.
P.S. Ansell, K.D. Glazebrook, I. Mitrani, Threshold policies for a single-server queuing network, Probab. Eng. Inform. Sci. 15 (2001) 15–33. S. Bhulai, G. Koole, On the structure of value functions for threshold policies in queueing models, J. Appl. Probab. 40 (2003) 613–622. S. Bhulai, F.M. Spieksma, On the uniqueness of solutions to the Poisson equations for average cost Markov chains with unbounded cost functions, Math. Methods Oper. Res.58 (2003) 221–236. O.J. Boxma, G.M. Koole, I. Mitrani, Polling models with threshold switching, in: F. Baccelli, A. Jean-Marie, I. Mitrani (Eds.), Quantitative Methods in Parallel Systems, Springer,Berlin, 1995, pp. 129–140. C. Buyukkoc, P. Varaiya, J. Walrand, The c rule revisited, Adv. Appl. Probab. 17 (1985) 237–238. E. Çinlar, Introduction to Stochastic Processes, Prentice-Hall Inc., Englewood Cliffs, NJ, 1975. Q. Deng, A two-queue polling model with regularly varying service and/or switchover times, Stoch Models 19 (2003)507–526. R. Groenevelt, G. Koole, P. Nain, On the bias vector of a two-class preemptive priority queue, Math. Methods Oper. Res. 55 (2002) 107–120. M. Hofri, K.W. Ross, On the optimal control of two queues with server setup times and its analysis, SIAM J. Comput.16 (1987) 399–420. S.M.R. Iravani, B. Kolfal, When does the c rule apply to finite-population queueing systems?, Oper. Res. Lett. 31(2005) 301–304. C. Knessl, D.I. Choi, C. Tier, A dynamic priority queue model for simultaneous service of two traffic types, SIAM J. Appl.Math. 63 (2002) 398–422. G. Koole. Assigning a single server to inhomogeneous queues with switching costs, CWI Report BS-R9405 (1994), 14pp. G. Koole, P. Nain, On the value function of a priority queue with an application to a controlled polling model,Queueing Systems 34 (2000) 199–214. G. Koole, P. Nain, An explicit solution for the value function of a priority queue, Queueing Systems 47 (2004)251–282. D.-S. Lee, B. Sengupta, Queueing analysis of a threshold based priority scheme for ATM networks, IEEE/ACM Trans. Networking 1 (1993) 709–717. Z. Liu, P. Nain, D. Towsley, On optimal polling policies Queueing Systems 11 (1992) 59–83. T.J. Ott, K.R. Krishnan, Separable routing: a scheme for statedependent routing of circuit telephone traffic, Ann. Oper. Res.35 (1992) 43–68. T. Prieto-Rumeau, O. Hernández-Lerma, The Laurent series, sensitive discount and Blackwell optimality for continuous time controlled Markov chains, Math. Meth. Oper. Res. 61 (2005) 123–145. M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley, New York, 1994. M.I. Reiman, L.M. Wein, Dynamic scheduling of a two-class queue with setups, Oper. Res. 46 (1998) 532–547. L. Takács, Introduction to the Theory of Queues, Oxford University Press, New York, 1962. L. Takács, Two queues attended by a single server, Oper. Res. 16 (1968) 639–650. J.A. Van Mieghem, Dynamic scheduling with convex delay costs: the generalized c rule, Ann. Appl. Probab. 5 (1995) 808–833.