Circular window control schemes in fast packet switches

  • Authors:

  • Affiliations:

  • Venue:
  • ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Abstract: In this paper, we investigate a scheduling algorithm, called circular window control (CWC) scheme, for packet switch fabrics. The scheme is simple and efficient. It uses a fixed length window with circular transmission sequences to minimize possible switch and output contentions. The scheme can attain a maximal throughput of 100%; in nonblocking switches as well as banyan-based blocking switches. The performance analyses and simulation results of the CWC scheme an also presented.