Performance evaluation of polling scheme with different priority service

Abstract

The main contribution of this paper is evaluation of polling scheme with different priority service, which consists of a hub station and N common stations. We consider the polling schemes which use the proposed mechanism with exhaustive + limited service (mixed I service) as well as exhaustive + gated service (mixed Π service) in discrete-time respectively. By the embedded Markov chain theory and the probability generating function methodology, we derive the characteristic parameters of both polling schemes. With the analytical results and computer simulations, their performances have been evaluated, and the concluding remarks are also presented.