Shortest Queue Time-Slot Adapting Algorithm Based on Average Reaching Times

Input-queued scheduling algorithms are designed to improve the throughput which use the input and output terminal in the router to obtain the maximum packets. And the length of the input queue is an important target, that can decides the superiority-inferiority about the capability of the input algorithm. With the existing algorithms, the main content about the scheduling algorithm are ensuring the packets´ high priority and low level. But most of these algorithms do not consider the length of queue. In this paper, we consider the change of queue length when the packets enter the input channel at the router, and put forward a shortest queue time-slot adapting algorithm (SQTA algorithm). First of all, SQTA algorithm can base the changes of transmittion time to control the packets´ sending time interval, and this action can make SQTA algorithm match the processing power about the router, and at the same time, this algorithm can reduce the length of the packets queue. Second, SQTA algorithm can control of a phenomenon that the packets may overflow when the length of queue is full, and that also make the packets transmitted more stable in network. The experimental result shows that this scheduling algorithm can control the length of queue effectively and reduce the waiting time with packets queue, It can be shorten the remaining service time, and can improve the network operation obviously.