摘要
This paper analyzes a queue mode] of the polling system with limited service (K=1) in discrete time. By the imbedded Markov chain theory and the probability generating function method, the mean values of queue length and message waiting time are explicitly obtained. Also, we give the simulation results. The results obtained by H. Tagai (1985) are revised.
This paper analyzes a queue mode] of the polling system with limited service (K=1) in discrete time. By the imbedded Markov chain theory and the probability generating function method, the mean values of queue length and message waiting time are explicitly obtained. Also, we give the simulation results. The results obtained by H. Tagai (1985) are revised.
