The dual round robin pseudo-grant matching for high-speed packet switches

Virtual output queueing (VoQ) in conjunction with matching algorithms have been proposed to overcome the HOL problem in input queued (IQ) high-speed switches. The dual round-robin matching (DRRM) scheme, has been shown to achieve good performance while being easy to build to high-speed and scalable switches. In this paper, we present a variant and improved version of the DRRM scheme, termed the pseudo-grant dual round-robin matching (PDRRM) algorithm. The PDRRM gives a pseudo-grant to a needy input to increase the number of matches per time slot. We have evaluated the PDRRM using extensive simulations. Our results demonstrate that using the "pseudo-grant" concept results in significant improvement in the performance of DRRM under different networking scenarios. In addition, PDRRM is conjectured to achieve an asymptotic 100% throughput for any arrival pattern.