Scheduling Algorithms for CIOQ Switches

This proposal deals with the design of scheduling algorithms for Combined Input and Output Queued (CIOQ) switches. For crossbar based switches, we demonstrate the poor performance of commonly used scheduling algorithms under overload traffic conditions using targeted stress tests and present ideas to develop robust, stress resistant versions of these algorithms which are still simple enough to be implemented in high speed switches. For buffered crossbar based multi-stage switches, we introduce a novel mechanism called distributed scheduling. Distributed scheduling is similar to crossbar scheduling used in switches with small port counts, but is both distributed and coarse-grained to enable high-speed implementations of scheduling algorithms in high capacity, high performance switches. In this proposal, we outline methods and ideas to comprehensively study and evaluate distributed scheduling. Scheduling Algorithms for CIOQ Switches 1