Module-level matching algorithms for MSM clos-network switches

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

Abstract

In this paper, we propose a simple modulelevel matching scheme for memory-space-memory Clos-network switches to avoid complex path-allocation algorithms in bufferless Clos networks, as well as cell out-of-order and saturation-tree problems in buffered Clos networks. We show that the modulelevel matching scheme can achieve 100% throughput.We propose static and dynamic dispatching cell schemes in addition to the module-level matching to improve the delay performance. The static cell dispatching scheme requires no additional scheduling; while the dynamic cell dispatching scheme is more adaptive to the traffic than the static one, thus can achieve better delay performance under non-uniform traffic loads. However, the wiring complexity of the scheduler for dynamic cell dispatching is high. Thus, the grouped dynamic cell dispatching scheme is proposed as a trade-off between the complexity and performance. In practice, embedded memory size is restricted, thus the queue length limitation in each switch module is also considered in this paper. We propose an efficient scheme to prevent queues to overflow in this situation which makes our work more practical.

Original languageEnglish (US)
Title of host publication2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012
Pages36-43
Number of pages8
DOIs
StatePublished - 2012
Event2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012 - Belgrade, Serbia
Duration: Jun 24 2012Jun 27 2012

Other

Other2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012
CountrySerbia
CityBelgrade
Period6/24/126/27/12

Fingerprint

Switches
Data storage equipment
Electric wiring
Scheduling
Throughput

Keywords

  • 100% throughput
  • Hybrid Algorithm
  • Module-Level Matching
  • Three-stage Clos-Network Switch

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Xia, Y., & Chao, H. J. (2012). Module-level matching algorithms for MSM clos-network switches. In 2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012 (pp. 36-43). [6260825] https://doi.org/10.1109/HPSR.2012.6260825

Module-level matching algorithms for MSM clos-network switches. / Xia, Yu; Chao, H. Jonathan.

2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012. 2012. p. 36-43 6260825.

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

Xia, Y & Chao, HJ 2012, Module-level matching algorithms for MSM clos-network switches. in 2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012., 6260825, pp. 36-43, 2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012, Belgrade, Serbia, 6/24/12. https://doi.org/10.1109/HPSR.2012.6260825
Xia Y, Chao HJ. Module-level matching algorithms for MSM clos-network switches. In 2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012. 2012. p. 36-43. 6260825 https://doi.org/10.1109/HPSR.2012.6260825
Xia, Yu ; Chao, H. Jonathan. / Module-level matching algorithms for MSM clos-network switches. 2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012. 2012. pp. 36-43
@inproceedings{d379cdff8cab4c8094990274956d4521,
title = "Module-level matching algorithms for MSM clos-network switches",
abstract = "In this paper, we propose a simple modulelevel matching scheme for memory-space-memory Clos-network switches to avoid complex path-allocation algorithms in bufferless Clos networks, as well as cell out-of-order and saturation-tree problems in buffered Clos networks. We show that the modulelevel matching scheme can achieve 100{\%} throughput.We propose static and dynamic dispatching cell schemes in addition to the module-level matching to improve the delay performance. The static cell dispatching scheme requires no additional scheduling; while the dynamic cell dispatching scheme is more adaptive to the traffic than the static one, thus can achieve better delay performance under non-uniform traffic loads. However, the wiring complexity of the scheduler for dynamic cell dispatching is high. Thus, the grouped dynamic cell dispatching scheme is proposed as a trade-off between the complexity and performance. In practice, embedded memory size is restricted, thus the queue length limitation in each switch module is also considered in this paper. We propose an efficient scheme to prevent queues to overflow in this situation which makes our work more practical.",
keywords = "100{\%} throughput, Hybrid Algorithm, Module-Level Matching, Three-stage Clos-Network Switch",
author = "Yu Xia and Chao, {H. Jonathan}",
year = "2012",
doi = "10.1109/HPSR.2012.6260825",
language = "English (US)",
isbn = "9781457708329",
pages = "36--43",
booktitle = "2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012",

}

TY - GEN

T1 - Module-level matching algorithms for MSM clos-network switches

AU - Xia, Yu

AU - Chao, H. Jonathan

PY - 2012

Y1 - 2012

N2 - In this paper, we propose a simple modulelevel matching scheme for memory-space-memory Clos-network switches to avoid complex path-allocation algorithms in bufferless Clos networks, as well as cell out-of-order and saturation-tree problems in buffered Clos networks. We show that the modulelevel matching scheme can achieve 100% throughput.We propose static and dynamic dispatching cell schemes in addition to the module-level matching to improve the delay performance. The static cell dispatching scheme requires no additional scheduling; while the dynamic cell dispatching scheme is more adaptive to the traffic than the static one, thus can achieve better delay performance under non-uniform traffic loads. However, the wiring complexity of the scheduler for dynamic cell dispatching is high. Thus, the grouped dynamic cell dispatching scheme is proposed as a trade-off between the complexity and performance. In practice, embedded memory size is restricted, thus the queue length limitation in each switch module is also considered in this paper. We propose an efficient scheme to prevent queues to overflow in this situation which makes our work more practical.

AB - In this paper, we propose a simple modulelevel matching scheme for memory-space-memory Clos-network switches to avoid complex path-allocation algorithms in bufferless Clos networks, as well as cell out-of-order and saturation-tree problems in buffered Clos networks. We show that the modulelevel matching scheme can achieve 100% throughput.We propose static and dynamic dispatching cell schemes in addition to the module-level matching to improve the delay performance. The static cell dispatching scheme requires no additional scheduling; while the dynamic cell dispatching scheme is more adaptive to the traffic than the static one, thus can achieve better delay performance under non-uniform traffic loads. However, the wiring complexity of the scheduler for dynamic cell dispatching is high. Thus, the grouped dynamic cell dispatching scheme is proposed as a trade-off between the complexity and performance. In practice, embedded memory size is restricted, thus the queue length limitation in each switch module is also considered in this paper. We propose an efficient scheme to prevent queues to overflow in this situation which makes our work more practical.

KW - 100% throughput

KW - Hybrid Algorithm

KW - Module-Level Matching

KW - Three-stage Clos-Network Switch

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

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

U2 - 10.1109/HPSR.2012.6260825

DO - 10.1109/HPSR.2012.6260825

M3 - Conference contribution

AN - SCOPUS:84866945162

SN - 9781457708329

SP - 36

EP - 43

BT - 2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012

ER -