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 language | English (US) |
|---|---|
| Title of host publication | Proceedings of the International Conference on Computer Communications and Networks, ICCCN |
| Editors | Kia Makki, Niki Pissinou |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | IEEE |
| Pages | 116-123 |
| Number of pages | 8 |
| State | Published - 1995 |
| Externally published | Yes |
| Event | Proceedings of the 1995 4th International Conference on Computer Communications and Networks, ICCCN'95 - Las Vegas, NV, USA Duration: Sep 20 1995 → Sep 23 1995 |
Other
| Other | Proceedings of the 1995 4th International Conference on Computer Communications and Networks, ICCCN'95 |
|---|---|
| City | Las Vegas, NV, USA |
| Period | 9/20/95 → 9/23/95 |
ASJC Scopus subject areas
- General Computer Science
Fingerprint
Dive into the research topics of 'Circular window control schemes in fast packet switches'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS