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
입력 버퍼링 스위치는 메모리와 스위치 대역폭을 가장 효율적으로 사용합니다. VOQ(Virtual Output Queuing)를 사용하면 헤드 오브 라인 차단을 방지하여 58.6%의 처리량 장벽을 깨뜨릴 수 있습니다. 본 논문에서는 우선순위가 지정된 트래픽에 대해 결정론적 및 확률론적 지연 범위를 제공하는 VOQ 기반 스위치 아키텍처를 제안합니다. 이는 미리 계산된 일정과 실시간 계산을 통해 포트를 일치시키는 하이브리드 정적 및 동적 중재 체계를 통해 달성됩니다. 가중 동적 중재 알고리즘을 사용하면 허용되는 모든 트래픽에서 지연을 최소화하고 100% 처리량을 달성할 수 있습니다. 통합된 글로벌 우선순위 체계는 실시간 및 데이터 트래픽의 다중화를 허용합니다. 중재 결정에 따라 셀 스케줄러는 셀이 전달되는 다음 연결 시 입력 포트에서 로컬로 결정합니다. EDF(Early-Deadline-First)를 기반으로 하는 셀 스케줄링은 출력 대기열 스위치의 동작과 유사하게 수행되는 것으로 나타났습니다.
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.
부
Rainer SCHOENEN, "An Architecture Supporting Quality-of-Service in Virtual-Output-Queued Switches" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 2, pp. 171-181, February 2000, doi: .
Abstract: Input buffered switches most efficiently use memory and switch bandwidth. With Virtual Output Queueing (VOQ), head-of-line blocking can be avoided, thus breaking the throughput barrier of 58.6%. In this paper a switch architecture based on VOQ is proposed, which offers deterministic and stochastic delay bounds for prioritized traffic. This is achieved by a hybrid static and dynamic arbitration scheme, which matches ports both by a precalculated schedule and realtime calculations. By using weighted dynamic arbitration algorithms 100% throughput with lowest delays under all admissible traffic can be achieved. An integrated global priority scheme allows the multiplexing of realtime and data traffic. Following the arbitration decision, a cell scheduler decides locally in the input ports upon the next connection from which a cell is forwarded. Cell scheduling based on earliest-deadline-first (EDF) is shown to perform similar to its behaviour in an output-queued switch.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_2_171/_p
부
@ARTICLE{e83-b_2_171,
author={Rainer SCHOENEN, },
journal={IEICE TRANSACTIONS on Communications},
title={An Architecture Supporting Quality-of-Service in Virtual-Output-Queued Switches},
year={2000},
volume={E83-B},
number={2},
pages={171-181},
abstract={Input buffered switches most efficiently use memory and switch bandwidth. With Virtual Output Queueing (VOQ), head-of-line blocking can be avoided, thus breaking the throughput barrier of 58.6%. In this paper a switch architecture based on VOQ is proposed, which offers deterministic and stochastic delay bounds for prioritized traffic. This is achieved by a hybrid static and dynamic arbitration scheme, which matches ports both by a precalculated schedule and realtime calculations. By using weighted dynamic arbitration algorithms 100% throughput with lowest delays under all admissible traffic can be achieved. An integrated global priority scheme allows the multiplexing of realtime and data traffic. Following the arbitration decision, a cell scheduler decides locally in the input ports upon the next connection from which a cell is forwarded. Cell scheduling based on earliest-deadline-first (EDF) is shown to perform similar to its behaviour in an output-queued switch.},
keywords={},
doi={},
ISSN={},
month={February},}
부
TY - JOUR
TI - An Architecture Supporting Quality-of-Service in Virtual-Output-Queued Switches
T2 - IEICE TRANSACTIONS on Communications
SP - 171
EP - 181
AU - Rainer SCHOENEN
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2000
AB - Input buffered switches most efficiently use memory and switch bandwidth. With Virtual Output Queueing (VOQ), head-of-line blocking can be avoided, thus breaking the throughput barrier of 58.6%. In this paper a switch architecture based on VOQ is proposed, which offers deterministic and stochastic delay bounds for prioritized traffic. This is achieved by a hybrid static and dynamic arbitration scheme, which matches ports both by a precalculated schedule and realtime calculations. By using weighted dynamic arbitration algorithms 100% throughput with lowest delays under all admissible traffic can be achieved. An integrated global priority scheme allows the multiplexing of realtime and data traffic. Following the arbitration decision, a cell scheduler decides locally in the input ports upon the next connection from which a cell is forwarded. Cell scheduling based on earliest-deadline-first (EDF) is shown to perform similar to its behaviour in an output-queued switch.
ER -