Approximation for finite Capacity Multiqueu Systems

In performance investigations of token ring local area networks, switching systems with distributed control etc., the class of polling models, i.e. multiqueue systems with cyclic service is often employed. In this paper, an approximate analysis method for this class of models will be presented, whereby realistic modelling assumptions like the finiteness of queue capacities and nonsymmetrical load conditions are taken into account. The method of imbedded Markov chain is used for the analysis, whereby the special case of Markovian as well as the case of general service time are successively considered. The latter case is analyzed in conjunction with a moment matching approach for the cycle time. The approximation accuracy is validated by means of computer simulations. Numerical results are shown in order to illustrate the accuracy of the calculation method and its dependency on system parameters.