Sciweavers

INFOCOM
2007
IEEE

Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup

14 years 5 months ago
Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup
— A good crossbar switch scheduler should be able to achieve 100% throughput and maintain fairness among competing flows. A pure input-queued (IQ) non-buffered switch requires an impractically complex scheduler to achieve this goal. Common solutions are to use crossbar speedup and/or buffered crossbar. In this paper, we explore this issue in a buffered crossbar without speedup. We first discuss the conflict between fairness and throughput and the fairness criteria in crossbar switch scheduling, and justify that a desirable scheduler should sustain full bandwidth for admissible traffic and ensure max-min fairness for non-admissible traffic. Then we describe an adaptive maxmin fair scheduling (AMFS) algorithm and show by analysis and simulation that it can provide both 100% throughput and max-min fairness. Finally we briefly discuss the hardware implementation of the AMFS algorithm.
Xiao Zhang, Satya Ranjan Mohanty, Laxmi N. Bhuyan
Added 03 Jun 2010
Updated 03 Jun 2010
Type Conference
Year 2007
Where INFOCOM
Authors Xiao Zhang, Satya Ranjan Mohanty, Laxmi N. Bhuyan
Comments (0)