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
Seni bina baris gilir keluaran input gabungan (CIOQ) seperti palang dengan kelajuan baru-baru ini telah dicadangkan untuk membina suis kapasiti besar untuk rangkaian perkhidmatan bersepadu jalur lebar. Telah ditunjukkan bahawa, untuk faktor kelajuan 2, suis CIOQ boleh mencapai daya pemprosesan 100% dengan algoritma pemadanan maksimum yang ringkas. Mencapai 100% daya pengeluaran, bagaimanapun, tidak mencukupi untuk jaminan kualiti perkhidmatan (QoS) setiap sambungan. Dalam [2],[3], terbukti bahawa suis CIOQ dengan faktor kelajuan 2 boleh betul-betul meniru suis baris gilir keluaran (OQ) jika padanan stabil diterima pakai. Malangnya, kerumitan algoritma yang diketahui pada masa ini menjadikan padanan stabil tidak praktikal untuk suis berkelajuan tinggi. Dalam kertas kerja ini, kami mencadangkan algoritma padanan baharu yang dipanggil algoritma kusyen paling tidak didahulukan/paling mendesak dahulu (LCF/MUF) dan secara rasmi membuktikan bahawa suis CIOQ dengan faktor kelajuan 2 boleh betul-betul meniru suis OQ yang mengamalkan sebarang disiplin perkhidmatan untuk penghantaran sel. Potensi pelaksanaan algoritma padanan kami yang dicadangkan untuk disiplin perkhidmatan keutamaan yang ketat juga dibentangkan.
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
Tsern-Huei LEE, Yaw-Wen KUO, Jyh-Chiun HUANG, "Quality of Service Guarantee in a Combined Input Output Queued Switch" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 2, pp. 190-195, February 2000, doi: .
Abstract: Combined input output queued (CIOQ) architecture such as crossbar with speedup has recently been proposed to build a large capacity switch for broadband integrated services networks. It was shown that, for a speedup factor of 2, a CIOQ switch can achieve 100% throughput with a simple maximal matching algorithm. Achieving 100% throughput, however, is not sufficient for per-connection quality of service (QoS) guarantee. In [2],[3], it is proved that a CIOQ switch with a speedup factor of 2 can exactly emulate an output queued (OQ) switch if stable matching is adopted. Unfortunately, the complexity of currently known algorithms makes stable matching impractical for high-speed switches. In this paper, we propose a new matching algorithm called the least cushion first/most urgent first (LCF/MUF) algorithm and formally prove that a CIOQ switch with a speedup factor of 2 can exactly emulate an OQ switch which adopts any service discipline for cell transmission. A potential implementation of our proposed matching algorithm for strict priority service discipline is also presented.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_2_190/_p
Salinan
@ARTICLE{e83-b_2_190,
author={Tsern-Huei LEE, Yaw-Wen KUO, Jyh-Chiun HUANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Quality of Service Guarantee in a Combined Input Output Queued Switch},
year={2000},
volume={E83-B},
number={2},
pages={190-195},
abstract={Combined input output queued (CIOQ) architecture such as crossbar with speedup has recently been proposed to build a large capacity switch for broadband integrated services networks. It was shown that, for a speedup factor of 2, a CIOQ switch can achieve 100% throughput with a simple maximal matching algorithm. Achieving 100% throughput, however, is not sufficient for per-connection quality of service (QoS) guarantee. In [2],[3], it is proved that a CIOQ switch with a speedup factor of 2 can exactly emulate an output queued (OQ) switch if stable matching is adopted. Unfortunately, the complexity of currently known algorithms makes stable matching impractical for high-speed switches. In this paper, we propose a new matching algorithm called the least cushion first/most urgent first (LCF/MUF) algorithm and formally prove that a CIOQ switch with a speedup factor of 2 can exactly emulate an OQ switch which adopts any service discipline for cell transmission. A potential implementation of our proposed matching algorithm for strict priority service discipline is also presented.},
keywords={},
doi={},
ISSN={},
month={February},}
Salinan
TY - JOUR
TI - Quality of Service Guarantee in a Combined Input Output Queued Switch
T2 - IEICE TRANSACTIONS on Communications
SP - 190
EP - 195
AU - Tsern-Huei LEE
AU - Yaw-Wen KUO
AU - Jyh-Chiun HUANG
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2000
AB - Combined input output queued (CIOQ) architecture such as crossbar with speedup has recently been proposed to build a large capacity switch for broadband integrated services networks. It was shown that, for a speedup factor of 2, a CIOQ switch can achieve 100% throughput with a simple maximal matching algorithm. Achieving 100% throughput, however, is not sufficient for per-connection quality of service (QoS) guarantee. In [2],[3], it is proved that a CIOQ switch with a speedup factor of 2 can exactly emulate an output queued (OQ) switch if stable matching is adopted. Unfortunately, the complexity of currently known algorithms makes stable matching impractical for high-speed switches. In this paper, we propose a new matching algorithm called the least cushion first/most urgent first (LCF/MUF) algorithm and formally prove that a CIOQ switch with a speedup factor of 2 can exactly emulate an OQ switch which adopts any service discipline for cell transmission. A potential implementation of our proposed matching algorithm for strict priority service discipline is also presented.
ER -