PCRRD

A pipeline-based concurrent round-robin dispatching scheme for clos-network switches

Eiji Oki, Roberto Rojas-Cessa, H. Jonathan Chao

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

Abstract

This paper proposes a pipeline-based concurrent round-robin dispatching scheme, called PCRRD, for Clos-network switches. Our previously proposed concurrent round-robin dispatching (CRRD) scheme provides 100% throughput under uniform traffic by using simple round-robin arbiters, but it has the strict timing constraint that the dispatching scheduling has to be completed within one cell time slot. This is a bottleneck in building high-performance switching systems. To relax the strict timing constraint of CRRD, we propose to use more than one scheduler engine, up to P, so called subschedulers. Each subscheduler is allowed to take more than one time slot for dispatching. Every time slot, one out of P subschedulers provides the dispatching result. The subschedulers adopt our original CRRD algorithm. We show that PCRRD preserves 100% throughput under uniform traffic of our original CRRD algorithm, while ensuring the cell-sequence order. Since the constraint of the scheduling timing is dramatically relaxed, it is suitable for high-performance switching systems even when the switch size increases and a port speed is high (e.g., 40 Gbit/s).

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages2121-2125
Number of pages5
Volume4
StatePublished - 2002
Event2002 International Conference on Communications (ICC 2002) - New York, NY, United States
Duration: Apr 28 2002May 2 2002

Other

Other2002 International Conference on Communications (ICC 2002)
CountryUnited States
CityNew York, NY
Period4/28/025/2/02

Fingerprint

Switching systems
Pipelines
Scheduling
Switches
Throughput
Engines

Keywords

  • Arbitration
  • Clos-network switch
  • Dispatching
  • Packet switch
  • Pipeline
  • Throughput

ASJC Scopus subject areas

  • Media Technology

Cite this

Oki, E., Rojas-Cessa, R., & Chao, H. J. (2002). PCRRD: A pipeline-based concurrent round-robin dispatching scheme for clos-network switches. In IEEE International Conference on Communications (Vol. 4, pp. 2121-2125)

PCRRD : A pipeline-based concurrent round-robin dispatching scheme for clos-network switches. / Oki, Eiji; Rojas-Cessa, Roberto; Chao, H. Jonathan.

IEEE International Conference on Communications. Vol. 4 2002. p. 2121-2125.

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

Oki, E, Rojas-Cessa, R & Chao, HJ 2002, PCRRD: A pipeline-based concurrent round-robin dispatching scheme for clos-network switches. in IEEE International Conference on Communications. vol. 4, pp. 2121-2125, 2002 International Conference on Communications (ICC 2002), New York, NY, United States, 4/28/02.
Oki E, Rojas-Cessa R, Chao HJ. PCRRD: A pipeline-based concurrent round-robin dispatching scheme for clos-network switches. In IEEE International Conference on Communications. Vol. 4. 2002. p. 2121-2125
Oki, Eiji ; Rojas-Cessa, Roberto ; Chao, H. Jonathan. / PCRRD : A pipeline-based concurrent round-robin dispatching scheme for clos-network switches. IEEE International Conference on Communications. Vol. 4 2002. pp. 2121-2125
@inproceedings{bc8b0ba9149744e28aaf840815cd1be8,
title = "PCRRD: A pipeline-based concurrent round-robin dispatching scheme for clos-network switches",
abstract = "This paper proposes a pipeline-based concurrent round-robin dispatching scheme, called PCRRD, for Clos-network switches. Our previously proposed concurrent round-robin dispatching (CRRD) scheme provides 100{\%} throughput under uniform traffic by using simple round-robin arbiters, but it has the strict timing constraint that the dispatching scheduling has to be completed within one cell time slot. This is a bottleneck in building high-performance switching systems. To relax the strict timing constraint of CRRD, we propose to use more than one scheduler engine, up to P, so called subschedulers. Each subscheduler is allowed to take more than one time slot for dispatching. Every time slot, one out of P subschedulers provides the dispatching result. The subschedulers adopt our original CRRD algorithm. We show that PCRRD preserves 100{\%} throughput under uniform traffic of our original CRRD algorithm, while ensuring the cell-sequence order. Since the constraint of the scheduling timing is dramatically relaxed, it is suitable for high-performance switching systems even when the switch size increases and a port speed is high (e.g., 40 Gbit/s).",
keywords = "Arbitration, Clos-network switch, Dispatching, Packet switch, Pipeline, Throughput",
author = "Eiji Oki and Roberto Rojas-Cessa and Chao, {H. Jonathan}",
year = "2002",
language = "English (US)",
volume = "4",
pages = "2121--2125",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - PCRRD

T2 - A pipeline-based concurrent round-robin dispatching scheme for clos-network switches

AU - Oki, Eiji

AU - Rojas-Cessa, Roberto

AU - Chao, H. Jonathan

PY - 2002

Y1 - 2002

N2 - This paper proposes a pipeline-based concurrent round-robin dispatching scheme, called PCRRD, for Clos-network switches. Our previously proposed concurrent round-robin dispatching (CRRD) scheme provides 100% throughput under uniform traffic by using simple round-robin arbiters, but it has the strict timing constraint that the dispatching scheduling has to be completed within one cell time slot. This is a bottleneck in building high-performance switching systems. To relax the strict timing constraint of CRRD, we propose to use more than one scheduler engine, up to P, so called subschedulers. Each subscheduler is allowed to take more than one time slot for dispatching. Every time slot, one out of P subschedulers provides the dispatching result. The subschedulers adopt our original CRRD algorithm. We show that PCRRD preserves 100% throughput under uniform traffic of our original CRRD algorithm, while ensuring the cell-sequence order. Since the constraint of the scheduling timing is dramatically relaxed, it is suitable for high-performance switching systems even when the switch size increases and a port speed is high (e.g., 40 Gbit/s).

AB - This paper proposes a pipeline-based concurrent round-robin dispatching scheme, called PCRRD, for Clos-network switches. Our previously proposed concurrent round-robin dispatching (CRRD) scheme provides 100% throughput under uniform traffic by using simple round-robin arbiters, but it has the strict timing constraint that the dispatching scheduling has to be completed within one cell time slot. This is a bottleneck in building high-performance switching systems. To relax the strict timing constraint of CRRD, we propose to use more than one scheduler engine, up to P, so called subschedulers. Each subscheduler is allowed to take more than one time slot for dispatching. Every time slot, one out of P subschedulers provides the dispatching result. The subschedulers adopt our original CRRD algorithm. We show that PCRRD preserves 100% throughput under uniform traffic of our original CRRD algorithm, while ensuring the cell-sequence order. Since the constraint of the scheduling timing is dramatically relaxed, it is suitable for high-performance switching systems even when the switch size increases and a port speed is high (e.g., 40 Gbit/s).

KW - Arbitration

KW - Clos-network switch

KW - Dispatching

KW - Packet switch

KW - Pipeline

KW - Throughput

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

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

M3 - Conference contribution

VL - 4

SP - 2121

EP - 2125

BT - IEEE International Conference on Communications

ER -