Performance analysis of variable packet size crosspoint-queued switch

The performance analysis of the variable packet size crosspoint queued switch is presented in this paper. Packet switch throughput and average latency are evaluated under Interrupted Bernoulli Process incoming traffic pattern. It is shown that among the observed algorithms, the longest queue first algorithm has the highest throughput with short crosspoint buffers, but the highest average latency. Also, we establish that the choice of the scheduling algorithm does not play a significant role in the switch performance if the buffers are long enough. Therefore, the round robin algorithm becomes the best choice for implementation due to its simplicity.