A survey on queue scheduling algorithms in a router

Abstract

The use of scheduling algorithms is the key to bandwidth management in the field of network transmission. The quality of service guarantee of data streams needs to be combined with proper queue scheduling algorithms for the network QoS to be maximized. Fairness, delay performance and bandwidth utilization are the criteria for evaluating queue scheduling algorithms. The fairness and delay of the algorithm are the main reference indicators for the design of the scheduling algorithm, and the simplicity and scalability of the algorithm are guaranteed as much as possible based on the above two indicators, but the complexity of the algorithm is often contradictory to the delay and fairness, so it should be considered in an integrated manner to achieve the optimal design. In this paper, we comprehensively review the literature on this topic and propose classification criteria to present and qualitatively compare existing queue scheduling algorithms based on the above algorithm evaluation metrics.