An improvement of weighted round robin cell scheduling in ATM networks

Weighted round robin (WRR) is a common cell scheduling method in ATM switches. In this paper, we study the delay performance of WRR cell scheduling and show that burstiness in input traffic is a major factor in performance degradation. We propose a new WRR scheme: WRR with save and borrow (WRR/SB), that helps improving delay characteristics in real-time traffic, and we provide an analysis of WRR and WRR/SB that describes their delay performance. We show that WRR/SB can provide an improved maximum delay bound over that of WRR alone.

[1]  Hiroshi Suzuki,et al.  A single-chip controller for 1.2 Gbps shared buffer ATM switches , 1997, Proceedings of CICC 97 - Custom Integrated Circuits Conference.

[2]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1998, TNET.

[3]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..