We propose a simple cell scheduling mechanism for
ATM networks. The proposed mechanism, named Carry-Over
Round Robin (CORR), is an extension of weighted round
robin scheduling. We show that albeit its simplicity, CORR
achieves tight bounds on end-to-end delay and near perfect
fairness. Using a variety of video traffic traces we
show that CORR often outperforms some of the more complex
scheduling disciplines such as Packet-by-Packet
Generalized Processor Sharing (PGPS).
(Also cross-referenced as UMIACS-TR-96-45