Binomial-gated service: a method for effective operation and optimization of polling systems

The binomial-gated service, designed for cyclic polling systems, is proposed as a new service method. The important properties of this method are: (1) it allows one to prioritize the system queues using a set of priorities, and (2) it is mathematically analyzable. The method can be implemented in the token ring network and in many other communications systems. The nonsymmetric cyclic-polling system with binomial-gated service is analyzed and equation sets are derived from which the expected delay figures can be calculated numerically. A pseudoconservation law for nonsymmetric systems and a closed-form mean-delay expression for fully symmetric systems are derived as well. The effect of the priority parameters on the system performance is demonstrated in numerical examples. >

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

[2]  J.P.C. Blanc.  Cyclic polling systems : Limited service versus Bernoulli schedules , 1990 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[22]  Leonard Kleinrock,et al.  Polling Systems with Zero Switch-Over Periods: A General Method for Analyzing the Expected Delay , 1991, Perform. Evaluation.

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