Crossbar-based scheduling algorithm for burst traffic

For input-queued scheduling, the iSLIP (iterative SLIP) algorithm provides high throughput and is easily implemented. However, with burst arrivals, its average input latency increases dramatically and many cells may be dropped as the input buffer overflows. A scheduling algorithm called iTFF (iterative time to leave and full or not first) was developed to reduce the cell loss rate without increasing the average input latency, which has better performance than iSLIP with burst traffic conditions. Simulation results show that the iTFF algorithm exponentially reduces the cell loss rate and yet maintains low average input latency. Moreover, iTFF can be implemented in hardware to achieve high speed.