Packet delay variation analysis of the CQ switch under uniform traffic

This paper presents the results of the packet delay variation analysis for 32×32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exaustive-round-robin and frame-based-round-robin-matching. The results have shown that the round-robin algorithm has the least packet delay variation among the observed algorithms.