Hierarchical round-robin matching for virtual output queuing switches

We propose a new scheduling algorithm for VOQ switches called hierarchical round-robin matching (HRRM). Performance evaluation of the proposed algorithm under four different traffic models is given and compared with other well-known algorithms. Simulation results show that HRRM performs well for different types of traffic. It achieves 100% throughput under uniformly distributed traffic, and provides over 95% throughput under several non-uniformly distributed traffic patterns. Special attention should be paid to short packet awaiting time for each load under uniformly distributed traffic, and for a load lower than about 0.8 under non-uniformly distributed traffic.