Research on Multiple Services Scheduling Based on Priority-Queuing Model

The fast-developing services in internet pose challenges to the efficient transmission of various types of data, so an effective packet scheduling scheme is needed to meet the Qos constraints of heterogeneous services. In this article, the priority-queuing model is used to study the performances of various strategies based on delay sensitivity and packets length. And the non-preemptive short-packet-first strategy is proved to result in the minimization of overall delay. With different strategies for delay-sensitive and non-delay-sensitive services, an optimal priority-queuing model for the scheduling of multiple internet services is proposed based on the above conclusions. The results of simulation experiments in NS-2 proved the superiority of the model. The results also demonstrated the features of packets queuing under different traffic scenarios and the law of variation for such performance indices as packet delivery ratio, throughput and average delay, which can be used to design effective measures for performance optimization.