A Scheduling Algorithm for Bursty Traffic Based on Input Queue Switch
Li Qiu · Communications technology · 2008
In order to improve the rate and reliability of communication,high speed routers and switches have adopted crossbar-based switch configurations and various scheduling algorithms.In this paper,the iSLIP algorithm for centralized scheduling,but its performence decline rapidly when the bursty or ununiform traffic comes,so we bring forward a new scheduling algorithm called lp_iSLIP(Long Queues Priority iSLIP).This algorithm bings a better performance than iSLIP when the bursty traffic comes,and similary performance with the uniform traffic.It doesn’t increase the complexity in hardware realization.