Circular window control schemes in fast packet switches

Yann Hang Lee, Randy Chow, Sandra E. Cheung

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we investigate a scheduling algorithm, called the 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 non-blocking switches as well as Banyan-based blocking switches. The performance analyses and simulation results of the CWC scheme are also presented.

Original languageEnglish (US)
Pages (from-to)675-684
Number of pages10
JournalComputer Communications
Volume19
Issue number8
DOIs
StatePublished - Jul 1 1996
Externally publishedYes

Keywords

  • Circular window control
  • Packet switching
  • Scheduling

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Circular window control schemes in fast packet switches'. Together they form a unique fingerprint.

Cite this