A New Practical Scheduling Algorithm for Buffered Crossbar Switches

Recently, buffered-crossbar (CICQ) switch is becoming more and more attractive to high performance router builders than bufferless schemes, because it can achieve throughput, rate and delay guarantees. In this article, we propose a practical scheduling scheme called the weighted quantitative queue longest and least scheduled first, shorted by WQ²L²SF. The main features of this scheduling algorithm are in its easier implementation in hardware, as the time complexities is only O(logN), and fewer hardware resources are needed than existing schemes. We proved that under a speedup factor of 2, our algorithm can achieve 100% throughput. Finally, Simulation results show that our scheduling scheme can achieve good delay and stability performances