Circular window control schemes in fast packet switches

Yann-Hang Lee, Randy Chow, Sandra E. Cheung

Research output: Contribution to journalArticle

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 1996
Externally publishedYes

Fingerprint

Switches
Scheduling algorithms
Throughput

Keywords

  • Circular window control
  • Packet switching
  • Scheduling

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Circular window control schemes in fast packet switches. / Lee, Yann-Hang; Chow, Randy; Cheung, Sandra E.

In: Computer Communications, Vol. 19, No. 8, 07.1996, p. 675-684.

Research output: Contribution to journalArticle

Lee, Yann-Hang ; Chow, Randy ; Cheung, Sandra E. / Circular window control schemes in fast packet switches. In: Computer Communications. 1996 ; Vol. 19, No. 8. pp. 675-684.
@article{f402515631c04c708417ddbe3c116328,
title = "Circular window control schemes in fast packet switches",
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.",
keywords = "Circular window control, Packet switching, Scheduling",
author = "Yann-Hang Lee and Randy Chow and Cheung, {Sandra E.}",
year = "1996",
month = "7",
doi = "10.1016/S0140-3664(96)01101-2",
language = "English (US)",
volume = "19",
pages = "675--684",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "8",

}

TY - JOUR

T1 - Circular window control schemes in fast packet switches

AU - Lee, Yann-Hang

AU - Chow, Randy

AU - Cheung, Sandra E.

PY - 1996/7

Y1 - 1996/7

N2 - 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.

AB - 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.

KW - Circular window control

KW - Packet switching

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=0030198129&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030198129&partnerID=8YFLogxK

U2 - 10.1016/S0140-3664(96)01101-2

DO - 10.1016/S0140-3664(96)01101-2

M3 - Article

AN - SCOPUS:0030198129

VL - 19

SP - 675

EP - 684

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 8

ER -