Polling with a General Service Order Table: Gated Service

We have generalized the work reported in Ferguson and Aminetzah to get exact results (requiring the solution of a set of M-N linear equations and that of a set of M sup 2 linear equations) on the mean waiting time in a nonsymmetric polling system with general service order table and gated service. Analysis of such polling systems is essential in providing proper priority service to a variety of systems such as token ring Local Area Networks, a family of distributed processors served by a central processor, etc., and in the performance analysis of systems using star polling or SCAN type polling.