Maximum weight matching dispatching scheme in buffered Clos-network packet switches

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

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

Abstract

The scalability of Clos-network switches make them an alternative to single-stages switches for implementing large-size packet switches. This paper introduces a cell dispatching scheme, called maximum weight matching dispatching (MWMD) scheme, for buffered Clos-network switches. The MWMD scheme is based on a maximum weight matching algorithm for input-buffered switches. This paper shows that, with request queues in the buffered Clos-network architecture, the MWMD scheme is able to achieve a 100% throughput for independent admissible traffic, without allocating any buffers in the second stage and without expanding the internal bandwidth. As a practical scheme, a maximal oldest-cell-first matching dispatching (MOMD) scheme is also introduced. MOMD shows that using a finite number of iterations in the dispatching scheme, the throughout under unbalanced traffic pattern can be high.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages1075-1079
Number of pages5
Volume2
StatePublished - 2004
Event2004 IEEE International Conference on Communications - Paris, France
Duration: Jun 20 2004Jun 24 2004

Other

Other2004 IEEE International Conference on Communications
CountryFrance
CityParis
Period6/20/046/24/04

Fingerprint

Packet networks
Switches
Network architecture
Scalability
Throughput
Bandwidth

Keywords

  • Clos-network
  • Dispatching
  • Maximum-weight matching
  • Packet switch
  • Throughput

ASJC Scopus subject areas

  • Media Technology

Cite this

Rojas-Cessa, R., Oki, E., & Chao, H. J. (2004). Maximum weight matching dispatching scheme in buffered Clos-network packet switches. In IEEE International Conference on Communications (Vol. 2, pp. 1075-1079)

Maximum weight matching dispatching scheme in buffered Clos-network packet switches. / Rojas-Cessa, Roberto; Oki, Eiji; Chao, H. Jonathan.

IEEE International Conference on Communications. Vol. 2 2004. p. 1075-1079.

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

Rojas-Cessa, R, Oki, E & Chao, HJ 2004, Maximum weight matching dispatching scheme in buffered Clos-network packet switches. in IEEE International Conference on Communications. vol. 2, pp. 1075-1079, 2004 IEEE International Conference on Communications, Paris, France, 6/20/04.
Rojas-Cessa R, Oki E, Chao HJ. Maximum weight matching dispatching scheme in buffered Clos-network packet switches. In IEEE International Conference on Communications. Vol. 2. 2004. p. 1075-1079
Rojas-Cessa, Roberto ; Oki, Eiji ; Chao, H. Jonathan. / Maximum weight matching dispatching scheme in buffered Clos-network packet switches. IEEE International Conference on Communications. Vol. 2 2004. pp. 1075-1079
@inproceedings{d64f70e1e32347e08780f55788ae726b,
title = "Maximum weight matching dispatching scheme in buffered Clos-network packet switches",
abstract = "The scalability of Clos-network switches make them an alternative to single-stages switches for implementing large-size packet switches. This paper introduces a cell dispatching scheme, called maximum weight matching dispatching (MWMD) scheme, for buffered Clos-network switches. The MWMD scheme is based on a maximum weight matching algorithm for input-buffered switches. This paper shows that, with request queues in the buffered Clos-network architecture, the MWMD scheme is able to achieve a 100{\%} throughput for independent admissible traffic, without allocating any buffers in the second stage and without expanding the internal bandwidth. As a practical scheme, a maximal oldest-cell-first matching dispatching (MOMD) scheme is also introduced. MOMD shows that using a finite number of iterations in the dispatching scheme, the throughout under unbalanced traffic pattern can be high.",
keywords = "Clos-network, Dispatching, Maximum-weight matching, Packet switch, Throughput",
author = "Roberto Rojas-Cessa and Eiji Oki and Chao, {H. Jonathan}",
year = "2004",
language = "English (US)",
volume = "2",
pages = "1075--1079",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Maximum weight matching dispatching scheme in buffered Clos-network packet switches

AU - Rojas-Cessa, Roberto

AU - Oki, Eiji

AU - Chao, H. Jonathan

PY - 2004

Y1 - 2004

N2 - The scalability of Clos-network switches make them an alternative to single-stages switches for implementing large-size packet switches. This paper introduces a cell dispatching scheme, called maximum weight matching dispatching (MWMD) scheme, for buffered Clos-network switches. The MWMD scheme is based on a maximum weight matching algorithm for input-buffered switches. This paper shows that, with request queues in the buffered Clos-network architecture, the MWMD scheme is able to achieve a 100% throughput for independent admissible traffic, without allocating any buffers in the second stage and without expanding the internal bandwidth. As a practical scheme, a maximal oldest-cell-first matching dispatching (MOMD) scheme is also introduced. MOMD shows that using a finite number of iterations in the dispatching scheme, the throughout under unbalanced traffic pattern can be high.

AB - The scalability of Clos-network switches make them an alternative to single-stages switches for implementing large-size packet switches. This paper introduces a cell dispatching scheme, called maximum weight matching dispatching (MWMD) scheme, for buffered Clos-network switches. The MWMD scheme is based on a maximum weight matching algorithm for input-buffered switches. This paper shows that, with request queues in the buffered Clos-network architecture, the MWMD scheme is able to achieve a 100% throughput for independent admissible traffic, without allocating any buffers in the second stage and without expanding the internal bandwidth. As a practical scheme, a maximal oldest-cell-first matching dispatching (MOMD) scheme is also introduced. MOMD shows that using a finite number of iterations in the dispatching scheme, the throughout under unbalanced traffic pattern can be high.

KW - Clos-network

KW - Dispatching

KW - Maximum-weight matching

KW - Packet switch

KW - Throughput

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

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

M3 - Conference contribution

VL - 2

SP - 1075

EP - 1079

BT - IEEE International Conference on Communications

ER -