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

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 the 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 generalised processor sharing and stop-and-go queueing.

[1]  Domenico Ferrari,et al.  Rate-controlled static-priority queueing , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[2]  S. Jamaloddin Golestani,et al.  Congestion-free communication in high-speed packet networks , 1991, IEEE Trans. Commun..

[3]  S. Jamaloddin Golestani,et al.  A Framing Strategy for Congestion Management , 1991, IEEE J. Sel. Areas Commun..

[4]  Henning Schulzrinne,et al.  Real-time communication in packet-switched networks , 1994, Proc. IEEE.

[5]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[6]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[7]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[8]  Debanjan Saha.  Supporting distributed multimedia applications on ATM networks , 1996 .

[9]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[10]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[11]  Satish K. Tripathi,et al.  Multi-rate traffic shaping and end-to-end performance guarantees in ATM networks , 1994, Proceedings of ICNP - 1994 International Conference on Network Protocols.

[12]  Satish K. Tripathi,et al.  Carry-over round robin: a simple cell scheduling mechanism for ATM networks , 1998, TNET.

[13]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[14]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.