The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kebolehskalaan suis paket rangkaian Clos tiga peringkat menjadikannya pendekatan yang menarik dalam melaksanakan suis paket bersaiz besar. Walau bagaimanapun, masa konfigurasi suis rangkaian Clos bergantung pada kedua-dua strategi penimbalan yang digunakan dan proses konfigurasi yang diterima pakai. Untuk mengurangkan masa konfigurasi, kertas kerja ini memfokuskan pada apa yang dipanggil suis paket Rangkaian Memori-Ruang-Memori (MSM), di mana modul suis pada peringkat pertama dan ketiga menggunakan memori untuk menyokong resolusi pertikaian port output. Konfigurasi suis ini kemudiannya berdasarkan proses untuk menghantar sel daripada modul peringkat pertama ke modul peringkat ketiga. Oleh itu, daya pemprosesan suis rangkaian Clos MSM bergantung pada skema penghantaran yang digunakan. Kertas kerja ini memperkenalkan skim penghantaran sel, dipanggil skim penghantaran padanan berat maksimum (MWMD), untuk suis rangkaian Clos MSM dan struktur baris gilir permintaan dalam modul peringkat pertama. Skim MWMD melakukan pemadanan berat maksimum, sama seperti yang digunakan untuk suis paket peringkat satu baris gilir input, yang digabungkan dengan baris gilir permintaan boleh mencapai 100% pemprosesan di bawah trafik bebas dan sama yang boleh diterima. Daya pengeluaran yang tinggi ini boleh dicapai tanpa memperuntukkan penimbal pada peringkat kedua dan tanpa mengembangkan peringkat kedua suis paket tiga peringkat ini. Skim penghantaran kerumitan rendah, skim penghantaran padanan pertama sel tertua (MOMD) maksimum, juga diperkenalkan sebagai alternatif kepada MWMD. Penilaian prestasi dalam kertas kerja ini menunjukkan bahawa MOMD mencapai daya pengeluaran yang tinggi di bawah trafik tidak seimbang melalui pelaksanaan bilangan lelaran yang terhad.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Roberto ROJAS-CESSA, Eiji OKI, H. Jonathan CHAO, "Maximum and Maximal Weight Matching Dispatching Schemes for MSM Clos-Network Packet Switches" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 2, pp. 297-304, February 2010, doi: 10.1587/transcom.E93.B.297.
Abstract: The scalability of three-stage Clos-network packet switches makes them an attractive approach in implementing large-size packet switches. However, the configuration time of Clos-network switches depends on both the buffering strategy used and the adopted configuration process. To reduce configuration time, this paper focuses on the so-called Memory-Space-Memory (MSM) Clos-network packet switch, where the switch modules in the first and third stages use memory to support resolution of output port contention. The configuration of these switches is then based on a process to dispatch cells from the first-stage modules to the third-stage modules. Therefore, the throughput of an MSM Clos-network switch depends on the dispatching scheme used. This paper introduces a cell dispatching scheme, called maximum weight matching dispatching (MWMD) scheme, for MSM Clos-network switches and a request queue structure in the first-stage modules. The MWMD scheme performs maximum weight matching, similar to that used for input-queued single-stage packet switches, that in combination with the request queues can achieve 100% throughput under independent and identical admissible traffic. This high throughput can be achieved without allocating buffers in the second stage and without expanding the second stage of this three-stage packet switch. A low-complexity dispatching scheme, the maximal oldest-cell-first matching dispatching (MOMD) scheme, is also introduced as an alternative to MWMD. The performance evaluation in this paper shows that MOMD achieves high throughput under unbalanced traffic through the execution of a finite number of iterations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.297/_p
Salinan
@ARTICLE{e93-b_2_297,
author={Roberto ROJAS-CESSA, Eiji OKI, H. Jonathan CHAO, },
journal={IEICE TRANSACTIONS on Communications},
title={Maximum and Maximal Weight Matching Dispatching Schemes for MSM Clos-Network Packet Switches},
year={2010},
volume={E93-B},
number={2},
pages={297-304},
abstract={The scalability of three-stage Clos-network packet switches makes them an attractive approach in implementing large-size packet switches. However, the configuration time of Clos-network switches depends on both the buffering strategy used and the adopted configuration process. To reduce configuration time, this paper focuses on the so-called Memory-Space-Memory (MSM) Clos-network packet switch, where the switch modules in the first and third stages use memory to support resolution of output port contention. The configuration of these switches is then based on a process to dispatch cells from the first-stage modules to the third-stage modules. Therefore, the throughput of an MSM Clos-network switch depends on the dispatching scheme used. This paper introduces a cell dispatching scheme, called maximum weight matching dispatching (MWMD) scheme, for MSM Clos-network switches and a request queue structure in the first-stage modules. The MWMD scheme performs maximum weight matching, similar to that used for input-queued single-stage packet switches, that in combination with the request queues can achieve 100% throughput under independent and identical admissible traffic. This high throughput can be achieved without allocating buffers in the second stage and without expanding the second stage of this three-stage packet switch. A low-complexity dispatching scheme, the maximal oldest-cell-first matching dispatching (MOMD) scheme, is also introduced as an alternative to MWMD. The performance evaluation in this paper shows that MOMD achieves high throughput under unbalanced traffic through the execution of a finite number of iterations.},
keywords={},
doi={10.1587/transcom.E93.B.297},
ISSN={1745-1345},
month={February},}
Salinan
TY - JOUR
TI - Maximum and Maximal Weight Matching Dispatching Schemes for MSM Clos-Network Packet Switches
T2 - IEICE TRANSACTIONS on Communications
SP - 297
EP - 304
AU - Roberto ROJAS-CESSA
AU - Eiji OKI
AU - H. Jonathan CHAO
PY - 2010
DO - 10.1587/transcom.E93.B.297
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2010
AB - The scalability of three-stage Clos-network packet switches makes them an attractive approach in implementing large-size packet switches. However, the configuration time of Clos-network switches depends on both the buffering strategy used and the adopted configuration process. To reduce configuration time, this paper focuses on the so-called Memory-Space-Memory (MSM) Clos-network packet switch, where the switch modules in the first and third stages use memory to support resolution of output port contention. The configuration of these switches is then based on a process to dispatch cells from the first-stage modules to the third-stage modules. Therefore, the throughput of an MSM Clos-network switch depends on the dispatching scheme used. This paper introduces a cell dispatching scheme, called maximum weight matching dispatching (MWMD) scheme, for MSM Clos-network switches and a request queue structure in the first-stage modules. The MWMD scheme performs maximum weight matching, similar to that used for input-queued single-stage packet switches, that in combination with the request queues can achieve 100% throughput under independent and identical admissible traffic. This high throughput can be achieved without allocating buffers in the second stage and without expanding the second stage of this three-stage packet switch. A low-complexity dispatching scheme, the maximal oldest-cell-first matching dispatching (MOMD) scheme, is also introduced as an alternative to MWMD. The performance evaluation in this paper shows that MOMD achieves high throughput under unbalanced traffic through the execution of a finite number of iterations.
ER -