Analysis of Polling System with Multiple Vacations and Using Exhaustive Service

In this paper we consider the polling system with multiple vacations using exhaustive service. By the imbedded Markov chain theory, the generating functions of queue length at the station is obtained. Then computational equations are explicitly determined for the mean queue length and the mean waiting time of information packet. Especially we obtain some corresponding results under some especial cases. The results are verified through extensive simulations.