Analysis and optimization of polling systems

The basic polling system is a system of multiple queues, attended to by a single server in a cyclic order. Polling systems arise naturally in the modelling of many communication, computer and production networks where several users compete for access to a common resource. Such applications also give rise to several variants of the basic polling system, like periodic polling; here the server visits the queues in a fixed order specified by a polling table in which each queue occurs at least once. The theory of polling systems is going through a period of feverish activity. The purpose of this paper is to stimulate the discussion on what are the really important problems, both from a theoretical and an applied pOint of view. It is argued that optimization of polling systems is one of those problems. Part of the paper is devoted to the analysis of a polling optimization problem, viz., the determination of that polling table in a periodic polling model that minimizes a certain weighted sum of the mean waiting times.

[1]  Onno J. Boxma,et al.  A pseudoconservation law for service systems with a polling table , 1990, IEEE Trans. Commun..

[2]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[3]  Uri Yechiali,et al.  Dynamic scheduling in single‐server multiclass service systems with unit buffers , 1991 .

[4]  Edward G. Coffman,et al.  The gated infinite-server queue: uniform service times , 1992 .

[5]  J.P.C. Blanc.  The power-series algorithm applied to cyclic polling systems , 1990 .

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

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

[8]  Paul E. Wright,et al.  GATED, EXHAUSTIVE, PARALLEL SERVICE , 1992 .

[9]  Onno J. Boxma,et al.  Waiting-Time Approximations for Cyclic-Service Systems with Switchover Times , 1987, Perform. Evaluation.

[10]  Hanoch Levy,et al.  Optimization of Polling Systems , 1990, International Symposium on Computer Modeling, Measurement and Evaluation.

[11]  Kym Watson,et al.  Performance Evaluation of Cyclic Service Strategies - A Survey , 1984, International Symposium on Computer Modeling, Measurement and Evaluation.

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

[13]  Hideaki Takagi,et al.  Application of Polling Models to Computer Networks , 1991, Comput. Networks ISDN Syst..

[14]  O J Boxma,et al.  Models of two queues—a few new views , 1986 .

[15]  Chatschik Bisdikian.  A Queueing Model with Applications to Bridges and the DQDB (IEEE 802.6) MAN , 1993, Comput. Networks ISDN Syst..

[16]  Joseph B. Kruskal.  Work-scheduling algorithms: A nonprobabilistic queuing study (with possible application to no. 1 ESS) , 1969 .

[17]  Moshe Zukerman,et al.  A Discrete Shared Processor Model for DQDB , 1990, Comput. Networks ISDN Syst..

[18]  Hanoch Levy,et al.  Efficient Visit Orders for Polling Systems , 1993, Perform. Evaluation.

[19]  Oj Onno Boxma,et al.  Teletraffic Analysis and Computer Performance Evaluation , 1988 .

[20]  Michael J. Ferguson,et al.  Exact Results for Nonsymmetric Token Ring Systems , 1985, IEEE Trans. Commun..

[21]  Hanoch Levy,et al.  Efficient visit frequencies for polling tables: minimization of waiting cost , 1991, Queueing Syst. Theory Appl..

[22]  Edward G. Coffman,et al.  Two Queues with Alternating Service Periods , 1987, Performance.

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

[24]  J. P. C. Blanc.  A numerical approach to cyclic-service queueing models , 1990, Queueing Syst. Theory Appl..

[25]  Hanoch Levy,et al.  Cyclic reservation schemes for efficient operation of multiple-queue single-server systems , 1992, Ann. Oper. Res..

[26]  Onno J. Boxma,et al.  Waiting-time approximations for cyclic-service systems with switch-over times , 1986, SIGMETRICS '86/PERFORMANCE '86.

[27]  Mehdi Nassehi,et al.  CRMA: an access scheme for high-speed LANs and MANs , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

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

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