The Community for Technology Leaders
Green Image
ABSTRACT
<p>High-performance schedulers for input-queued (IQ) switches must find, for each time slot, a good matching between inputs and outputs to transfer packets. At high line rates or for large switches, finding good matchings is complicated. A suite of randomized algorithms for switch scheduling provides performance comparable to that of well-known, effective matching algorithms, yet is simple to implement.</p>
INDEX TERMS
CITATION

D. Shah, P. Giaccone and B. Prabhakar, "Efficient Randomized Algorithms for Input-Queued Switch Scheduling," in IEEE Micro, vol. 22, no. , pp. 10-18, 2002.
doi:10.1109/40.988685
89 ms
(Ver 3.3 (11022016))