IEICE TRANSACTIONS on Communications
Credit-Based Scheduling Algorithms for Input Queued Switch
Summary :
The input queued (IQ) switching architecture is becoming an attractive alternative for high-speed switches owing to its scalability. In this paper, three new algorithms, referred to as the maximum credit first (MCF), enhanced MCF (EMCF), and iterative MCF (IMCF) algorithms, are introduced. Simulations show that both MCF and IMCF have similar performance as the Birkhoff-von Neumann decomposition (BVND) algorithm, which can provide cell delay bound and 100% throughput, with lower off-line computational and on-line memory complexity. Simulations also show the fairness of MCF is much better than that of BVND. Theoretic analysis shows that the EMCF algorithm has a better performance than MCF in terms of throughput and cell delay with the same complexity level as MCF. Simulation results indicate the EMCF algorithm has much lower average cell delay and delay variance as compared to the BVND algorithm.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E85-B No.9 pp.1698-1705
- Publication Date
- 2002/09/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- 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
Jinhui LI, Nirwan ANSARI, "Credit-Based Scheduling Algorithms for Input Queued Switch" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 9, pp. 1698-1705, September 2002, doi: .
Abstract: The input queued (IQ) switching architecture is becoming an attractive alternative for high-speed switches owing to its scalability. In this paper, three new algorithms, referred to as the maximum credit first (MCF), enhanced MCF (EMCF), and iterative MCF (IMCF) algorithms, are introduced. Simulations show that both MCF and IMCF have similar performance as the Birkhoff-von Neumann decomposition (BVND) algorithm, which can provide cell delay bound and 100% throughput, with lower off-line computational and on-line memory complexity. Simulations also show the fairness of MCF is much better than that of BVND. Theoretic analysis shows that the EMCF algorithm has a better performance than MCF in terms of throughput and cell delay with the same complexity level as MCF. Simulation results indicate the EMCF algorithm has much lower average cell delay and delay variance as compared to the BVND algorithm.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_9_1698/_p
Copy
@ARTICLE{e85-b_9_1698,
author={Jinhui LI, Nirwan ANSARI, },
journal={IEICE TRANSACTIONS on Communications},
title={Credit-Based Scheduling Algorithms for Input Queued Switch},
year={2002},
volume={E85-B},
number={9},
pages={1698-1705},
abstract={The input queued (IQ) switching architecture is becoming an attractive alternative for high-speed switches owing to its scalability. In this paper, three new algorithms, referred to as the maximum credit first (MCF), enhanced MCF (EMCF), and iterative MCF (IMCF) algorithms, are introduced. Simulations show that both MCF and IMCF have similar performance as the Birkhoff-von Neumann decomposition (BVND) algorithm, which can provide cell delay bound and 100% throughput, with lower off-line computational and on-line memory complexity. Simulations also show the fairness of MCF is much better than that of BVND. Theoretic analysis shows that the EMCF algorithm has a better performance than MCF in terms of throughput and cell delay with the same complexity level as MCF. Simulation results indicate the EMCF algorithm has much lower average cell delay and delay variance as compared to the BVND algorithm.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Credit-Based Scheduling Algorithms for Input Queued Switch
T2 - IEICE TRANSACTIONS on Communications
SP - 1698
EP - 1705
AU - Jinhui LI
AU - Nirwan ANSARI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2002
AB - The input queued (IQ) switching architecture is becoming an attractive alternative for high-speed switches owing to its scalability. In this paper, three new algorithms, referred to as the maximum credit first (MCF), enhanced MCF (EMCF), and iterative MCF (IMCF) algorithms, are introduced. Simulations show that both MCF and IMCF have similar performance as the Birkhoff-von Neumann decomposition (BVND) algorithm, which can provide cell delay bound and 100% throughput, with lower off-line computational and on-line memory complexity. Simulations also show the fairness of MCF is much better than that of BVND. Theoretic analysis shows that the EMCF algorithm has a better performance than MCF in terms of throughput and cell delay with the same complexity level as MCF. Simulation results indicate the EMCF algorithm has much lower average cell delay and delay variance as compared to the BVND algorithm.
ER -
English
