Efficient randomized algorithms for input-queued switch scheduling
Devavrat Shah, Paolo Giaccone, Balaji Prabhakar · IEEE Micro · 2002
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.