Circular window control schemes in fast packet switches

Authors:
Yann-Hang Lee;Randy Chow;Sandra E. Cheung
Affiliations:
Department of Computer and Information Sciences, University of Florida, Gainesville, FL 32611, USA;Network Systems Engineering, Pacific Bell, San Ramon, CA 94583, USA;Network Systems Engineering, Pacific Bell, San Ramon, CA 94583, USA
Venue:
Computer Communications
Year:
1996

Citing 6
Cited 0

Performance of Processor-Memory Interconnections for Multiprocessors

IEEE Transactions on Computers
Throughput analysis, optimal buffer allocation, and traffic imbalance study of a generic nonblocking packet switch

IEEE Journal on Selected Areas in Communications
The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching

IEEE Journal on Selected Areas in Communications
A Broadband Packet Switch for Integrated Transport

IEEE Journal on Selected Areas in Communications
Sunshine: a high performance self-routing broadband packet switch architecture

IEEE Journal on Selected Areas in Communications
Queueing in high-performance packet switching

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

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.