This paper analyzes the polling model with exhaustive service. By the imbedded Markov chain theory and the probability generating function method

the mean message waiting time and the parameter values are explicitly obtained. Finally

the simulation results are given. The results indicate that minor errors are introduced by the established system.