增强的迭代最长队列优先调度算法

Enhanced Iterative Longest Queue First Scheduling Algorithm

针对高速路由交换机的高性能要求,提出了一种复杂度低、具有适用性的增强迭代最长队列优先调度算法(EILQF).对于队列占用率较高的端口,EILQF将其赋予较高的优先权以保证调度算法在均匀和非均匀业务模式下均达到较高的性能;为了防止某些输入队列发生饥饿,EILQF在输入和输出端分别引入一个列表,并将信元等待时间信息融入调度算法中,保证等待时间超过一定限额的信元获得服务.理论分析证明了EILQF的稳定性,详细的仿真实验及与现有调度算法的对比证明了提出的EILQF具有更好的性能.

For performance requirements of high rate routing switch, a lower complexity and applicable enhanced iterative longest queue first scheduling algorithm called EILQF is proposed. For the port with higher utility list, EILQF assigns higher priority to guarantee better performance under uniform and non-uniform traffic. To avoid starvation for some input lists, EILQF employs an input list and output list and merges cell waiting time into scheduling algorithm to guarantee the over-waiting cell to get service. Theoretical analysis proves the stability of EILQF, and detailed simulation results and comparison with other algorithms prove that the proposed EILQF can obtain better performance.