Carry-over round robin: a simple cell scheduling mechanism for ATM networks

Abstract

We propose a work-conserving scheduling mechanism for providing deterministic performance guarantees in ATM networks. The most attractive feature of the proposed mechanism, which we call Carry-Over Round Robin (CORR), is its simplicity. It is an extension of weighted round robin scheduling. We have derived closed form bounds for worst case end-to-end delay when CORR is used in conjunction with composite leaky bucket, and moving window regulators. Our results show that albeit its simplicity, CORR is very competitive with some of the more complex scheduling disciplines such as Packet-by-Packet Generalized Processor Sharing and Stop-and-Go queueing.