Iterative Round-Robin Matching for Input and Output Buffered Switches
Summary :
We present iterative round-robin matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is altered in the suggested algorithm to enhance the switch performance. Simulation results under Bernoulli traffic show the suggested algorithm is more appropriate than iSLIP for cell scheduling of input and output buffered switches.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E84-B No.12 pp.3290-3294
- Publication Date
- 2001/12/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Switching
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Man-Soo HAN, "Iterative Round-Robin Matching for Input and Output Buffered Switches" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 12, pp. 3290-3294, December 2001, doi: .
Abstract: We present iterative round-robin matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is altered in the suggested algorithm to enhance the switch performance. Simulation results under Bernoulli traffic show the suggested algorithm is more appropriate than iSLIP for cell scheduling of input and output buffered switches.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_12_3290/_p
Copy
@ARTICLE{e84-b_12_3290,
author={Man-Soo HAN, },
journal={IEICE TRANSACTIONS on Communications},
title={Iterative Round-Robin Matching for Input and Output Buffered Switches},
year={2001},
volume={E84-B},
number={12},
pages={3290-3294},
abstract={We present iterative round-robin matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is altered in the suggested algorithm to enhance the switch performance. Simulation results under Bernoulli traffic show the suggested algorithm is more appropriate than iSLIP for cell scheduling of input and output buffered switches.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Iterative Round-Robin Matching for Input and Output Buffered Switches
T2 - IEICE TRANSACTIONS on Communications
SP - 3290
EP - 3294
AU - Man-Soo HAN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2001
AB - We present iterative round-robin matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is altered in the suggested algorithm to enhance the switch performance. Simulation results under Bernoulli traffic show the suggested algorithm is more appropriate than iSLIP for cell scheduling of input and output buffered switches.
ER -
English
