A high-throughput scheduling algorithm for a buffered crossbar switch fabric
Tara Javidi, R.B. Magill, T. Hrabik · 2002
We examine high-throughput scheduling algorithms for buffered crossbar switch fabrics containing one buffer per crosspoint. We propose a scheduling system that uses longest queue first (LQF) scheduling for virtual output queues (VOQs) at the inputs and round-robin (RR) scheduling for the crosspoints. It is shown, through fluid model techniques, that this system achieves 100% throughput for input traffic that satisfies the strong law of large numbers and that produces a load /spl les/1/N for any input/output pair of an N/spl times/N switching fabric. Simulations indicate that 100% throughput may be attained for a much larger class of admissible loads.