Maximum weight matching dispatching scheme in buffered Clos-network packet switches
Document Type
Conference Proceeding
Publication Date
1-1-2004
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.
Identifier
4143154113 (Scopus)
Publication Title
IEEE International Conference on Communications
External Full Text Location
https://doi.org/10.1109/icc.2004.1312666
ISSN
05361486
First Page
1075
Last Page
1079
Volume
2
Recommended Citation
Rojas-Cessa, Roberto; Oki, Eiji; and Chao, H. Jonathan, "Maximum weight matching dispatching scheme in buffered Clos-network packet switches" (2004). Faculty Publications. 20659.
https://digitalcommons.njit.edu/fac_pubs/20659
