Study on finite buffer queue scheduling with polling and reservation strategy

A finite buffer queue scheduling with polling and reservation strategy for the network node is designed. Because the delay sensitive service and the non-delay sensitive service need the different quality of service, they will gain the different services through scheduling transmission rate. A three-dimension Markov queue model is proposed to investigate the queue scheduling model in this paper. The queue is analyzed by using the linear level reduction algorithm and quasi birth and death process. The performance measures are derived including mean queue length, mean waiting time and blocking probability of delay sensitive service and the non-delay sensitive service, etc.