Stable and Practical Scheduling Algorithms for High Speed Virtual Output Queuing Switches

  • Authors:
  • Jing Liu;Mounir Hamdi;Qingsheng Hu

  • Affiliations:
  • -;-;-

  • Venue:
  • ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

High-performance input queued switches achieve goodperformance with low cost. However, with the appearance ofoptical techniques, the line rate is much higher than before.Scheduling algorithms require not only good performance indelay and stability but fast speed and simple implementation aswell. A variety of scheduling algorithms for Virtual OutputQueuing (VOQ) packet switch architecture are proposed.Round-robin scheduling algorithms are fast and simple toimplement in hardware. In particular, a group of fullydesynchronized round-robin scheduling algorithms- SRR(static round robin matching), proposed recently, achieve prettygood delay performance while easy to implement. However,they are not stable under non-uniform traffic. Randomizedalgorithms are stable under any admissible traffic, howevertheir delay is high and hardware implementation is complex.Based on the concept of randomized algorithms and SRR, wepropose a group of new scheduling algorithms, DRDSRR, theimproved version of DRDSRR, ARDSRR and the variations ofARDSRR. They not only ensure stability but also have goodperformance and simple implementation. We have provedstability in the paper.