Performance analysis of iterative scheduling algorithms for ATM input-queued switches

摘要

The performance of three iterative algorithms for input-queued ATM switches is studied. Mathematical models are proposed for throughput and cell delay analyses and compared to simulation results. The results show that the three algorithms have high throughputs and very low cell delays.