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.