An efficient scheduling algorithm for input-queuing ATM switches
Bin Li, Mounir Hamdi, Xi‐Ren Cao · 2002
We propose and evaluate a three-phase scheduling algorithm for input-queuing ATM switches, and we term it the WRRLA algorithm. The WRRLA algorithm is an improvement over the conventional weighted round robin (WRR) algorithm by simply combining it together with the look ahead (LA) technique. In a WRRLA scheduling operation, the WRR algorithm is first applied to schedule the time-sensitive traffic in order to guarantee their quality of service, and then the LA technique is applied to schedule the data traffic in order to increase the throughput of the ATM switches. Simulation results show that the WRRLA algorithm achieves good performance in a simple architecture, less scheduling computation, higher efficiency (throughput) and lower delay bounds. Moreover, the WRRLA compares favorably with other famous scheduling algorithms, such as parallel iterative matching (PIM) and WRR.