基于预测的最长队列优先调度算法

Prediction-based Longest Queue First Scheduling Algorithm

提出了一个基于预测的最长队列优先(PLQF)调度算法,该算法不仅考虑队列当前长度,还考虑了即将到来的流量信息,根据这一信息,资源被分配给最可能发生溢出的用户,通过预先调整队列长度以满足即将到来的流量,降低了丢包率(CLR),同时提高了缓存的利用率。理论分析表明,PLQF算法可以获得比传统LQF算法更低的CLR,仿真结果证实了PLQF算法的CLR只有传统LQF算法的10%～60%。

This paper proposes a Prediction-based Longest Queue First （PLQF） scheduling algorithm. The scheduler considers not only the queue length, but also the incoming traffic. Based on that information, the resource is allocated to the user with the highest probability of overflow. The scheduler can adjust the queue lengths in advance to cater for the incoming traffic, targeting to minimize CLR and improve the buffer utilization. Theoretical analysis shows that the PLQF algorithm can lead to a lower CLR than the conventional LQF algorithm. Simulation＇results show the PLQF algorithm can reduce CLR by 10%-60%.