Polling systems: applications, modeling, and optimization

The cyclic polling model, its enhancement by customer routing, and the replacement of a fixed polling order by a random polling order are reviewed. Modeling of polling systems, performance improvement, and system optimization issues are discussed. Examples are given that include token rings, ARQ and time-sharing schemes, random-access protocols, robotics and manufacturing systems. Emphasis is not on the analytical derivations of polling systems but rather on the description of the capabilities and limitations of the different polling models. >

[1]  Isaac Meilijson,et al.  On optimal right-of-way policies at a single-server station when insertion of idle times is permitted , 1977 .

[2]  P. J. Kuehn,et al.  Multiqueue systems with nonexhaustive cyclic service , 1979, The Bell System Technical Journal.

[3]  Onno J. Boxma,et al.  Waiting Times in Polling Systems with Markovian Server Routing , 1989, MMB.

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

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

[6]  Izhak Rubin,et al.  Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks , 1983, IEEE J. Sel. Areas Commun..

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

[8]  Pierre A. Humblet,et al.  Source coding for communication concentrators , 1978 .

[9]  Xian Cheng,et al.  Approximate analysis of asymmetric single-service token-passing systems , 1989, IEEE Trans. Commun..

[10]  W. Bux.  Local-Area Subnetworks: A Performance Comparison , 1981, IEEE Trans. Commun..

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

[12]  Burton Simon.  Priority Queues with Feedback , 1984, JACM.

[13]  J. Walrand,et al.  The cμ rule revisited , 1985, Advances in Applied Probability.

[14]  Hideaki Takagi.  Mean Message Waiting Times in Symmetric Multi-Queue Systems with Cyclic Service , 1985, Perform. Evaluation.

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

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

[17]  Julian Keilson,et al.  Oscillating random walk models for GI / G /1 vacation systems with Bernoulli schedules , 1986 .

[18]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

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

[20]  S. W Fuhrmann,et al.  Symmetric queues served in cyclic order , 1985 .

[21]  Robert B. Cooper.  Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

[22]  E. Newhall,et al.  A Simplified Analysis of Scan Times in an Asymmetrical Newhall Loop with Exhaustive Service , 1977, IEEE Trans. Commun..

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

[24]  Steve W. Fuhrmann,et al.  Mean Waiting Time Approximations of Cyclic Service Systems with Limited Service , 1987, Performance.

[25]  W. P. Groenendijk.  A conservation-law based approximation algorithm for waiting times in polling systems , 1988 .

[26]  D. Sarkar,et al.  Expected waiting time for nonsymmetric cyclic queueing systems—exact results and applications , 1989 .

[27]  Hanoch Levy.  Delay Computation and Dynamic Behavior of Non-Symmetric Polling Systems , 1989, Perform. Evaluation.

[28]  Onno J. Boxma.  Two Symmmetric Queues with Alternating Service and Switching Times , 1984, Performance.

[29]  Izhak Rubin,et al.  Polling with a General-Service Order Table , 1987, IEEE Trans. Commun..

[30]  Leslie D. Servi.  Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules , 1986, IEEE J. Sel. Areas Commun..

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

[32]  Simon S. Lam.  Packet Broadcast Networks - A Performance Analysis of the R-ALOHA Protocol , 1980, IEEE Trans. Computers.

[33]  Tetsuya Takine,et al.  Performance Analysis of a Polling System with Single Buffers and Its Application to Interconnected Networks , 1986, IEEE J. Sel. Areas Commun..

[34]  Mandyam M. Srinivasan.  An Approximation for Mean Waiting Times in Cyclic Server Systems with Nonexhaustive Service , 1988, Perform. Evaluation.

[35]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

[36]  Leonard Kleinrock,et al.  The Analysis of Random Polling Systems , 1988, Oper. Res..

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

[38]  Bernd Meister,et al.  Waiting Lines and Times in a System with Polling , 1974, JACM.

[39]  Onno Boxma,et al.  Boundary value problems in queueing system analysis , 1983 .

[40]  G. Boyd Swartz.  Polling in a Loop System , 1980, JACM.

[41]  Martin Eisenberg,et al.  Queues with Periodic Service and Changeover Time , 1972, Oper. Res..

[42]  Tetsuya Takine,et al.  Exact analysis of asymmetric polling systems with single buffers , 1988, IEEE Trans. Commun..

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

[44]  Leslie D. Servi.  Capacity Estimation of Cyclic Queues , 1985, IEEE Trans. Commun..

[45]  Robert B. Cooper,et al.  Queues served in cyclic order , 1969 .

[46]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[47]  D. R. Manfield.  Analysis of a Priority Polling System for Two-Way Traffic , 1985, IEEE Trans. Commun..

[48]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[49]  Michael J. Ferguson.  Mean waiting time for a token ring with station dependent overheads , 1986 .

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

[51]  J. Baras,et al.  Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal , 1985, Advances in Applied Probability.

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

[53]  Kin K. Leung.  Waiting time distributions for token-passing systems with limited-one service via discrete Fourier transforms , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

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

[55]  Moshe Sidi,et al.  Structured priority queueing systems with applications to packet-radio networks , 1983, Perform. Evaluation.

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

[57]  Armand M. Makowski,et al.  K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal☆ , 1985 .