Carry-Over Round Robin: A simple cell scheduling mechanism for ATM networks

We propose a simple mechanism named Carry-Over Round Robin (CORR) for sched uling cells in asynchronous transfer mode networks. We quantify the operati onal complexity of CORR scheduling and show that it is comparable to that o f a simple round-robin scheduler. We then show that, albeit its simplicity, CORR is very competitive with much more sophisticated and significantly mo re complex scheduling disciplines in terms of performance. We evaluate the performance of CORR using both analysis and simulation. We derive analytica l bounds on the worst case end-to-end delay achieved by a CORR scheduler fo r different traffic arrival patterns. Using traffic traces from MPEG video streams, we compare the delay performance of CORR with that of Packet-by-Pa cket Generalized Processor Sharing (PGPS) and Stop-and-Go (SG), Our results show that, in terms of delay performance, CORR compares favorably with bot h PGPS and SG, We also analyze the fairness properties of CORR and show tha t it achieves near perfect fairness.