A Simple Cell Scheduling Mechanism for ATM Networks

Abstract

Carry-Over Round Robin (CORR) is a simple mechanism for scheduling cells in asynchronous transfer mode networks. It is competitive with much more complex scheduling disciplines in terms of performance, especially in operational simplicity. However, CORR makes some extra design to maintain a maximum frame size, which leads to an unfair allocation of bandwidth and increases complexity of operations. In this paper, we propose a modified scheme to simplify CORR. We pro- vide a mathematical analysis and show that this scheme achieves better performance than CORR.