Performance evaluation of crosspoint queued switch under the heavy traffic
Milutin Radonjić, Igor Radusinović, Zoran Veljović, Ivo Maljević · 2011
In this paper, the performance analysis of a 2×2 crosspoint queued switch is presented. The analysis is performed under the non-admissible traffic pattern, for three scheduling algorithms: round-robin, frame-based-round-robin-matching and longest-queue-first. Throughput, average cell latency and memory requirements for buffer implementation are observed. In addition to these parameters which are usually used for switch performance evaluation, inter-flow fairness is also analyzed. The results show that very long buffers are required in order to achieve good performance under the traffic overload, even for small switches. The longest-queue-first algorithm showed higher throughput and lower memory requirements, but worse latency and fairness than other two observed algorithms.