Quality of Service Guarantee in a Combined Input Output Queued Switch

Tsern-Huei LEE; Yaw-Wen KUO; Jyh-Chiun HUANG

Quality of Service Guarantee in a Combined Input Output Queued Switch

Tsern-Huei LEE, Yaw-Wen KUO, Jyh-Chiun HUANG

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E83-B No.2 pp.190-195

Publication Date: 2000/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (IEICE/IEEE Joint Special Issue on Recent Progress in ATM Technologies)

Category: ATM Switch and System Development

Cite this

Copy

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

Copy

@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},}

Copy

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 -