Performance analysis and comparison of a priority-based polling model

Based on polling scheme with the unique characteristics of contention-free of access, the paper applies embedded Markov chain and iterative method to analyze the priority-based polling model which consists of the key queue and ordinary queues with exhaustive service, elicit the closed-form expressions of mean queue length and mean waiting time. By the theoretical and simulation analysis of the performance of the priority-based polling model, the paper compares the performances of the priority-based polling model with another priority-based polling model which uses mixed service policy, and gives the numerical results of comparisons of mean queue length and mean waiting time, and discusses the different application of the two priority-based polling models.