A Practical Large-Capacity Three-Stage Buffered Clos-Network Switch Architecture

Yu Xia, Mounir Hamdi, H. Jonathan Chao

Research output: Contribution to journalArticle

Abstract

This paper proposes a three-stage buffered Clos-network switch (TSBCS) architecture along with a novel batch scheduling (BS) mechanism. We found that TSBCS/BS can be mapped to a 'fat' combined input-crosspoint queued (CICQ) switch. Consequently, the well-studied CICQ scheduling algorithms can be directly applied in TSBCS. Moreover, BS drastically reduces the time complexity of TSBCS scheduling when compared with ordinary CICQ switches of the same number of switch ports, which enables us to build a larger-capacity switch with reasonable scheduling complexity. We further show that TSBCS/BS can achieve 100 percent throughput under any admissible traffic if a stable CICQ scheduling algorithm is used. Direct cell forwarding schemes are proposed to overcome the performance drawback of BS under light traffic loads. With extensive simulations, we show that the performance of TSBCS/BS is comparable to that of output-queued switches and the latter are usually considered as theoretical optimal.

Original languageEnglish (US)
Article number7054539
Pages (from-to)317-328
Number of pages12
JournalIEEE Transactions on Parallel and Distributed Systems
Volume27
Issue number2
DOIs
StatePublished - Feb 1 2016

Fingerprint

Switches
Scheduling
Scheduling algorithms
Oils and fats
Throughput

Keywords

  • batch scheduling
  • Clos network
  • distributed shared-memory
  • packet switch

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Computational Theory and Mathematics

Cite this

A Practical Large-Capacity Three-Stage Buffered Clos-Network Switch Architecture. / Xia, Yu; Hamdi, Mounir; Chao, H. Jonathan.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 27, No. 2, 7054539, 01.02.2016, p. 317-328.

Research output: Contribution to journalArticle

@article{230f5668596649ab8fc501f53705eaee,
title = "A Practical Large-Capacity Three-Stage Buffered Clos-Network Switch Architecture",
abstract = "This paper proposes a three-stage buffered Clos-network switch (TSBCS) architecture along with a novel batch scheduling (BS) mechanism. We found that TSBCS/BS can be mapped to a 'fat' combined input-crosspoint queued (CICQ) switch. Consequently, the well-studied CICQ scheduling algorithms can be directly applied in TSBCS. Moreover, BS drastically reduces the time complexity of TSBCS scheduling when compared with ordinary CICQ switches of the same number of switch ports, which enables us to build a larger-capacity switch with reasonable scheduling complexity. We further show that TSBCS/BS can achieve 100 percent throughput under any admissible traffic if a stable CICQ scheduling algorithm is used. Direct cell forwarding schemes are proposed to overcome the performance drawback of BS under light traffic loads. With extensive simulations, we show that the performance of TSBCS/BS is comparable to that of output-queued switches and the latter are usually considered as theoretical optimal.",
keywords = "batch scheduling, Clos network, distributed shared-memory, packet switch",
author = "Yu Xia and Mounir Hamdi and Chao, {H. Jonathan}",
year = "2016",
month = "2",
day = "1",
doi = "10.1109/TPDS.2015.2408614",
language = "English (US)",
volume = "27",
pages = "317--328",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - A Practical Large-Capacity Three-Stage Buffered Clos-Network Switch Architecture

AU - Xia, Yu

AU - Hamdi, Mounir

AU - Chao, H. Jonathan

PY - 2016/2/1

Y1 - 2016/2/1

N2 - This paper proposes a three-stage buffered Clos-network switch (TSBCS) architecture along with a novel batch scheduling (BS) mechanism. We found that TSBCS/BS can be mapped to a 'fat' combined input-crosspoint queued (CICQ) switch. Consequently, the well-studied CICQ scheduling algorithms can be directly applied in TSBCS. Moreover, BS drastically reduces the time complexity of TSBCS scheduling when compared with ordinary CICQ switches of the same number of switch ports, which enables us to build a larger-capacity switch with reasonable scheduling complexity. We further show that TSBCS/BS can achieve 100 percent throughput under any admissible traffic if a stable CICQ scheduling algorithm is used. Direct cell forwarding schemes are proposed to overcome the performance drawback of BS under light traffic loads. With extensive simulations, we show that the performance of TSBCS/BS is comparable to that of output-queued switches and the latter are usually considered as theoretical optimal.

AB - This paper proposes a three-stage buffered Clos-network switch (TSBCS) architecture along with a novel batch scheduling (BS) mechanism. We found that TSBCS/BS can be mapped to a 'fat' combined input-crosspoint queued (CICQ) switch. Consequently, the well-studied CICQ scheduling algorithms can be directly applied in TSBCS. Moreover, BS drastically reduces the time complexity of TSBCS scheduling when compared with ordinary CICQ switches of the same number of switch ports, which enables us to build a larger-capacity switch with reasonable scheduling complexity. We further show that TSBCS/BS can achieve 100 percent throughput under any admissible traffic if a stable CICQ scheduling algorithm is used. Direct cell forwarding schemes are proposed to overcome the performance drawback of BS under light traffic loads. With extensive simulations, we show that the performance of TSBCS/BS is comparable to that of output-queued switches and the latter are usually considered as theoretical optimal.

KW - batch scheduling

KW - Clos network

KW - distributed shared-memory

KW - packet switch

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

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

U2 - 10.1109/TPDS.2015.2408614

DO - 10.1109/TPDS.2015.2408614

M3 - Article

VL - 27

SP - 317

EP - 328

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 2

M1 - 7054539

ER -