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

This letter quantitatively evaluates two alternative approaches to the scheduling of traffic streams in a high-speed ATM switch with multiple input queues. Specifically, we compare a previously proposed algorithm, called it parallel 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 that burst-based PIM scheduling outperforms cell-based PIM scheduling under a variety of realistic parameters.