Fair and smooth scheduling for virtual output queuing switches achieving 100% throughput

Abstract

Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100% switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burstiness. This paper presents a new scheduling algorithm, Worst-case Iterative Longest Port First (W/LPF), which improves the performance of the well-known scheduler Iterative Longest Port First (iLPF) such that both cell latency and output burstiness are well controlled. Simulation results are provided to verify how WiLPF outperforms iLPF. © Springer-Verlag Berlin Heidelberg 2005.