Performance analysis of a robust scheduling algorithm for scalable input-queued switches

Itamar Elhanany, Dan Sadot

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

Abstract

In this paper a high-performance, robust and scalable scheduling algorithm for input-queued switches, called distributed sequential allocation (DISA), is presented and analyzed. Contrary to pointer-based arbitration schemes, the algorithm proposed is based on a synchronized channel reservation cycle whereby each input selects a designated output, considering both its local requests as well as global channel availability information. The distinctiveness of the algorithm is in its ability to offer high-performance when multiple cells are transmitted within each switching intervals. The subsequent relaxed switching-time requirement allows for the utilization of commercially available crosspoint switches, yielding a pragmatic and scalable solution for high port-density switching platforms. The efficiency of the algorithms and its robustness is established through analysis and computer simulations addressing diverse traffic scenarios.

Original languageEnglish
Pages (from-to)588-594
Number of pages7
JournalConference Record - International Conference on Communications
Volume1
StatePublished - 1 Jan 2003
Event2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States
Duration: 11 May 200315 May 2003

Keywords

  • Input-queued switches
  • Non-uniform destination distribution
  • Packet scheduling algorithms
  • Switch fabric

Fingerprint

Dive into the research topics of 'Performance analysis of a robust scheduling algorithm for scalable input-queued switches'. Together they form a unique fingerprint.

Cite this