This paper considers a novel polling system with two classes of message which can experience an up-per bounded time before being served. The station serves these two classes with mixed service discipline, one class wi...This paper considers a novel polling system with two classes of message which can experience an up-per bounded time before being served. The station serves these two classes with mixed service discipline, one class with exhaustive service discipline, and the other with gated service discipline. Using iterative method, we have developed an approximation method to obtain the mean waiting time for each message class. The performance of approximation has been compared with the simulation results. The expression for the upper bound of waiting time is given too.展开更多
基金Supported by the High Technology Research and Development Program of China（2002AA412010-08） and the National Natural Science Foundation of China（60474031）.
文摘This paper considers a novel polling system with two classes of message which can experience an up-per bounded time before being served. The station serves these two classes with mixed service discipline, one class with exhaustive service discipline, and the other with gated service discipline. Using iterative method, we have developed an approximation method to obtain the mean waiting time for each message class. The performance of approximation has been compared with the simulation results. The expression for the upper bound of waiting time is given too.
