Concurrent round-robin dispatching scheme in a Clos-network switch

E. Oki, Z. Jing, R. Rojas-Cessa, H. Jonathan Chao

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

Abstract

A Clos-network switch architecture is attractive because of its scalability. Previously proposed implementable dispatching schemes from the first stage to the second stage, such as random dispatching, are not able to achieve a high throughput unless the internal bandwidth is expanded. This paper proposes a concurrent round-robin dispatching (CRRD) scheme for a Clos-network switch, to overcome the throughput limitation of the random dispatching scheme. The CRRD scheme provides high switch throughput without expanding internal bandwidth. CRRD implementation is very simple because only simple round-robin arbiters are adopted. In CRRD, the round-robin arbiters concurrently perform the matching between requesting cells and output links in each first-stage module to dispatch the cells to available second-stage modules. We show that CRRD achieves 100% throughput under uniform traffic. When the offered load reaches 1.0, the pointers of round-robin arbiters at the first-stage and second-stage modules are effectiv ely desynchronized and contention is avoided.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages107-111
Number of pages5
Volume1
StatePublished - 2001
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: Jun 11 2000Jun 14 2000

Other

OtherInternational Conference on Communications (ICC2001)
CountryFinland
CityHelsinki
Period6/11/006/14/00

Fingerprint

Switches
Throughput
Bandwidth
Scalability

Keywords

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

ASJC Scopus subject areas

  • Media Technology

Cite this

Oki, E., Jing, Z., Rojas-Cessa, R., & Chao, H. J. (2001). Concurrent round-robin dispatching scheme in a Clos-network switch. In IEEE International Conference on Communications (Vol. 1, pp. 107-111)

Concurrent round-robin dispatching scheme in a Clos-network switch. / Oki, E.; Jing, Z.; Rojas-Cessa, R.; Chao, H. Jonathan.

IEEE International Conference on Communications. Vol. 1 2001. p. 107-111.

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

Oki, E, Jing, Z, Rojas-Cessa, R & Chao, HJ 2001, Concurrent round-robin dispatching scheme in a Clos-network switch. in IEEE International Conference on Communications. vol. 1, pp. 107-111, International Conference on Communications (ICC2001), Helsinki, Finland, 6/11/00.
Oki E, Jing Z, Rojas-Cessa R, Chao HJ. Concurrent round-robin dispatching scheme in a Clos-network switch. In IEEE International Conference on Communications. Vol. 1. 2001. p. 107-111
Oki, E. ; Jing, Z. ; Rojas-Cessa, R. ; Chao, H. Jonathan. / Concurrent round-robin dispatching scheme in a Clos-network switch. IEEE International Conference on Communications. Vol. 1 2001. pp. 107-111
@inproceedings{5daa70463b044e7680313c48093cd8c0,
title = "Concurrent round-robin dispatching scheme in a Clos-network switch",
abstract = "A Clos-network switch architecture is attractive because of its scalability. Previously proposed implementable dispatching schemes from the first stage to the second stage, such as random dispatching, are not able to achieve a high throughput unless the internal bandwidth is expanded. This paper proposes a concurrent round-robin dispatching (CRRD) scheme for a Clos-network switch, to overcome the throughput limitation of the random dispatching scheme. The CRRD scheme provides high switch throughput without expanding internal bandwidth. CRRD implementation is very simple because only simple round-robin arbiters are adopted. In CRRD, the round-robin arbiters concurrently perform the matching between requesting cells and output links in each first-stage module to dispatch the cells to available second-stage modules. We show that CRRD achieves 100{\%} throughput under uniform traffic. When the offered load reaches 1.0, the pointers of round-robin arbiters at the first-stage and second-stage modules are effectiv ely desynchronized and contention is avoided.",
keywords = "Arbitration, Clos-network switch, Dispatching, Packet switch, Throughput",
author = "E. Oki and Z. Jing and R. Rojas-Cessa and Chao, {H. Jonathan}",
year = "2001",
language = "English (US)",
volume = "1",
pages = "107--111",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Concurrent round-robin dispatching scheme in a Clos-network switch

AU - Oki, E.

AU - Jing, Z.

AU - Rojas-Cessa, R.

AU - Chao, H. Jonathan

PY - 2001

Y1 - 2001

N2 - A Clos-network switch architecture is attractive because of its scalability. Previously proposed implementable dispatching schemes from the first stage to the second stage, such as random dispatching, are not able to achieve a high throughput unless the internal bandwidth is expanded. This paper proposes a concurrent round-robin dispatching (CRRD) scheme for a Clos-network switch, to overcome the throughput limitation of the random dispatching scheme. The CRRD scheme provides high switch throughput without expanding internal bandwidth. CRRD implementation is very simple because only simple round-robin arbiters are adopted. In CRRD, the round-robin arbiters concurrently perform the matching between requesting cells and output links in each first-stage module to dispatch the cells to available second-stage modules. We show that CRRD achieves 100% throughput under uniform traffic. When the offered load reaches 1.0, the pointers of round-robin arbiters at the first-stage and second-stage modules are effectiv ely desynchronized and contention is avoided.

AB - A Clos-network switch architecture is attractive because of its scalability. Previously proposed implementable dispatching schemes from the first stage to the second stage, such as random dispatching, are not able to achieve a high throughput unless the internal bandwidth is expanded. This paper proposes a concurrent round-robin dispatching (CRRD) scheme for a Clos-network switch, to overcome the throughput limitation of the random dispatching scheme. The CRRD scheme provides high switch throughput without expanding internal bandwidth. CRRD implementation is very simple because only simple round-robin arbiters are adopted. In CRRD, the round-robin arbiters concurrently perform the matching between requesting cells and output links in each first-stage module to dispatch the cells to available second-stage modules. We show that CRRD achieves 100% throughput under uniform traffic. When the offered load reaches 1.0, the pointers of round-robin arbiters at the first-stage and second-stage modules are effectiv ely desynchronized and contention is avoided.

KW - Arbitration

KW - Clos-network switch

KW - Dispatching

KW - Packet switch

KW - Throughput

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

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

M3 - Conference contribution

AN - SCOPUS:0034858407

VL - 1

SP - 107

EP - 111

BT - IEEE International Conference on Communications

ER -