Study of parallel schedules for polling systems with limited service

It is proposed a policy of parallel schedule for a polling system with limited service (K=1) in discrete time.The system enables simultaneous polling and transmissions of information packets.By the imbedded Markov chain theory and the generating function method,the mean values of queue length and information packet waiting time are explicitly obtained.The stabilities of polling systems are analyzed.Mathematical analysis and simulation results show that the parallel schedules are more efficient.