Design and performance analysis of a practical load-balanced switch

TLDR: This paper analyzes a practical load balanced switch, called the Byte-Focal switch, which uses packet-by-packet scheduling to significantly improve the delay performance over switches of comparable complexity and shows that the average queueing delay is roughly linear with the switch size N.

Abstract: The load-balanced (LB) switch proposed by CS Chang et al consists of two stages First, a load-balancing stage converts arriving packets into uniform traffic Then, a forwarding stage transfers packets from the line-cards to their final output destination Load-balanced switches do not need a centralized scheduler and can achieve 100% throughput for a broad class of traffic distributions However, load-balanced switches may cause packets at the output port to be out of sequence Several schemes have been proposed to tackle the out of- sequence problem of the load-balanced switch They are either too complex to implement, or introduce a large additional delay In this paper, we present a practical load-balanced switch, called the Byte-Focal switch, which uses packet-by-packet scheduling to significantly improve the delay performance over switches of comparable complexity We prove that the queues at the input need only finite buffering, and that the overall switch is stable under any traffic matrix Our analysis shows that the average queuing delay is roughly linear with the switch size N, and although the worst case resequencing delay is N2, the average resequencing delay is much smaller This means that we can reduce the required resequencing buffer size significantly