Credit-based scheduling algorithms for input queued switch

Document Type

Article

Publication Date

1-1-2002

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.

Identifier

0036759086 (Scopus)

Publication Title

IEICE Transactions on Communications

ISSN

09168516

First Page

1698

Last Page

1705

Issue

9

Volume

E85-B

This document is currently not available here.

Share

COinS