Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Shah et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: