Design and analysis of scheduling algorithms for switches with reconfiguration overhead

Xin Li, M. Hamdi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

Abstract

Hybrid architectures with electronic buffering/processing and optical switching fabric are receiving a lot of attention as potential candidates for the design of scalable high-performance switches/routers. However, the reconfiguration overhead of optical fabrics introduces new challenges for traffic scheduling across these switches. Existing algorithms proposed for this architecture can be classified as either batch-scheduling or single-scheduling. The paper analyzes and compares the performance of these two scheduling classes. The comparison is based on speedup requirement, average and worst-case delay and algorithm efficiency. Moreover, analytical models for the stability and average delay of single-scheduling algorithms are introduced. We demonstrate that these results are helpful in determining the right type of algorithm and choosing the appropriate algorithm parameters for a given switch system.

Original languageEnglish
Title of host publicationHPSR 2003 - 2003 Workshop on High Performance Switching and Routing
PublisherIEEE Computer Society
Pages61-66
Number of pages6
ISBN (Print)0780377109, 9780780377103
DOIs
Publication statusPublished - 2003
Externally publishedYes
Event2003 Workshop on High Performance Switching and Routing, HPSR 2003 - Torino, Italy
Duration: 24 Jun 200327 Jun 2003

Publication series

NameIEEE International Conference on High Performance Switching and Routing, HPSR
ISSN (Print)2325-5595
ISSN (Electronic)2325-5609

Conference

Conference2003 Workshop on High Performance Switching and Routing, HPSR 2003
Country/TerritoryItaly
CityTorino
Period24/06/0327/06/03

Fingerprint

Dive into the research topics of 'Design and analysis of scheduling algorithms for switches with reconfiguration overhead'. Together they form a unique fingerprint.

Cite this