Circular window control schemes in fast packet switches

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 are also presented.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Computer Communications and Networks, ICCCN
EditorsKia Makki, Niki Pissinou
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages116-123
Number of pages8
Publication statusPublished - 1995
Externally publishedYes
EventProceedings of the 1995 4th International Conference on Computer Communications and Networks, ICCCN'95 - Las Vegas, NV, USA
Duration: Sep 20 1995Sep 23 1995

Other

OtherProceedings of the 1995 4th International Conference on Computer Communications and Networks, ICCCN'95
CityLas Vegas, NV, USA
Period9/20/959/23/95

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Lee, Y-H., Chow, R., & Cheung, S. E. (1995). Circular window control schemes in fast packet switches. In K. Makki, & N. Pissinou (Eds.), Proceedings of the International Conference on Computer Communications and Networks, ICCCN (pp. 116-123). Piscataway, NJ, United States: IEEE.