Polling Models with Threshold Switching

We consider a model of two M/M/1 queues, served by a single server. The service policy for this polling model is of threshold type: the server serves queue 1 exhaustively, and does not remain at an empty queue if the other one is non-empty. It switches from queue 2 to queue 1 when the size of the latter queue reaches some level T, either preemptively or non-preemptively. All switches are instantaneous.

[1]  D. Lee.  A two-queue model with exhaustive and limited service disciplines , 1996 .

[2]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[3]  Donald F. Towsley,et al.  On optimal polling policies , 1992, Queueing Syst. Theory Appl..

[4]  Lajos Takács.  Two Queues Attended by a Single Server , 1968, Oper. Res..

[5]  Ger Koole,et al.  Asigning a Single Server to Inhomogeneous Queues with Switching Costs , 1997, Theor. Comput. Sci..

[6]  M. Yadin.  Queueing with alternating priorities, treated as random walk on the lattice in the plane , 1970 .

[7]  Ger Koole,et al.  A two-queue polling model with a threshold service policy , 1995, MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[8]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[9]  G. M. Koole.  On the power series algorithm , 1994 .

[10]  Duan-Shin Lee,et al.  Queueing analysis of a threshold based priority scheme for ATM networks , 1993, TNET.

[11]  J. P. C. Blanc,et al.  Performance Analysis and Optimization with the Power-Series Algorithm , 1993, Performance/SIGMETRICS Tutorials.

[12]  Izak Duenyas,et al.  Stochastic scheduling of parallel queues with set-up costs , 1995, Queueing Syst. Theory Appl..

[13]  Micha Hofri,et al.  On the Optimal Control of Two Queues with Server Setup Times and its Analysis , 1987, SIAM J. Comput..

[14]  N. K. Jaiswal,et al.  Priority queues , 1968 .