Burst-based scheduling algorithms for non-blocking ATM switches with multiple input queues

This letter quantitatively evaluates two alternative approaches to the sche duling of traffic streams in a high-speed ATM switch with multiple input qu eues. Specifically, we compare a previously proposed algorithm, called it p arallel iterative matching (PIM)-which is a cell-based scheduling algorithm -with our newly proposed algorithm-which is a burst-based variation of the PIM scheduling algorithm. Extensive simulation results will demonstrate tha t burst-based PIM scheduling outperforms cell-based PIM scheduling under a variety of realistic parameters.