Performance Evaluation of Polling Systems by Means of the Power-Series Algorithm

摘要

A general description is given of the power-series algorithm for the performanceevaluation of multi-queue systems which can be modeled as multi-dimensional quasi-birth-death processes. The complexity of the algorithm when applied to polling systems, consisting of several stations where jobs are generated and a single server which attends to these stations by turns, is studied for various service disciplines. The algorithm is applied to a general class of polling systems with Poisson arrival streams, with Coxian service and switching time distributions, with infinite buffers, with a fixed periodic visit order, and with a Bernoulli schedule for each visit to a station.