Dynamic server assignment in a two-queue model

textabstractWe consider a polling model of two $M/G/1$ queues, served by a single server. The service policy for this polling model is of threshold type. Service at queue 1 is exhaustive. Service at queue 2 is exhaustive unless the size of queue 1 reaches some level $T$ during a service at queue 2; in the latter case the server switches to queue 1 at the end of that service. Both zero- and nonzero switchover times are considered. We derive exact expressions for the joint queue length distribution at customer departure epochs, and for the steady-state queue-length and sojourn time distributions. In addition, we supply a simple and very accurate approximation for the mean queue lengths, which is suitable for optimization purposes.

[1]  Isi Mitrani,et al.  Polling Models with Threshold Switching , 1995 .

[2]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[3]  Martin Eisenberg,et al.  The polling system with a stopping server , 1994, Queueing Syst. Theory Appl..

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

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

[6]  Gagan L. Choudhury,et al.  Numerical Computation of the Moments of a Probability Distribution from its Transform , 1996, Oper. Res..

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

[8]  H. R. Gail,et al.  Spectral analysis of M/G/1 and G/M/1 type Markov chains , 1996, Advances in Applied Probability.

[9]  Marcel F. Neuts,et al.  Queues Solvable without Rouché's Theorem , 1979, Oper. Res..

[10]  Ward Whitt,et al.  Numerical inversion of probability generating functions , 1992, Oper. Res. Lett..

[11]  Onno Boxma,et al.  Pseudo-conservation laws in cyclic-service systems , 1986 .

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

[13]  Boudewijn R. Haverkort,et al.  Performance evaluation of ATM cell scheduling policies using stochastic petri nets , 1994 .

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

[15]  François Baccelli,et al.  Quantitative Methods in Parallel Systems , 1995, Esprit Basic Research Series.

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

[17]  Sean P. Meyn.  Transience of Multiclass Queueing Networks Via Fluid Limit Models , 1995 .

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

[19]  D. M. G. Wishart,et al.  The single server queue , 1970 .

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

[21]  Sem Borst.  A polling system with a dormant server , 1993 .

[22]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[23]  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.