Closed-form waiting time approximations for polling systems

A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focus on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes, performing well for all workloads. The approximations are constructed using heavy traffic limits and newly developed light traffic limits. The closed-form approximations may prove to be extremely useful for system design and optimisation in application areas as diverse as telecommunications, maintenance, manufacturing and transportation.

[1]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[2]  Dimitris Bertsimas,et al.  Decomposition results for general polling systems and their applications , 1999, Queueing Syst. Theory Appl..

[3]  Ward Whitt,et al.  An Interpolation Approximation for the Mean Workload in a GI/G/1 Queue , 1989, Oper. Res..

[4]  Jacques Resing,et al.  Polling systems and multitype branching processes , 1993, Queueing Syst. Theory Appl..

[5]  W. D. Ray,et al.  Stochastic Models: An Algorithmic Approach , 1995 .

[6]  Robert D. van der Mei,et al.  Polling systems with periodic server routing in heavy traffic: renewal arrivals , 2005, Oper. Res. Lett..

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

[8]  Carl M. Harris,et al.  An interpolation approximation for expected wait in a time-limited polling system , 2000, Comput. Oper. Res..

[9]  Seiya Kudoh,et al.  SECOND MOMENTS OF THE WAITING TIME IN SYMMETRIC POLLING SYSTEMS , 2000 .

[10]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

[11]  Martin I. Reiman,et al.  An Interpolation Approximation for Queueing Systems with Poisson Input , 1988, Oper. Res..

[12]  Philip J. Fleming,et al.  Interpolation Approximations of Sojourn Time Distributions , 1991, Oper. Res..

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

[14]  Erik M. M. Winands,et al.  On polling systems with large setups , 2007, Oper. Res. Lett..

[15]  Hideaki Takagi,et al.  Queuing analysis of polling models , 1988, CSUR.

[16]  Emm Erik Winands,et al.  Polling, production & priorities , 2007 .

[17]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[18]  V. M. Vishnevskii,et al.  Mathematical methods to study the polling systems , 2006 .

[19]  W. P. Groenendijk.  WAITING-TIME APPROXIMATIONS FOR CYCLIC-SERVICE SYSTEMS WITH MIXED SERVICE STRATEGIES , 1988 .

[20]  Burton Simon.  A Simple Relationship Between Light and Heavy Traffic Limits , 1992, Oper. Res..

[21]  Erik M. M. Winands,et al.  Branching-type polling systems with large setups , 2011, OR Spectr..

[22]  R. D. van der Mei,et al.  Polling Systems with Periodic Server Routeing in Heavy Traffic: Distribution of the Delay , 2003 .

[23]  Linus Schrage,et al.  The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..

[24]  David Everitt.  Simple Approximations for Token Rings , 1986, IEEE Trans. Commun..

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

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

[27]  Robert D. van der Mei,et al.  A note on polling models with renewal arrivals and nonzero switch-over times , 2008, Oper. Res. Lett..

[28]  Robert D. van der Mei,et al.  Optimization of Polling Systems with Bernoulli Schedules , 1995, Perform. Evaluation.

[29]  R. Luchsinger,et al.  Zentrale Hörstörungen mit Paramusie nach Contusio cerebri , 1947 .

[30]  T. Olsen.  LIMIT THEOREMS FOR POLLING MODELS WITH INCREASING SETUPS , 2001, Probability in the Engineering and Informational Sciences.