Credit-based scheduling algorithms for input queued switch

Jinhui Li, Nirwan Ansari

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)1698-1705
Number of pages8
JournalIEICE Transactions on Communications
VolumeE85-B
Issue number9
StatePublished - Sep 2002

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Keywords

  • Input queued switch
  • Scheduling algorithm

Fingerprint Dive into the research topics of 'Credit-based scheduling algorithms for input queued switch'. Together they form a unique fingerprint.

Cite this