An efficient randomized algorithm for input-queued switch scheduling

Abstract

AbsrructThe essential problem in the design of high-performance schedulers for input-queued switches is the determination, in each time slot, of a good matching between inputs and outputs for the transfer of packets. The rapid increase of line rates is making this very dmcult: finding good matchings takes time, and there is very little time at the highest… (More)
DOI: 10.1109/HIS.2001.946686

Topics

10 Figures and Tables

Slides referencing similar topics