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
Dans cet article, il est suggéré un commutateur ATM à file d'attente d'entrée bifurqué (ou multiple) dans lequel un tampon pour chaque port d'entrée est divisé en plusieurs (m) des blocs tampons, c'est-à-dire des tampons bifurqués, pour améliorer le débit limité du commutateur ordinaire en file d'attente d'entrée en utilisant une seule FIFO. En tant que règle de contention/arbitrage pour le schéma de commutation à file d'attente d'entrée bifurquée, des règles de contention libres et restreintes sont proposées et discutées. La règle libre permet à un port d'entrée de basculer jusqu'à m cellules au prix d’une accélération interne. Avec la règle restreinte, en revanche, un port d'entrée ne peut commuter plus d'une cellule dans un intervalle de temps afin que le commutateur fonctionne à la même vitesse que la vitesse de la liaison externe. Le débit lié au commutateur bifurqué en file d'attente d'entrée est analysé pour les deux règles grâce à la généralisation de l'analyse de Karol. et al. La limite de débit s'approche de 1.0 alors que m devient suffisamment important, quelle que soit la règle de contention/arbitrage.
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.
Copier
Hakyong KIM, Changhwan OH, Yongtak LEE, Kiseon KIM, "Throughput Analysis of the Bifurcated Input-Queued ATM Switch" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 5, pp. 768-772, May 1999, doi: .
Abstract: In this paper there suggested is a bifurcated (or multiple) input-queued ATM switch in which a buffer for each input port is divided into multiple (m) buffer blocks, i. e. , bifurcated buffers, for enhancement of the limited throughput of the ordinary input-queued switch using a single FIFO. As the contention/arbitration rule for the bifurcated input-queued switching scheme, free and restricted contention rules are come up with and discussed. The free rule allows an input port to switch up to m cells at the cost of internal speedup. With the restricted rule, on the other hand, an input port can switch no more than one cell in a time slot so that the switch operates at the same speed as the external link speed. The throughput bound for the bifurcated input-queued switch is analyzed for both rules through the generalization of the analysis by Karol et al. The throughput bound approaches to 1.0 as m becomes large enough, irrespective of the contention/arbitration rule.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_5_768/_p
Copier
@ARTICLE{e82-b_5_768,
author={Hakyong KIM, Changhwan OH, Yongtak LEE, Kiseon KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Throughput Analysis of the Bifurcated Input-Queued ATM Switch},
year={1999},
volume={E82-B},
number={5},
pages={768-772},
abstract={In this paper there suggested is a bifurcated (or multiple) input-queued ATM switch in which a buffer for each input port is divided into multiple (m) buffer blocks, i. e. , bifurcated buffers, for enhancement of the limited throughput of the ordinary input-queued switch using a single FIFO. As the contention/arbitration rule for the bifurcated input-queued switching scheme, free and restricted contention rules are come up with and discussed. The free rule allows an input port to switch up to m cells at the cost of internal speedup. With the restricted rule, on the other hand, an input port can switch no more than one cell in a time slot so that the switch operates at the same speed as the external link speed. The throughput bound for the bifurcated input-queued switch is analyzed for both rules through the generalization of the analysis by Karol et al. The throughput bound approaches to 1.0 as m becomes large enough, irrespective of the contention/arbitration rule.},
keywords={},
doi={},
ISSN={},
month={May},}
Copier
TY - JOUR
TI - Throughput Analysis of the Bifurcated Input-Queued ATM Switch
T2 - IEICE TRANSACTIONS on Communications
SP - 768
EP - 772
AU - Hakyong KIM
AU - Changhwan OH
AU - Yongtak LEE
AU - Kiseon KIM
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 1999
AB - In this paper there suggested is a bifurcated (or multiple) input-queued ATM switch in which a buffer for each input port is divided into multiple (m) buffer blocks, i. e. , bifurcated buffers, for enhancement of the limited throughput of the ordinary input-queued switch using a single FIFO. As the contention/arbitration rule for the bifurcated input-queued switching scheme, free and restricted contention rules are come up with and discussed. The free rule allows an input port to switch up to m cells at the cost of internal speedup. With the restricted rule, on the other hand, an input port can switch no more than one cell in a time slot so that the switch operates at the same speed as the external link speed. The throughput bound for the bifurcated input-queued switch is analyzed for both rules through the generalization of the analysis by Karol et al. The throughput bound approaches to 1.0 as m becomes large enough, irrespective of the contention/arbitration rule.
ER -