Distribution of the Delay in Polling Systems in Heavy Traffic

Abstract We consider asymmetric cyclic polling systems with an arbitrary number of queues, with general mixtures of exhaustive and gated service and with generally distributed service-times and switch-over times, in heavy traffic. We derive closed-form expressions for the Laplace–Stieltjes transform (LST) of the steady-state delay incurred at each of the queues, under standard heavy-traffic scalings. The expressions give an explicit characterization of the complete (scaled) waiting-time distributions at each of the queues. The results are strikingly simple and provide a variety of new insights into the behavior of heavily loaded polling systems. In addition, the results lead to simple and fast-to-evaluate approximations for the waiting-time distributions in stable polling systems that are close to saturation. Numerical results demonstrate that the approximations are highly accurate in many practical heavy-traffic scenarios.

[1]  Awi Federgruen,et al.  Approximating queue size and waiting time distributions in general polling systems , 1994, Queueing Syst. Theory Appl..

[2]  R. D. van der Mei,et al.  Delay in polling systems with large switch-over times , 1999 .

[3]  Robert D. van der Mei,et al.  Waiting times in a two-queue model with exhaustive and Bernoulli service , 1994, Math. Methods Oper. Res..

[4]  Robert D. van der Mei,et al.  Polling systems in heavy traffic: Higher moments of the delay , 1999, Queueing Syst. Theory Appl..

[5]  Ward Whitt,et al.  Computing Distributions and Moments in Polling Models by Numerical Transform Inversion , 1996, Perform. Evaluation.

[6]  Edward G. Coffman,et al.  Polling Systems in Heavy Traffic: A Bessel Process Limit , 1998, Math. Oper. Res..

[7]  Moshe Sidi,et al.  Dominance relations in polling systems , 1990, Queueing Syst. Theory Appl..

[8]  Mandyam M. Srinivasan,et al.  Relating polling models with zero and nonzero switchover times , 1995, Queueing Syst. Theory Appl..

[9]  R. D. van der Mei.  Polling systems with periodic server routing in heavy traffic , 1999 .

[10]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[11]  M. Reiman,et al.  Polling Systems with Zero Switchover Times: A Heavy-Traffic Averaging Principle , 1995 .

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

[13]  Nick G. Duffield,et al.  Exponents for the tails of distributions in some polling models , 1997, Queueing Syst. Theory Appl..

[14]  Kin K. Leung,et al.  Cyclic-Service Systems with Probabilistically-Limited Service , 1991, IEEE J. Sel. Areas Commun..

[15]  Mandyam M. Srinivasan,et al.  Descendant set: an efficient approach for the analysis of polling systems , 1994, IEEE Trans. Commun..

[16]  Onno Boxma,et al.  The M/G/1 queue with alternating service formulated as a Riemann-Hilbert problem , 1981 .

[17]  Lawrence M. Wein,et al.  Dynamic Scheduling of a Two-Class Queue with Setups , 2011, Oper. Res..

[18]  Onno Boxma,et al.  Two queues with alternating service and switching times , 1987 .

[19]  Ward Whitt,et al.  Computing transient and steady-state distributions in polling models by numerical transform inversion , 1995, Proceedings IEEE International Conference on Communications ICC '95.

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

[21]  Sem C. Borst,et al.  The use of service limits for efficient operation of multistation single-medium communication systems , 1995, TNET.

[22]  R. D. van der Mei,et al.  Expected delay analysis of polling systems in heavy traffic , 1998, Advances in Applied Probability.

[23]  Onno Boxma,et al.  The single server queue : heavy tails and heavy traffic , 2000 .

[24]  Robert D. van der Mei,et al.  Polling Systems with Switch-over Times under Heavy Load: Moments of the Delay , 2000, Queueing Syst. Theory Appl..

[25]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[26]  Sem C. Borst,et al.  Polling Models With and Without Switchover Times , 1997, Oper. Res..

[27]  Christine Fricker,et al.  Monotonicity and stability of periodic polling models , 1994, Queueing Syst. Theory Appl..

[28]  Robert D. van der Mei,et al.  Polling systems in heavy traffic: Exhaustiveness of service policies , 1997, Queueing Syst. Theory Appl..

[29]  M. Eisenberg.  Two Queues with Alternating Service , 1979 .

[30]  Dirk P. Kroese.  HEAVY TRAFFIC ANALYSIS FOR CONTINUOUS POLLING MODELS , 1995 .